Connectivity compression in an arbitrary dimension
Sylvain Prat, Patrick Gioia, Yves Bertrand, Daniel Meneveaux
In The Visual Computer, 21(8-10), 2005.
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.
Keyword(s): compression, connectivity, topological structure, generalized maps
BibTeX format:
@article{Prat:2005:CCI,
  author = {Sylvain Prat and Patrick Gioia and Yves Bertrand and Daniel Meneveaux},
  title = {Connectivity compression in an arbitrary dimension},
  journal = {The Visual Computer},
  volume = {21},
  number = {8-10},
  pages = {876--885},
  year = {2005},
}
Search for more articles by Sylvain Prat.
Search for more articles by Patrick Gioia.
Search for more articles by Yves Bertrand.
Search for more articles by Daniel Meneveaux.

Return to the search page.


graphbib: Powered by "bibsql" and "SQLite3."