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. |
Year | DOI | Venue |
---|---|---|
2005 | 10.1007/s00371-005-0325-z | The Visual Computer |
Keywords | Field | DocType |
compression · con- nectivity · topological structure · generalized maps,region growing,data compression | Hexahedron,Topology,Texture compression,Tree traversal,Polygon mesh,Computer science,Data compression,Tetrahedron,Manifold,Lossless compression | Journal |
Volume | Issue | ISSN |
21 | 8-10 | 1432-2315 |
Citations | PageRank | References |
8 | 0.54 | 10 |
Authors | ||
4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Sylvain Prat | 1 | 8 | 0.54 |
Patrick Gioia | 2 | 74 | 7.26 |
Yves Bertrand | 3 | 8 | 0.87 |
daniel meneveaux | 4 | 141 | 13.08 |