Up: Contetns
Previous: Conclusion
- 1
-
K. Akeley, P.Haeberli, and D.Burns.
tomesh.c.
C Program on SGI Develope's Toolbox CD, 1990.
- 2
-
University of West Bohemia CCGDV.
Data archive.
http://herakles.zcu.cz/ research/mve/download.php.
- 3
-
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, 2 2002.
- 4
-
E.M.Arkin, M.Held, J.S.B.Mitchell, and S.S.Skiena.
Hamiltonian triangulations for fast rendering.
Visual Comput., 12(9):429-444, 1996.
- 5
-
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.
- 6
-
F. Evans, S. Skiena, and A. Varshney.
Optimizing triangle strips for fast rendering.
In Roni Yagel and Gregory M. Nielson, editors, IEEE
Visualization '96, pages 319-326, 1996.
- 7
-
F.Evans.
Stripe, 1998.
http://www.cs.sunysb.edu/~stripe/.
- 8
-
Martin Isenburg.
Triangle strip compression.
Technical Report TR00-003, University of North Carolina at Chapel
Hill, 2000.
- 9
-
Stanford Computer Graphics Laboratory.
http://graphics.stanford.edu/ data/3Dscanrep/.
- 10
-
Georgia Institute of Technology.
Large geometric models archive.
http:// www.cc.gatech.edu/projects/large_models/.
- 11
-
A. James Stewart.
Tunneling for triangle strips in continuous level-of-detail meshes.
In Graphics Interface, pages 91-100, June 2001.
- 12
-
Xiang, Held, and Mitchell.
Fast and effective stripification of polygonal surface models
(short).
In SODA: ACM-SIAM Symposium on Discrete Algorithms (A
Conference on Theoretical and Experimental Analysis of Discrete Algorithms),
pages 985-986, 1999.
Petr Vanecek, pet@students.zcu.cz,
2002-03-19