research-article

An Improved Vertex Caching Scheme for 3D Mesh Rendering

Authors:

Thomas P. -Y. YuAuthors Info & Claims

IEEE Transactions on Visualization and Computer Graphics, Volume 12, Issue 4

Pages 640 - 648

https://doi.org/10.1109/TVCG.2006.59

Published: 01 July 2006 Publication History

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.

References

[1]

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.

Digital Library

[4]

J. Neider et al., OpenGL Programming Guide: The Official Guide to Learning OpenGL, release 1. Addison-Wesley, 1993.

Digital Library

[5]

Discrete Applied Math., vol. 64, no. 3, pp. 207-217, 1996.

Digital Library

[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.

Digital Library

[7]

F. Evans, S. Skiena, and A. Varshney, “Optimizing Triangle Strips for Fast Rendering,” Proc. Seventh Conf. Visualization, 1996.

Digital Library

[8]

H. Hoppe, “Optimization of Mesh Locality for Transparent Vertex Caching,” Proc. 26th Ann. Conf. Computer Graphics and Interactive Techniques, 1999.

Digital Library

[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.

Digital Library

[11]

Computer Graphics Forum, vol. 21, no. 2, pp. 137-148, 2002.

[12]

IEEE Trans. Visualization and Computer Graphics, vol. 11, no. 3, pp. 306-316, May-June 2005.

Digital Library

[13]

Z. Karni, A. Bogomjakov, and C. Gotsman, “Efficient Compression and Rendering of Multi-Resolution Meshes,” Proc. Conf. Visualization, 2002.

Digital Library

[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.

Digital Library

[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.

Digital Library

[19]

H. Hoppe, “Progressive Meshes,” Proc. 23rd Ann. Conf. Computer Graphics and Interactive Techniques, 1996.

Digital Library

[20]

M.-E. Algorri and F. Schmitt, “Mesh Simplification,” Proc. Eurographics Conf., 1996.

[21]

R. Ronfard, J. Rossignac, and J. Rossignac, “Full-Range Approximation of Triangulated Polyhedra,” Proc. Eurographics Conf., 1996.

[22]

IEEE Computer Graphics and Applications, vol. 16, no. 3, pp. 64-77, May 1996.

Digital Library

[23]

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.

[24]

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

Digital Library

Cited By

Kenzel MKerbl BTatzgern WIvanchenko ESchmalstieg DSteinberger M(2018)On-the-fly Vertex Reuse for Massively-Parallel Software Geometry ProcessingProceedings of the ACM on Computer Graphics and Interactive Techniques10.1145/32333031:2(1-17)Online publication date: 24-Aug-2018
https://dl.acm.org/doi/10.1145/3233303
Kerbl BKenzel MIvanchenko ESchmalstieg DSteinberger M(2018)Revisiting The Vertex CacheProceedings of the ACM on Computer Graphics and Interactive Techniques10.1145/32333021:2(1-16)Online publication date: 24-Aug-2018
https://dl.acm.org/doi/10.1145/3233302
Han SChen GNehab DSander P(2018)In-Depth BuffersProceedings of the ACM on Computer Graphics and Interactive Techniques10.1145/32031941:1(1-14)Online publication date: 25-Jul-2018
https://dl.acm.org/doi/10.1145/3203194
Show More Cited By

Index Terms

An Improved Vertex Caching Scheme for 3D Mesh Rendering
1. Computing methodologies
  1. Computer graphics
    1. Shape modeling
      1. Parametric curve and surface models
      2. Volumetric models
2. Theory of computation
  1. Randomness, geometry and discrete structures

Recommendations

Universal rendering sequences for transparent vertex caching of progressive meshes
GI '01: Proceedings of Graphics Interface 2001

We 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 ...
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 ...
Material-Discontinuity Preserving Progressive Mesh Using Vertex-Collapsing Simplification

Level Of Detail (LOD) modelling or mesh reduction has been found useful in interactive walkthrough applications. Progressive meshing techniques based on edge or triangle collapsing have been recognised useful in continuous LOD, progressive refinement, ...

Comments

Information & Contributors

Information

Published In

cover image IEEE Transactions on Visualization and Computer Graphics

IEEE Transactions on Visualization and Computer Graphics Volume 12, Issue 4

July 2006

239 pages

ISSN:1077-2626

Issue’s Table of Contents

Copyright © 2006.

Publisher

IEEE Educational Activities Department

United States

Publication History

Published: 01 July 2006

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

17
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 10 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Kenzel MKerbl BTatzgern WIvanchenko ESchmalstieg DSteinberger M(2018)On-the-fly Vertex Reuse for Massively-Parallel Software Geometry ProcessingProceedings of the ACM on Computer Graphics and Interactive Techniques10.1145/32333031:2(1-17)Online publication date: 24-Aug-2018
https://dl.acm.org/doi/10.1145/3233303
Kerbl BKenzel MIvanchenko ESchmalstieg DSteinberger M(2018)Revisiting The Vertex CacheProceedings of the ACM on Computer Graphics and Interactive Techniques10.1145/32333021:2(1-16)Online publication date: 24-Aug-2018
https://dl.acm.org/doi/10.1145/3233302
Han SChen GNehab DSander P(2018)In-Depth BuffersProceedings of the ACM on Computer Graphics and Interactive Techniques10.1145/32031941:1(1-14)Online publication date: 25-Jul-2018
https://dl.acm.org/doi/10.1145/3203194
Chen H(2017)Evaluation of triangular mesh layout techniques using large mesh simplificationMultimedia Tools and Applications10.1007/s11042-017-4607-z76:23(25391-25419)Online publication date: 1-Dec-2017
https://dl.acm.org/doi/10.1007/s11042-017-4607-z
Han SSander PWyman CYuksel C(2016)Triangle reordering for reduced overdraw in animated scenesProceedings of the 20th ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games10.1145/2856400.2856408(23-27)Online publication date: 27-Feb-2016
https://dl.acm.org/doi/10.1145/2856400.2856408
Bscaro HNunes Fdos Santos Oliveira JPereira G(2016)Comparing efficient data structures to represent geometric models for three-dimensional virtual medical trainingJournal of Biomedical Informatics10.1016/j.jbi.2016.08.01463:C(195-211)Online publication date: 1-Oct-2016
https://dl.acm.org/doi/10.1016/j.jbi.2016.08.014
Ponchio FDellepiane MJia JHamza-Lup FSchreck T(2015)Fast decompression for web-based view-dependent 3D renderingProceedings of the 20th International Conference on 3D Web Technology10.1145/2775292.2775308(199-207)Online publication date: 18-Jun-2015
https://dl.acm.org/doi/10.1145/2775292.2775308
Ni TRevillard S(2010)Efficient substitutes for subdivision surfaces in feature-quality gamesACM SIGGRAPH ASIA 2010 Courses10.1145/1900520.1900528(1-77)Online publication date: 15-Dec-2010
https://dl.acm.org/doi/10.1145/1900520.1900528
Ni TCastaño IPeters JMitchell JSchneider PVerma V(2009)Efficient substitutes for subdivision surfacesACM SIGGRAPH 2009 Courses10.1145/1667239.1667252(1-107)Online publication date: 3-Aug-2009
https://dl.acm.org/doi/10.1145/1667239.1667252
Loop CSchaefer SNi TCastaño IInakage M(2009)Approximating subdivision surfaces with Gregory patches for hardware tessellationACM SIGGRAPH Asia 2009 papers10.1145/1661412.1618497(1-9)Online publication date: 17-Dec-2009
https://dl.acm.org/doi/10.1145/1661412.1618497
Show More Cited By

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents