An Improved Vertex Caching Scheme for 3D Mesh Rendering
IEEE Transactions on Visualization and Computer Graphics
Technical Section: Comparison of triangle strips algorithms
Computers and Graphics
Efficient data reduction and cache-coherent techniques toward real-time performance
ACM SIGGRAPH 2007 courses
Massive model visualization techniques: course notes
ACM SIGGRAPH 2008 classes
A novel page-based data structure for interactive walkthroughs
Proceedings of the 2009 symposium on Interactive 3D graphics and games
Cache-oblivious ray reordering
ACM Transactions on Graphics (TOG)
Data management for SSDs for large-scale interactive graphics applications
I3D '11 Symposium on Interactive 3D Graphics and Games
Hi-index | 0.00 |
Representing a triangulated two manifold using a single triangle strip is an NP-complete problem. By introducing a few Steiner vertices, recent works find such a single-strip and hence a linear ordering of edge-connected triangles of the entire triangulation. In this paper, we highlight and exploit this linear order in efficient triangle-strip management for high-performance rendering. We present new algorithms to generate weighted single-strip representations that respect different constraint-based clustering of triangles. These functional constraints can be application dependent; for example, normal-based constraints for efficient visibility culling or spatial constraints for highly coherent vertex-caching. We also present a hierarchical single-strip-management strategy for high-performance interactive 3D rendering.