Connectivity Compression in Arbitrary Dimension - Archive ouverte HAL Access content directly
Journal Articles The Visual Computer Year : 2005

Connectivity Compression in Arbitrary Dimension

Abstract

This paper presents a general lossless connectivity compression scheme for manifolds in any dimension with arbitrary cells, orientable or not, with or without borders. Relying on a generic topological model called generalized maps, our method performs a region growing traversal of its primitive elements while describing connectivity relations with symbols. The set of produced symbols is compressed using standard data compression techniques. These algorithms have been successfully applied to various models (surface, tetrahedral and hexahedral meshes), showing the efficiency and genericity of the proposed scheme.

Dates and versions

hal-00332888 , version 1 (22-10-2008)

Identifiers

Cite

Sylvain Prat, Patrick Gioia, Yves Bertrand, Daniel Meneveaux. Connectivity Compression in Arbitrary Dimension. The Visual Computer, 2005, 21 (8), pp.876-885. ⟨10.1007/s00371-005-0325-z⟩. ⟨hal-00332888⟩

Collections

CNRS UNIV-POITIERS
91 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More