Near-Optimal Connectivity Encoding of 2-Manifold Polygon Meshes
From MaRDI portal
Recommendations
- Efficient Coding of Nontriangular Mesh Connectivity
- Context-Based Entropy Encoding Method for Connectivity Compression of Meshes
- An edgebreaker-based efficient compression scheme for regular meshes
- scientific article; zbMATH DE number 2064521
- Linear-time compression of 2-manifold polygon meshes into information-theoretically optimal number of bits
Cited in
(13)- An edgebreaker-based efficient compression scheme for regular meshes
- Dynamically restricted codebook-based vector quantisation scheme for mesh geometry compression
- Compressing the Property Mapping of Polygon Meshes
- Linear-time compression of 2-manifold polygon meshes into information-theoretically optimal number of bits
- Succinct representations of planar maps
- Optimizing Markov models with applications to triangular connectivity coding
- scientific article; zbMATH DE number 2064521 (Why is no real title available?)
- Wrap \& Zip decompression of the connectivity of triangle meshes compressed with edgebreaker
- Fast reconstruction of Delaunay triangulations
- Planar graphs, via well-orderly maps and trees
- Triangle strip compression
- Efficient Coding of Nontriangular Mesh Connectivity
- Efficient compression of non-manifold polygonal meshes
This page was built for publication: Near-Optimal Connectivity Encoding of 2-Manifold Polygon Meshes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4806648)
