ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Parallel view-dependent refinement of progressive meshes
Full text PdfPdf (6.15 MB),  WmvWmv (4:55)
Source
Symposium on Interactive 3D Graphics archive
Proceedings of the 2009 symposium on Interactive 3D graphics and games table of contents
Boston, Massachusetts
SESSION: Level of detail table of contents
Pages: 169-176  
Year of Publication: 2009
ISBN:978-1-60558-429-4
Authors
Liang Hu  Hong Kong University of Science and Technology
Pedro V. Sander  Hong Kong University of Science and Technology
Hugues Hoppe  Microsoft Research
Sponsor
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 18,   Downloads (12 Months): 218,   Citation Count: 1
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1507149.1507177
What is a DOI?

ABSTRACT

We present a scheme for view-dependent level-of-detail control that is implemented entirely on programmable graphics hardware. Our scheme selectively refines and coarsens an arbitrary triangle mesh at the granularity of individual vertices, to create meshes that are highly adapted to dynamic view parameters. Such fine-grain control has previously been demonstrated using sequential CPU algorithms. However, these algorithms involve pointer-based structures with intricate dependencies that cannot be handled efficiently within the restricted framework of GPU parallelism. We show that by introducing new data structures and dependency rules, one can realize fine-grain progressive mesh updates as a sequence of parallel streaming passes over the mesh elements. A major design challenge is that the GPU processes stream elements in isolation. The mesh update algorithm has time complexity proportional to the selectively refined mesh, and moreover can be amortized across several frames. The static data structure is remarkably compact, requiring only 57% more memory than an indexed triangle list. We demonstrate real-time exploration of complex models with normals and textures.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
3
 
4
Buatois, L., Caumon, G., and Lévy, B. 2006. GPU accelerated isosurface extraction on tetrahedral grids. International Symposium on Visual Computing, pages 383--392.
 
5
Cignoni, P., Ganovelli, F., Gobbetti, E., Marton, F., Ponchio, F., and Scopigno, R. 2003. BDAM: batched dynamic adaptive meshes for high performance terrain visualization. Computer Graphics Forum, 22:505--514.
6
7
 
8
 
9
El-Sana, J. and Varshney, A. 1999. Generalized view-dependent simplification. In Proceedings of Eurographics 99, pages 83--94.
 
10
11
 
12
 
13
 
14
 
15
Kobbelt, L., Campagna, S., and peter Seidel, H. 1998. A general framework for mesh decimation. In Proceedings of Graphics Interface, pages 43--50.
 
16
17
 
18
19
 
20
 
21
 
22
 
23
Pascucci, V. 2004. Isosurface computation made simple: hardware acceleration, adaptive refinement and tetrahedral stripping. In Joint Eurographics - IEEE TVCG Symposium on Visualization (VisSym), pages 293--300.
 
24
25
 
26

Collaborative Colleagues:
Liang Hu: colleagues
Pedro V. Sander: colleagues
Hugues Hoppe: colleagues