Efficient compression of non-manifold polygonal meshes

DOI10.1016/S0925-7721(99)00027-9zbMATH Open0953.68617WikidataQ60140722 ScholiaQ60140722MaRDI QIDQ1968989FDOQ1968989

Authors: André Guéziec, Frank Bossen, Gabriel Taubin, Claudio T. Silva 

Publication date: 16 March 2000

Published in: Computational Geometry (Search for Journal in Brave)

Recommendations

• Efficient Coding of Nontriangular Mesh Connectivity
• Near-Optimal Connectivity Encoding of 2-Manifold Polygon Meshes
• Linear-time compression of 2-manifold polygon meshes into information-theoretically optimal number of bits
• Single resolution compression of arbitrary triangular meshes with properties
• Edgebreaker on a Corner Table: A Simple Technique for Representing and Compressing Triangulated Surfaces

zbMATH Keywords

geometry compressionnon-manifold polygonal meshes

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited In (6)

• Linear-time compression of 2-manifold polygon meshes into information-theoretically optimal number of bits
• Title not available (Why is that?)
• Single resolution compression of arbitrary triangular meshes with properties
• Context-Based Entropy Encoding Method for Connectivity Compression of Meshes
• Mathematics of Surfaces
• Compressing the Property Mapping of Polygon Meshes

Uses Software

• Edgebreaker

This page was built for publication: Efficient compression of non-manifold polygonal meshes

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