Efficient Coding of Nontriangular Mesh Connectivity
From MaRDI portal
Recommendations
Cited in
(14)- An edgebreaker-based efficient compression scheme for regular meshes
- Near-Optimal Connectivity Encoding of 2-Manifold Polygon Meshes
- Hierarchical representation and coding of surfaces using 3-D polygon meshes
- Linear-time compression of 2-manifold polygon meshes into information-theoretically optimal number of bits
- Quick encoding of plane graphs in \(\log _{2}14\) bits per edge
- Optimizing Markov models with applications to triangular connectivity coding
- scientific article; zbMATH DE number 2064521 (Why is no real title available?)
- Geometric compression of a quadrilateral mesh
- Wrap \& Zip decompression of the connectivity of triangle meshes compressed with edgebreaker
- POINTERLESS IMPLEMENTATION OF HIERARCHICAL SIMPLICIAL MESHES AND EFFICIENT NEIGHBOR FINDING IN ARBITRARY DIMENSIONS
- Triangle strip compression
- Context-Based Entropy Encoding Method for Connectivity Compression of Meshes
- Efficient compression of non-manifold polygonal meshes
- Edgebreaker on a Corner Table: A Simple Technique for Representing and Compressing Triangulated Surfaces
This page was built for publication: Efficient Coding of Nontriangular Mesh Connectivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4539500)