Multi-path algorithm for triangle strips

Proceedings of Computer Graphics International Conference, CGI

Volumn , Issue , 2004, Pages 2-9

  Vaněček, Petr ^a   Kolingerov́, Ivana ^a  

^a UNIVERSITY OF WEST BOHEMIA   (Czech Republic)

Author keywords

Computer graphics; Dual graph; Triangle; Triangle strips

Indexed keywords

ALGORITHMS; COMPUTER AIDED DESIGN; COMPUTER AIDED MANUFACTURING; DATA COMMUNICATION SYSTEMS; DATA REDUCTION; GEOGRAPHIC INFORMATION SYSTEMS; GRAPH THEORY; MATHEMATICAL TRANSFORMATIONS; VISUALIZATION;

DUAL GRAPH; TRIANGLE STRIPS; TRIANGLES;

COMPUTER GRAPHICS;

EID: 5444244329     PISSN: 15301052     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. K. Akeley, P.Haeberli, and D.Burns, tomesk.c. C Program on SGI Develope's Toolbox CD, 1990.
2. O. Belmonte, J. Ribelles, I. Remolar, and M. Chover. Searching triangle strips guided by simplification criterion. In V. Skala, editor, WSCG 2001 Conference Proceedings, 2001.
3. CCGDV, University of West Bohemia. Data archive, http://herakles.zcu.cz/ research/mve/download.php.
4. N. Christophides. Graph Theory, An Algorithmic Approach. Academic Press, New York, 1975.
5. CYBERWARE. Sample models, http://www.cyberware.com/samples/.
6. M.V.G. da Silva, O.M. van Kaick, and H. Pedrini. Fast mesh rendering through efficient triangle strip generation. In WSCG'2002, pages 127-134, 2002.
7. J. El-Sana, E. Azanli, and A. Varshney. Skip strips: Maintaining triangle strips for view-dependent rendering. In Proceedings of the Conference on Visualization 99, pages 131-138. IEEE Computer Society Press, 1999.
8. F. Evans. Stripe, 1998. http://www.cs.sunysb.edu/ stripe/.
9. F. Evans, 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.
10. F. Evans, S. Skiena, and A. Varshney. Optimizing triangle strips for fast rendering. Technical report, 1996.
11. Georgia Institute of Technology. Large geometric models archive, http://www.cc.gatech.edu/projects/ large models/.
12. W. Kocay. An extension of the multi-path algorithm for finding hamilton cycles, 1992.
13. D. Kommann. Fast and simple triangle strip generation. Technical report, VMS Finland, Espoo, Finland, 1999.
14. S. Skiena. The Algorithm Design Manual. Telos Pr, 1997.
15. B. Speckmann and I. Snoeyink. Easy triangle strips for TIN terrain models. In CCCG 1997, 1997.
16. Stanford Computer Graphics Laboratory. The Stanford 3d scanning repository, http://graphics.stanford.edu/ data/ 3Dscanrep/.
17. A.J. Stewart. Tunneling for triangle strips in continuous level-of-detail meshes. In Graphics Interface, pages 91-100, 2001.
18. P. Vaněček. Comparison of stripification techniques.In 6-th Central European Seminar on Computer Graphics CESCG'02, pages 65-74, 2002.
19. X. Xiang, M. Held, and J.S.B. Mitchell. Fast and effective stripification of polygonal surface models. In SODA: ACM-SIAM Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms), 1999.