DStrips: Dynamic triangle strips for real-time mesh simplification and rendering

Proceedings - Pacific Conference on Computer Graphics and Applications

Volumn 2003-January, Issue , 2003, Pages 271-280

  Shafae, M ^a   Pajarola, R ^a  

^a Ringgold Standard Institution Informatics   (United States)

Author keywords

Computer graphics; Costs; Data structures; Geometry; Hardware; Mesh generation; Performance gain; Rendering (computer graphics); Strips; Visualization

Indexed keywords

COMPUTER HARDWARE; COSTS; DATA STRUCTURES; DATA VISUALIZATION; FLOW VISUALIZATION; GEOMETRY; GRAPHIC METHODS; HARDWARE; MESH GENERATION; RENDERING (COMPUTER GRAPHICS); VISUALIZATION;

INTERACTIVE VISUALIZATIONS; MESH SIMPLIFICATIONS; MULTIRESOLUTION; MULTIRESOLUTION MESH; PERCEPTUAL ERRORS; PERFORMANCE GAIN; STRIPS; TRIANGLE STRIPS;

COMPUTER GRAPHICS;

EID: 84885399039     PISSN: 15504085     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PCCGA.2003.1238269     Document Type: Conference Paper

References (30)

1. K. Akeley, P. Haeberli, and D. Burns. The tomesh.c program. Technical Report SGI Developer's Toolbox CD, Silicon Graphics, 1990.
2. E. Arkin, M. Held, J. S. B. Mitchell, and S. Skiena. Hamiltonian triangulations for fast rendering. The Visual Computer, 12(9):429-444, 1996.
3. C. Beeson and J. Demer. Nvtristrip v1.1. Software available via Internet web site., November 2000. http://developer.nvidia.com/view.asp?IO=nvtristrip-v1-1.
4. C. Beeson and J. Demer. Nvtristrip, library version. Software available via Internet web site., January 2002. http://developer.nvidia.com/view.asp?IO=nvtristrip-library.
5. O. Belmonte, I. Remolar, J. Ribelles, M. Chover, C. Rebollo, and M. Fernandez. Multiresolution triangle strips. In Proceedings IASTED Invernational Conference on Visualization, Imaging and Image Processing (VIIP 2001), pages 182-187, 2001.
6. A. Bogomjakov and C. Gotsman. Universal rendering sequences for transparent vertex caching of progressive meshes. Computer Graphics Forum, 21(2):137-148, 2002.
7. P. Cignoni, C. Montani, and R. Scopigno. A comparison of mesh simplification algorithms. Computers & Graphics, 22(1):37-54, 1998.
8. L. De Floriani and E. Puppo. Hierarchical triangulation for multiresolution surface description. ACM Transactions on Graphics, 14(4):363-411, 1995.
9. M. Deering. Geometry compression. In Proceedings SIGGRAPH 95, pages 13-20. ACM SIGGRAPH, 1995.
10. M. Dillencourt. Finding hamiltonian cycles in delaunay triangulations is np-complete. In Proceedings Canadian Conference on Computational Geometry (CCCG), pages 223-228, 1992.
11. J. El-Sana, E. Azanli, and A. Varshney. Skip strips: Maintaining triangle strips for view-dependent rendering. In Proceedings IEEE Visualization 99, pages 131-138. Computer Society Press, 1999.
12. F. Evans, S. Skiena, and A. Varshney. Optimizing triangle strips for fast rendering. In Proceedings IEEE Visualization 96, pages 319-326. Computer Society Press, 1996.
13. F. Evans, S. S. Skiena, and A. Varshney. Completing sequential triangulations is hard. Technical report, Department of Computer Science, State University of New York at Stony Brook, 1996.
14. T. Funkhouser and C. Sequin. Adaptive display algorithm for interactive frame rates during visualization of complex virtual environments. In Proceedings SIGGRAPH 93, pages 247-254. ACM SIGGRAPH, 1993.
15. P. S. Heckbert and M. Garland. Survey of polygonal surface simplification algorithms. SIGGRAPH 97 Course Notes 25, 1997.
16. H. Hoppe. Progressive meshes. In Proceedings SIGGRAPH 96, pages 99-108. ACM SIGGRAPH, 1996.
17. H. Hoppe. View-dependent refinement of progressive meshes. In Proceedings SIGGRAPH 97, pages 189-198. ACM SIGGRAPH, 1997.
18. H. Hoppe. Optimization of mesh locality for transparent vertex caching. In Proceedings SIGGRAPH 99, pages 269-276. ACM SIGGRAPH, 1999.
19. M. Isenburg. Triangle strip compression. In Proceedings Graphics Interface 2000, pages 197-204, 2000.
20. J. Kim and S. Lee. Truly selective refinement of progressive meshes. In Proceedings Graphics Interface 2001, pages 101-110, 2001.
21. D. Kornmann. Fast and simple triangle strip generation. Technical Report, 1999.
22. M. Levoy, K. Pulli, B. Curless, S. Rusinkiewicz, D. Koller, L. Pereira, M. Ginzton, S. Anderson, J. Davis, J. Ginsberg, J. Shade, and D. Fulk. The digital michelangelo project: 3d scanning of large statues. In Proceedings SIGGRAPH 2000, pages 131-144. ACM SIGGRAPH, 2000.
23. P. Lindstrom and G. Turk. Evaluation of memoryless simplification. IEEE Transactions on Visualization and Computer Graphics, 5(2):98-115, April-June 1999.
24. D. Luebke and C. Erikson. View-dependent simplification of arbitrary polygonal environments. In Proceedings SIGGRAPH 97, pages 199-208. ACM SIGGRAPH, 1997.
25. D. P. Luebke. A developer's survey of polygonal simplification algorithms. IEEE Computer Graphics & Applications, 21(3):24-35, May/June 2001.
26. R. Pajarola. Fastmesh: Efficient view-dependent meshing. In Proceedings Pacific Graphics 2001, pages 22-30. IEEE, Computer Society Press, 2001.
27. A. J. Stewart. Tunneling for triangle strips in continuous level-of-detail meshes. In Proceedings Graphics Interface 01, pages 91-100, 2001.
28. K. Weiler. Edge-based data structures for solid modeling in curved-surface environments. IEEE Computer Graphics & Applications, 5(1):21-40, January 1985.
29. J. C. Xia and A. Varshney. Dynamic view-dependent simplification for polygonal models. In Proceedings IEEE Visualization 96, pages 327-334. Computer Society Press, 1996.
30. X. Xiang, M. Held, and J. S. B. Mitchell. Fast and effective stripification of polygonal surface models. In Proceedings Symposium on Interactive 3D Graphics, pages 71-78. ACM Press, 1999.