Pages that link to "Item:Q4539500"
From MaRDI portal
The following pages link to Efficient Coding of Nontriangular Mesh Connectivity (Q4539500):
Displaying 10 items.
- Linear-time compression of 2-manifold polygon meshes into information-theoretically optimal number of bits (Q545998) (← links)
- Quick encoding of plane graphs in \(\log _{2}14\) bits per edge (Q975433) (← links)
- Geometric compression of a quadrilateral mesh (Q1004851) (← links)
- Wrap \& Zip decompression of the connectivity of triangle meshes compressed with edgebreaker (Q1968984) (← links)
- Efficient compression of non-manifold polygonal meshes (Q1968989) (← links)
- Triangle strip compression (Q2758559) (← links)
- Optimizing Markov models with applications to triangular connectivity coding (Q2921686) (← links)
- Context-Based Entropy Encoding Method for Connectivity Compression of Meshes (Q3406334) (← links)
- POINTERLESS IMPLEMENTATION OF HIERARCHICAL SIMPLICIAL MESHES AND EFFICIENT NEIGHBOR FINDING IN ARBITRARY DIMENSIONS (Q3503108) (← links)
- Hierarchical representation and coding of surfaces using 3-D polygon meshes (Q4419963) (← links)