Skip to main content
Log in

Connectivity compression in an arbitrary dimension

  • original article
  • Published:
The Visual Computer Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Alliez, P., Gotsman, C.: Recent advances in compression of 3D meshes. In: Proceedings of the Symposium on Multi-resolution in Geometric Modeling, Cambridge, UK, 2003

  2. Brisson, E.: Representing geometric structures in d dimensions: topology and order. In: Proceedings of the 5th Annual Aymposium on Computational Geometry, pp. 218–227. ACM Press, Saarbrücken, Germany (1989)

  3. Gumhold, S., Guthe, S., Strasser, W.: Tetrahedral mesh compression with the cut-border machine. In: Proceedings of the Conference on Visualization ’99, pp. 51–58. IEEE Computer Society, San Francisco, CA (1999)

  4. Isenburg, M.: Compressing polygon mesh connectivity with degree duality prediction. In: Graphics Interface ’02 Conference Proceedings, Calgary, Alberta, 2002, pp. 161–170

  5. Isenburg, M., Alliez, P.: Compressing polygon mesh geometry with parallelogram prediction. In: Proceedings of the Conference on Visualization ’02, pp. 141–146. IEEE Computer Society, Boston, MA (2002)

  6. Isenburg, M., Alliez, P.: Compressing hexahedral volume meshes. In: Graphical Models, vol. 65, pp. 239–257. Academic, New York (2003)

  7. Lienhardt, P.: N-dimensional generalized combinatorial maps and cellular quasi-manifolds. Int. J. Comput. Geom. Appl. 4(3), 275–324 (1994)

    Google Scholar 

  8. Szymczak, A., Rossignac, J.: Grow and fold: compression of tetrahedral meshes. In: Proceedings of the 5th ACM Symposium on Solid Modeling and Applications, Ann Arbor, MI, June 1999, pp. 54–64

  9. Welch, T.: A technique for high-performance data compression. IEEE Comput. 17, 8–19 (1984)

    Google Scholar 

  10. Yang, C.K., Mitra, T., Chiueh, T.C.: On-the-fly rendering of losslessly compressed irregular volume data. In: IEEE Visualization 2000, Salt Lake City, UT, 813 October 2000, pp. 101–108

  11. Zhang, Y., Bajaj, C.: Finite element meshing for cardiac analysis. ICES Tech. Rep. 04-26, University of Texas (2004)

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Prat, S., Gioia, P., Bertrand, Y. et al. Connectivity compression in an arbitrary dimension. Visual Comput 21, 876–885 (2005). https://doi.org/10.1007/s00371-005-0325-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00371-005-0325-z

Keywords

Navigation