Controllable single-strip generation for triangulated surfaces

Proceedings - Pacific Conference on Computer Graphics and Applications

Volumn , Issue , 2004, Pages 61-69

  Gopi, M ^a  

^a Irvine   (United States)

Author keywords

Constrained path planning; Fundamental cycles; Hamiltonian paths and cycles; Path planning; Stripification; Triangulation

Indexed keywords

CONSTRAINED PATH PLANNING; FUNDAMENTAL CYCLES; HAMILTONIAN PATHS AND CYCLES; STRIPIFICATION;

CONSTRAINT THEORY; HAMILTONIANS; MOTION PLANNING; PROBLEM SOLVING; TOPOLOGY; TRIANGULATION;

MATHEMATICAL MODELS;

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

References (18)

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. A. Bogomjakov and C. Gotsman. Universal rendering sequences for transparent vertex caching of progressive meshes. Computer Graphics Forum, 21(2): 137-148, 2002.
4. M. M. Chow. Optimized geometry compression for real-time rendering. In Proc. IEEE Visualization, pages 347-354, 1997.
5. M. Dillencourt. Finding hamiltonian cycles in delaunay triangulations is np-complete. In Proc. Canadian Conference on Computational Geometry, pages 223-228, 1992.
6. 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.
7. M. Gopi and D. Eppstein. Single strip triangulation of manifolds with arbitrary topology. In Proc. of EUROGRAPHICS, 2004.
8. H. Hoppe. Optimization of mesh locality for transparent vertex caching. In Proc. SIGGRAPH, pages 269-276, 1999.
9. M. Isenburg. Triangle strip compression. In Proceedings Graphics Interface 2000, pages 197-204, 2000.
10. R. Pajarola, M. Antonijuan, and R. Lario. QuadTIN: Quadtree based triangulated irregular networks. In Proc. IEEE Visualization, pages 395-402, 2002.
11. J. Rossignac. Edgebreaker: Compressing the incidence graph of triangle meshes. IEEE Transactions on Visualization and Computer Graphics, 5(1):47-61, January-March 1999.
12. M. Shafae and R. Pajarola. DStrips: Dynamic triangle strips for real-time mesh simplification and rendering. In Proc. Pacific Graphics, pages 271-280, 2003.
13. A. J. Stewart. Tunneling for triangle strips in continuous level-of-detail meshes. In Proceedings Graphics Interface, pages 91-100, 2001.
14. R. Szeliski and H.-Y. Shum. Creating full view panoramic image mosaics and environment maps. In Proc. SIGGRAPH, pages 251-258, 1997.
15. G. Taubin. Constructing hamiltonian triangle strips on quadrilateral meshes. In Int. Workshop on Visualization and Mathematics and IBM Research Tech. Rep. AC-22295., 2002.
16. C. Tourna and C. Gotsman. Triangle mesh compression. In Proceedings Graphics Interface 98, pages 26-34, 1998.
17. L. Velho, L. H. de Figueiredo, and J. Gomes. Hierarchical generalized triangle strips. The Visual Computer, 15(1):21-35, 1999.
18. X. Xiang, M. Held, and J. S. B. Mitchell. Fast and effective stripification of polygonal surface models. In Proc. Symp. on Interactive 3D Graphics, pages 71-78. ACM Press, 1999.