Introduction to Solid Modeling
Introduction to Solid Modeling
Representing geometric structures in d dimensions: topology and order
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Optimizing triangle strips for fast rendering
Proceedings of the 7th conference on Visualization '96
Primitives for the manipulation of general subdivisions and the computation of Voronoi
ACM Transactions on Graphics (TOG)
Matchmaker: manifold BReps for non-manifold r-sets
Proceedings of the fifth ACM symposium on Solid modeling and applications
Directed edges—A scalable representation for triangle meshes
Journal of Graphics Tools
Star-vertices: a compact representation for planar meshes with adjacency information
Journal of Graphics Tools
Edgebreaker: Connectivity Compression for Triangle Meshes
IEEE Transactions on Visualization and Computer Graphics
Near-optimal connectivity encoding of 2-manifold polygon meshes
Graphical Models - Special issue: Processing on large polygonal meshes
3D Compression Made Simple: Edgebreaker with Zip&Wrap on a Corner-Table
SMI '01 Proceedings of the International Conference on Shape Modeling & Applications
Winged edge polyhedron representation.
Winged edge polyhedron representation.
Optimal succinct representations of planar maps
Proceedings of the twenty-second annual symposium on Computational geometry
Random-Accessible Compressed Triangle Meshes
IEEE Transactions on Visualization and Computer Graphics
Random accessible hierarchical mesh compression for interactive visualization
SGP '09 Proceedings of the Symposium on Geometry Processing
Explicit array-based compact data structures for triangulations
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Data-Parallel Decompression of Triangle Mesh Topology
Computer Graphics Forum
Zipper: A compact connectivity data structure for triangle meshes
Computer-Aided Design
Mesh segmentation for parallel decompression on GPU
CVM'12 Proceedings of the First international conference on Computational Visual Media
Triangle mesh compression along the Hamiltonian cycle
The Visual Computer: International Journal of Computer Graphics
| Hi-index | 0.00 |
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.