Gang Lin
Abstract
Modern graphics cards are equipped with a vertex cache to reduce the amount of data needing to be transmitted to the graphics pipeline during rendering. To make effective use of the cache and facilitate rendering, it is key to represent a mesh in a manner that maximizes the cache hit rate. In this work, we propose a simple yet effective algorithm for generating a sequence for efficient rendering of 3D polygonal meshes based on greedy optimization. The algorithm outperforms the current state-of-the-art algorithms in terms of rendering efficiency of the resultant sequence. We also adapt it for the rendering of progressive meshes. For any simplified version of the original mesh, the rendering sequence is generated by adaptively updating the reordered sequence at full resolution. The resultant rendering sequence is cheap to compute and has reasonably good rendering performance, which is desirable to many complex rendering environments involving continuous rendering of meshes at various level of details. The experimental results on a collection of 3D meshes are provided.
- Computer Graphics Forum, vol. 18, no. 3, pp. 13-16, 1999.Google Scholar
- M. Deering, “Geometry Compression,” Proc. 22nd Ann. Conf. Computer Graphics and Interactive Techniques, 1999.Google Scholar
- M.M. Chow, “Optimized Geometry Compression for Real-Time Rendering,” Proc. Eighth Conf. Visualization, 1997. Google ScholarDigital Library
- J. Neider et al., OpenGL Programming Guide: The Official Guide to Learning OpenGL, release 1. Addison-Wesley, 1993.Google ScholarDigital Library
- Discrete Applied Math., vol. 64, no. 3, pp. 207-217, 1996. Google ScholarDigital Library
- R. Estkowski, J.S. B. Mitchell, and X. Xiang, “Optimal Decomposition of Polygonal Models into Triangle Strips,” Proc. 18th Ann. Symp. Computational Geometry, 2002. Google ScholarDigital Library
- F. Evans, S. Skiena, and A. Varshney, “Optimizing Triangle Strips for Fast Rendering,” Proc. Seventh Conf. Visualization, 1996. Google ScholarDigital Library
- H. Hoppe, “Optimization of Mesh Locality for Transparent Vertex Caching,” Proc. 26th Ann. Conf. Computer Graphics and Interactive Techniques, 1999. Google ScholarDigital Library
- X. Xiang, M. Held, and J. Mitchell, “Fast and Effective Stripification of Polygon Surface Models,” Proc. Symp. Interative 3D Graphics, 1999.Google Scholar
- P. Diaz-Gutierrez et al., “Constrained Strip Generation and Management for Efficient Interactive 3D Rendering,” Proc. Computer Graphics Int'l Conf. (CGI), 2005. Google ScholarDigital Library
- Computer Graphics Forum, vol. 21, no. 2, pp. 137-148, 2002.Google Scholar
- IEEE Trans. Visualization and Computer Graphics, vol. 11, no. 3, pp. 306-316, May-June 2005. Google ScholarDigital Library
- Z. Karni, A. Bogomjakov, and C. Gotsman, “Efficient Compression and Rendering of Multi-Resolution Meshes,” Proc. Conf. Visualization, 2002. Google ScholarDigital Library
- G. Lin and T.P. Yu, “Greedy Algorithms for Rendering Sequence Generation of Triangle Meshes for Controllable and FIFO Cache Models,” manuscript, 2004.Google Scholar
- E. Cuthill and J. McKee, “Reducing the Bandwidth of Sparse Symmetric Matrices,” Proc. 1969 24th Nat'l ACM Conf., 1969.Google ScholarDigital Library
- P. Alliez and M. Desbrun, “Valence-Driven Connectivity Encoding for 3D Meshes,” Proc. Eurographics Conf., 2001.Google ScholarCross Ref
- S. Sloan, “An Algorithm for Profile and Wavefront Reduction of Sparse Matrices,” Int'l J. Numerical Methods Eng., vol. 23, pp. 1315-1324, 1986.Google ScholarCross Ref
- W.J. Schroeder, J.A. Zarge, and W.E. Lorensen, “Decimation of Triangle Meshes,” Proc. 19th Ann. Conf. Computer Graphics and Interactive Techniques, 1992.Google ScholarDigital Library
- H. Hoppe, “Progressive Meshes,” Proc. 23rd Ann. Conf. Computer Graphics and Interactive Techniques, 1996. Google ScholarDigital Library
- M.-E. Algorri and F. Schmitt, “Mesh Simplification,” Proc. Eurographics Conf., 1996.Google ScholarCross Ref
- R. Ronfard, J. Rossignac, and J. Rossignac, “Full-Range Approximation of Triangulated Polyhedra,” Proc. Eurographics Conf., 1996.Google ScholarCross Ref
- IEEE Computer Graphics and Applications, vol. 16, no. 3, pp. 64-77, May 1996. Google ScholarDigital Library
- N. Gibbs, W.J. Poole, and P. Stockmeyer, “An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix,” SIAM J. Numerical Analysis, vol. 18, no. 2, pp. 235-251, 1976.Google Scholar
- Josep Díaz , Jordi Petit , Maria Serna, A survey of graph layout problems, ACM Computing Surveys (CSUR), v.34 n.3, p.313-356, September 2002 Google ScholarDigital Library
Index Terms
An Improved Vertex Caching Scheme for 3D Mesh Rendering
Recommendations
Universal rendering sequences for transparent vertex caching of progressive meshes
GI '01: Proceedings of Graphics Interface 2001We present methods to generate rendering sequences for triangle meshes which preserve mesh locality as much as possible. This is useful for maximizing vertex reuse when rendering the mesh using a FIFO vertex buffer, such as those available in modern 3D ...
Interactive rendering using the render cache
EGWR'99: Proceedings of the 10th Eurographics conference on RenderingInteractive rendering requires rapid visual feedback. The render cache is a new method for achieving this when using high-quality pixel-oriented renderers such as ray tracing that are usually considered too slow for interactive use. The render cache ...
SMI 2012: Full Progressive compression of manifold polygon meshes
This paper presents a new algorithm for the progressive compression of manifold polygon meshes. The input surface is decimated by several traversals that generate successive levels of detail through a specific patch decimation operator which combines ...
Comments