Linear-time compression of 2-manifold polygon meshes into information-theoretically optimal number of bits

DOI10.1016/j.amc.2011.03.040zbMath1219.68160OpenAlexW2058865158MaRDI QIDQ545998

Yuh-Dauh Lyuu, Tak-Man Ma, Yen-Wu Ti

Publication date: 24 June 2011

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2011.03.040

zbMATH Keywords

3D graphic compressiongraphic compressionpolygon mesh

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Uses Software

• Edgebreaker

Cites Work

• Unnamed Item
• Unnamed Item
• Planar separators and parallel polygon triangulation.
• Short encodings of planar graphs and maps
• The geometry of linear infeasibility
• Wrap \& Zip decompression of the connectivity of triangle meshes compressed with edgebreaker
• A DNA-based graph encoding scheme with its applications to graph isomorphism problems
• Triangle Strip Compression
• Low Redundancy in Static Dictionaries with Constant Query Time
• A Census of Planar Triangulations
• Edgebreaker on a Corner Table: A Simple Technique for Representing and Compressing Triangulated Surfaces
• A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs
• Compressing the Property Mapping of Polygon Meshes
• Near-Optimal Connectivity Encoding of 2-Manifold Polygon Meshes
• Linear-Time Compression of Bounded-Genus Graphs into Information-Theoretically Optimal Number of Bits

This page was built for publication: Linear-time compression of 2-manifold polygon meshes into information-theoretically optimal number of bits