An improved vertex caching scheme for 3D mesh rendering

IEEE Transactions on Visualization and Computer Graphics

Volumn 12, Issue 4, 2006, Pages 640-648

  Lin, Gang ^a,c   Yu, Thomas P Y ^b  

^a RENSSELAER POLYTECHNIC INSTITUTE   (United States)

^b Rensselaer Polytechnic Institute   (United States)

^c UNIVERSITY OF ARIZONA   (United States)

Author keywords

Efficient rendering; Polygon mesh; Progressive mesh; Rendering sequence; Vertex cache

Indexed keywords

EFFICIENT RENDERING; POLYGON MESH; PROGRESSIVE MESH; RENDERING SEQUENCE; VERTEX CACHE;

ALGORITHMS; COMPUTATIONAL METHODS; DATA PROCESSING; OPTICAL RESOLVING POWER; SMART CARDS;

COMPUTER GRAPHICS;

ALGORITHM; ARTICLE; COMPUTER ASSISTED DIAGNOSIS; COMPUTER GRAPHICS; COMPUTER INTERFACE; EVALUATION; IMAGE ENHANCEMENT; INFORMATION RETRIEVAL; MATHEMATICAL COMPUTING; METHODOLOGY; SIGNAL PROCESSING; THREE DIMENSIONAL IMAGING;

ALGORITHMS; COMPUTER GRAPHICS; IMAGE ENHANCEMENT; IMAGE INTERPRETATION, COMPUTER-ASSISTED; IMAGING, THREE-DIMENSIONAL; INFORMATION STORAGE AND RETRIEVAL; NUMERICAL ANALYSIS, COMPUTER-ASSISTED; SIGNAL PROCESSING, COMPUTER-ASSISTED; USER-COMPUTER INTERFACE;

EID: 33744773843     PISSN: 10772626     EISSN: None     Source Type: Journal    
DOI: 10.1109/TVCG.2006.59     Document Type: Article

References (24)

1. M. Levoy, "The Digital Michelangelo Project," Computer Graphics Forum, vol. 18, no. 3, pp. 13-16, 1999.
2. M. Deering, "Geometry Compression," Proc. 22nd Ann. Conf. Computer Graphics and Interactive Techniques, 1999.
3. M.M. Chow, "Optimized Geometry Compression for Real-Time Rendering," Proc. Eighth Conf. Visualization, 1997.
4. J. Neider et al., OpenGL Programming Guide: The Official Guide to Learning OpenGL, release 1. Addison-Wesley, 1993.
5. M.B. Dillencourt, "Finding Hamiltonian Cycles in Delaunay Triangulations is NP-Complete," Discrete Applied Math., vol. 64, no. 3, pp. 207-217, 1996.
6. R. Estkowski, J.S. B. Mitchell, and X. Xiang, "Optimal Decomposition of Polygonal Models into Triangle Strips," Proc. 18th Ann. Symp. Computational Geometry, 2002.
7. F. Evans, S. Skiena, and A. Varshney, "Optimizing Triangle Strips for Fast Rendering," Proc. Seventh Conf. Visualization, 1996.
8. H. Hoppe, "Optimization of Mesh Locality for Transparent Vertex Caching," Proc. 26th Ann. Conf. Computer Graphics and Interactive Techniques, 1999.
9. X. Xiang, M. Held, and J. Mitchell, "Fast and Effective Stripification of Polygon Surface Models," Proc. Symp. Interative 3D Graphics, 1999.
10. P. Diaz-Gutierrez et al., "Constrained Strip Generation and Management for Efficient Interactive 3D Rendering," Proc. Computer Graphics Int'l Conf. (CGI), 2005.
11. A. Bogomjakov and C. Gotsman, "Universal Rendering Sequences for Transparent Vertex Caching of Progressive Meshes," Computer Graphics Forum, vol. 21, no. 2, pp. 137-148, 2002.
12. Y. Zhu, "Uniform Remeshing with an Adaptive Domain: A New Scheme for View-Dependent Level-of-Detail Rendering of Meshes," IEEE Trans. Visualization and Computer Graphics, vol. 11, no. 3, pp. 306-316, May-June 2005.
13. Z. Karni, A. Bogomjakov, and C. Gotsman, "Efficient Compression and Rendering of Multi-Resolution Meshes," Proc. Conf. Visualization, 2002.
14. G. Lin and T.P. Yu, "Greedy Algorithms for Rendering Sequence Generation of Triangle Meshes for Controllable and FIFO Cache Models," manuscript, 2004.
15. E. Cuthill and J. McKee, "Reducing the Bandwidth of Sparse Symmetric Matrices," Proc. 1969 24th Nat'l ACM Conf., 1969.
16. P. Alliez and M. Desbrun, "Valence-Driven Connectivity Encoding for 3D Meshes," Proc. Eurographics Conf., 2001.
17. S. Sloan, "An Algorithm for Profile and Wavefront Reduction of Sparse Matrices," Int'l J. Numerical Methods Eng., vol. 23, pp. 1315-1324, 1986.
18. W.J. Schroeder, J.A. Zarge, and W.E. Lorensen, "Decimation of Triangle Meshes," Proc. 19th Ann. Conf. Computer Graphics and Interactive Techniques, 1992.
19. H. Hoppe, "Progressive Meshes," Proc. 23rd Ann. Conf. Computer Graphics and Interactive Techniques, 1996.
20. M.-E. Algorri and F. Schmitt, "Mesh Simplification2C" Proc. Eurographics Conf., 1996.
21. R. Ronfard, J. Rossignac, and J. Rossignac, "Full-Range Approximation of Triangulated Polyhedra," Proc. Eurographics Conf., 1996.
22. A.D. Kalvin and R.H. Taylor, "Superfaces: Polygonal Mesh Simplification with Bounded Error," IEEE Computer Graphics and Applications, vol. 16, no. 3, pp. 64-77, May 1996.
23. N. Gibbs, W.J. Poole, and P. Stockmeyer, "An Algorithm for Reducing the Bandwidth and Profile of a Sparse Miatrix," SIAM J. Numerical Analysis, vol. 18, no. 2, pp. 235-251, 1976.
24. J. Diaz, J. Petit, and M. Serna, "A Survey of Graph Layout Problems," ACM Computing Surveys, vol. 34, no. 3, pp. 313-356, 2002.