Triangle strip compression

DOI10.1111/1467-8659.00481MaRDI QIDQ2758559zbMATH OpenOpenAlexFDO

Authors Martin Isenburg

Publication date 14 May 2002

Published in Computer Graphics Forum (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1111/1467-8659.00481

zbMATH Keywords

mesh compressionstripification

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Computing methodologies and applications (68U99)

Recommendations

• scientific article; zbMATH DE number 2064521
• Efficient Coding of Nontriangular Mesh Connectivity
• Optimal decomposition of polygonal models into triangle strips
• Near-Optimal Connectivity Encoding of 2-Manifold Polygon Meshes
• Wrap \& Zip decompression of the connectivity of triangle meshes compressed with edgebreaker

Cited in

(12)

• Compression of coordinates of triangulation nodes
• Wrap \& Zip decompression of the connectivity of triangle meshes compressed with edgebreaker
• Cluster parallel rendering based on encoded mesh
• Sequential Triangle Strip Generator Based on Hopfield Networks
• Quadrilateral meshes stripification
• scientific article; zbMATH DE number 2064521 (Why is no real title available?)
• Efficient Coding of Nontriangular Mesh Connectivity
• Optimal decomposition of polygonal models into triangle strips
• scientific article; zbMATH DE number 1872154 (Why is no real title available?)
• Compressing the Property Mapping of Polygon Meshes
• Linear-time compression of 2-manifold polygon meshes into information-theoretically optimal number of bits
• The vertex-adjacency dual of a triangulated irregular network has a Hamiltonian cycle.

This page was built for publication: Triangle strip compression

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2758559)