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

DOI10.1016/J.AMC.2011.03.040zbMATH Open1219.68160OpenAlexW2058865158MaRDI QIDQ545998FDOQ545998

Authors: 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

Recommendations

• Near-Optimal Connectivity Encoding of 2-Manifold Polygon Meshes
• Efficient compression of non-manifold polygonal meshes
• scientific article; zbMATH DE number 1803830
• Efficient Coding of Nontriangular Mesh Connectivity
• An edgebreaker-based efficient compression scheme for regular meshes

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)

Cites Work

• Graph theory
• A DNA-based graph encoding scheme with its applications to graph isomorphism problems
• Title not available (Why is that?)
• A Census of Planar Triangulations
• A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs
• Low redundancy in static dictionaries with constant query time
• Short encodings of planar graphs and maps
• The geometry of linear infeasibility
• Wrap \& Zip decompression of the connectivity of triangle meshes compressed with edgebreaker
• Triangle strip compression
• Edgebreaker on a Corner Table: A Simple Technique for Representing and Compressing Triangulated Surfaces
• 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
• Planar separators and parallel polygon triangulation.

Cited In (3)

• Efficient compression of non-manifold polygonal meshes
• Optimal bit allocation in compressed 3D models
• Near-Optimal Connectivity Encoding of 2-Manifold Polygon Meshes

Uses Software

• Edgebreaker

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

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