Constrained strip generation and management for efficient interactive 3D rendering

Proceedings of Computer Graphics International Conference, CGI

Volumn , Issue , 2005, Pages 115-121

  Diaz Gutierrez, Pablo ^a   Bhushan, Anusheel ^a   Gopi, M ^a   Pajarola, Renato ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Hamiltonian Cycle; Single strip; Vertex Cache; Visibility Culling; Weighted Perfect Matching

Indexed keywords

HAMILTONIAN CYCLE; SINGLE-STRIP; VERTEX CACHE; VISIBILITY CULLING;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; HAMILTONIANS; PROBLEM SOLVING; TRIANGULATION;

THREE DIMENSIONAL COMPUTER GRAPHICS;

EID: 27144436170     PISSN: 15301052     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CGI.2005.1500388     Document Type: Conference Paper

References (27)

1. K. Akeley, P. Haeberli, and D. Burns. The tomesh.c program. Technical Report SGI Developer's Toolbox CD, Silicon Graphics, 1990.
2. Esther M. Arkin, Martin Held, Joseph S. B. Mitchell, and Steven Skiena. Hamiltonian triangulations for fast rendering. The Visual Computer, 12(9):429-444, 1996.
3. Reuven Bar-Yehuda and Craig Gotsman. Time/space tradeoffs for polygon mesh rendering. SIGGRAPH 96, 15(2): 141-152, 1996.
4. O. Belmonte, I. Remolar, J. Ribelles, M. Chover, C. Rebollo, and M. Fernandez. Multiresolution triangle strips. In IASTED International Conference on Visualization, Imaging and Image Processing (VIIP 2001), pages 182-187, 2001.
5. Mike M. Chow. Optimized geometry compression for real-time rendering. In IEEE Vis. 97, pages 347-354. IEEE, Computer Society Press, 1997.
6. David Cohen-Steiner, Pierre Alliez, and Mathieu Desbrun. Variational shape approximation. SIGGRAPH '04, 23(3):905-914, 2004.
7. Michael Deering. Geometry compression. In SIGGRAPH 1995, pages 13-20. ACM SIGGRAPH, 1995.
8. Mike Dillencourt. Finding hamiltonian cycles in delaunay triangulations is np-complete. In Canadian Conference on Computational Geometry (CCCG), pages 223-228, 1992.
9. Jihad El-Sana, Elvir Azanli, and Amitabh Varshney. Skip strips: maintaining triangle strips for view-dependent rendering. In IEEE Vis. 99, pages 131-138. IEEE Computer Society Press, 1999.
10. F. Evans, S. S. Skiena, and A. Varshney. Completing sequential triangulations is hard. Technical report, Dep. of Comp. Sci., SUNYSB, 1996.
11. Francine Evans, Steven S. Skiena, and Amitabh Varshney. Optimizing triangle strips for fast rendering. In Roni Yagel and Gregory M. Nielson, editors, IEEE Vis. 96, pages 319-326, 1996.
12. Michael Garland, Andrew Willmott, and Paul S. Heckbert. Hierarchical face clustering on polygonal surfaces. In I3D 2001, pages 49-58. ACM Press, 2001.
13. M. Gopi. Controllable single-strip generation for triangulated surfaces. In Pacific Graphics 2004, pages 61-69. IEEE, Computer Society Press, 2004.
14. M. Gopi and David Eppstein. Single-strip triangulation of manifolds with arbitrary topology. Computer Graphics Forum, 23(3):371-379, 2004.
15. Hugues Hoppe. Optimization of mesh locality for transparent vertex caching. In SIGGRAPH 1999, pages 269-276. ACM Press/Addison-Wesley Publishing Co., 1999.
16. David Kornmann. Fast and simple triangle strip generation. Technical Report, 1999.
17. David Luebke and Carl Erikson. View-dependent simplification of arbitrary polygonal environments. In SIGGRAPH 1997, pages 199-208. ACM Press/Addison-Wesley Publishing Co., 1997.
18. David Luebke, Martin Reddy, Jonathan D. Cohen, Amitabh Varshney, Benjamin Watson, and Robert Huebner. Level of Detail for 3D Graphics. Morgan Kaufmann Publishers, San Francisco, California, 2003.
19. Jun Mitani and Hiromasa Suzuki. Making papercraft toys from meshes using strip-based approximate unfolding. In SIGGRAPH 2004. pages 259-263. ACM Press, 2004.
20. J. Neider, T. Davis, and M. Woo. OpenGL Programming Guide. Addison Wesley, Reading, Massachusetts, 1993.
21. Renato Pajarola, Marc Antonijuan, and Roberto Lario. QuadTIN: Quadtree based triangulated irregular networks. In IEEE Vis. 2002, pages 395-402. Computer Society Press, 2002.
22. Julius Peter Christian Peterson. Die theorie der regulären graphen. Acta Mathematica, 15:193-220, 1891.
23. William Pugh. Skip lists: a probabilistic alternative to balanced trees. Commun. ACM, 33(6):668-676, 1990.
24. Michael Shafae and Renato Pajarola. DStrips: Dynamic triangle strips for real-time mesh simplification and rendering. In Pacific Graphics 2003, pages 271-280. IEEE, Computer Society Press, 2003.
25. A. James Stewart. Tunneling for triangle strips in continuous level-of-detail meshes. In Graphics Interface 2001, pages 91-100, 2001.
26. Petr Vanecek and Ivana Kolingerová. Multi-path algorithm for triangle strips. In CGI '04, pages 2-9, 2004.
27. Xinyu Xiang, Martin Held, and Joseph S. B. Mitchell. Fast and effective stripification of polygonal surface models. In I3D 1999, pages 71-78. ACM Press, 1999.