Sciweavers

Share
TOG
2008

Efficient traversal of mesh edges using adjacency primitives

8 years 11 months ago
Efficient traversal of mesh edges using adjacency primitives
Processing of mesh edges lies at the core of many advanced realtime rendering techniques, ranging from shadow and silhouette computations, to motion blur and fur rendering. We present a scheme for efficient traversal of mesh edges that builds on the adjacency primitives and programmable geometry shaders introduced in recent graphics hardware. Our scheme aims to minimize the number of primitives while maximizing SIMD parallelism. These objectives reduce to a set of discrete optimization problems on the dual graph of the mesh, and we develop practical solutions to these graph problems. In addition, we extend two existing vertex cache optimization algorithms to produce cache-efficient traversal orderings for adjacency primitives. We demonstrate significant runtime speedups for several practical real-time rendering algorithms.
Pedro V. Sander, Diego Nehab, Eden Chlamtac, Hugue
Added 15 Dec 2010
Updated 15 Dec 2010
Type Journal
Year 2008
Where TOG
Authors Pedro V. Sander, Diego Nehab, Eden Chlamtac, Hugues Hoppe
Comments (0)
books