A stateless client for progressive view-dependent transmission

This source preferred by Richard Southern

Authors: Southern, R., Perkins, S., Steyn, B., Muller, A., Marais, P. and Blake, E.

Pages: 43-50

Publisher: ACM

Place of Publication: New York

DOI: 10.1145/363361.363375

This data was imported from DBLP:

Authors: Southern, R., Perkins, S., Steyn, B., Muller, A., Marais, P. and Blake, E.H.

Editors: Diehl, S. and Capps, M.V.

https://doi.org/10.1145/363361

Pages: 43-50

Publisher: ACM

This data was imported from Scopus:

Authors: Southern, R., Perkins, S., Steyn, B., Muller, A., Marais, P. and Blake, E.

Pages: 43-49

ISBN: 9781581133394

DOI: 10.1145/363361.363375

We present a framework for real-time view-dependent refinement, and adapt it to the task of browsing large model repositories on the Internet. We introduce a novel hierarchical representation of atomic operations based on a graph structure, and provide a correspondence between the nodes of this hierarchy and a spatial representation of these operations, called visibility spheres. Selective refinement is achieved by performing a breadth first search on the graph. We show that the graph representation allows for significant space savings. The framework presented makes options available for performance tailoring. By efficient traversal of the graph structure an ordered list of refinements can be generated which are progressive and evenly distributed over the refinement area. This list can easily be truncated to comply with polygon limitations indicated by a client. © ACM 2001.

This data was imported from Scopus:

Authors: Southern, R., Perkins, S., Steyn, B., Muller, A., Marais, P. and Blake, E.

Pages: 43-49

We present a framework for real-time view-dependent refinement, and adapt it to the task of browsing large model repositories on the Internet. We introduce a novel hierarchical representation of atomic operations based on a graph structure, and provide a correspondence between the nodes of this hierarchy and a spatial representation of these operations, called visibility spheres. Selective refinement is achieved by performing a breadth first search on the graph. We show that the graph representation allows for significant space savings. The framework presented makes options available for performance tailoring. By efficient traversal of the graph structure an ordered list of refinements can be generated which are progressive and evenly distributed over the refinement area. This list can easily be truncated to comply with polygon limitations indicated by a client.

The data on this page was last updated at 05:09 on February 24, 2020.