LR: Compact connectivity representation for triangle meshes
We propose LR (Laced Ring) - a simple data structure for representing the connectivity of manifold triangle meshes. LR provides the option to store on average either 1.08 references per triangle or 26.2 bits per triangle. Its construction, from an input mesh that supports constant-time adjacency queries, has linear space and time complexity, and involves ordering most vertices along a nearly-Hamiltonian cycle. LR is best suited for applications that process meshes with fixed connectivity, as any changes to the connectivity require the data structure to be rebuilt. We provide an implementation of the set of standard random-access, constant-time operators for traversing a mesh, and show that LR often saves both space and traversal time over competing representations.
- Research Organization:
- Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- W-7405-ENG-48
- OSTI ID:
- 1038583
- Report Number(s):
- LLNL-JRNL-468333; TRN: US201208%%684
- Journal Information:
- ACM Transactions on Graphics, Vol. 30, Issue 4
- Country of Publication:
- United States
- Language:
- English
Similar Records
eBits: Compact stream of mesh refinements for remote visualization
Practical algorithms for image-component labeling on SIMD mesh connected computers