The Visual Computer

, Volume 26, Issue 6–8, pp 1113–1122 | Cite as

Streaming compression of hexahedral meshes

  • Clement Courbet
  • Martin Isenburg
Original Article


We describe a method for streaming compression of hexahedral meshes. Given an interleaved stream of vertices and hexahedra our coder incrementally compresses the mesh in the presented order. Our coder is extremely memory efficient when the input stream also documents when vertices are referenced for the last time (i.e. when it contains topological finalization tags). Our coder then continuously releases and reuses data structures that no longer contribute to compressing the remainder of the stream. This means in practice that our coder has only a small fraction of the whole mesh in memory at any time. We can therefore compress very large meshes—even meshes that do not fit in memory.

Compared to traditional, non-streaming approaches that load the entire mesh and globally reorder it during compression, our algorithm trades a less compact compressed representation for significant gains in speed, memory, and I/O efficiency. For example, on the 456k hexahedra “blade” mesh, our coder is twice as fast and uses 88 times less memory (only 3.1 MB) with the compressed file increasing about 3% in size. We also present the first scheme for predictive compression of properties associated with hexahedral cells.


Large meshes Streaming compression Hexahedral meshes Cell data compression 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Benzley, Perry, Merkley, Clark, Sjaardema: A comparison of all-hexahedral and all-tetrahedral finite element meshes for elastic and elasto-plastic analysis. In: Meshing Roundtable (1995) Google Scholar
  2. 2.
    Blacker: The cooper tool. In: Meshing Roundtable (1996) Google Scholar
  3. 3.
    Guthe, Gumhold, Strasser: Tetrahedral mesh compression with the cut-border machine. In: Visualization (1999) Google Scholar
  4. 4.
    Ho, Lee, Kriegman: Compressing large polygonal models. In: Visualization (2001) Google Scholar
  5. 5.
    Ibarria, Lindstrom, Rossignac: Spectral interpolation on 3×3 stencils for prediction and compression. J. Comput. 2(8), 53–63 (2007) Google Scholar
  6. 6.
    Isenburg: Compressing polygon mesh connectivity with degree duality prediction. In: Graphics Interface (2002) Google Scholar
  7. 7.
    Isenburg, Alliez: Compressing hexahedral volume meshes. In: Graphical Models (2002) Google Scholar
  8. 8.
    Isenburg, Gumhold: Out-of-core compression for gigantic polygon meshes. In: SIGGRAPH (2003) Google Scholar
  9. 9.
    Isenburg, Lindstrom: Streaming meshes. In: Visualization (2005) Google Scholar
  10. 10.
    Isenburg, Ivrissimtzis, Gumhold, Seidel: Geometry prediction for high degree polygons. In: Spring Conference on Computer Graphics (2005) Google Scholar
  11. 11.
    Isenburg, Lindstrom, Snoeyink: Lossless compression of predicted floating-point geometry. Computer-Aided Design (2005) Google Scholar
  12. 12.
    Isenburg, Lindstrom, Snoeyink: Streaming compression of tetrahedral volume meshes. In: Eurographics Symposium on Geometry Processing (2005) Google Scholar
  13. 13.
    Isenburg, Lindstrom, Gumhold, Shewchuk: Streaming compression of tetrahedral volume meshes. In: Graphics Interface (2006) Google Scholar
  14. 14.
    Krivograd, Trlep, Zalik: A hexahedral mesh connectivity compression with vertex degrees. Comput. Aided Des. 40(12), 1105–1112 (2008) CrossRefGoogle Scholar
  15. 15.
    Lindstrom, Isenburg: Lossless compression of hexahedral meshes. In: IEEE Data Compression Conference (2008) Google Scholar
  16. 16.
    Muller-Hannemann: Shelling hexahedral complexes for mesh generation. J. Graph Algorithms Appl. 5(5), 59–91 (2001) MathSciNetGoogle Scholar
  17. 17.
    Prat, Gioia, Bertrand, Meneveaux: Connectivity compression in an arbitrary dimension. Vis. Comput. 21(8), 876–885 (2005) CrossRefGoogle Scholar
  18. 18.
    Staten, Owen, Blacker: Unconstrained paving and plastering: A new idea for all hexahedral mesh generation. In: International Meshing Roundtable (2005) Google Scholar
  19. 19.
    Touma, Gotsman: Triangle mesh compression. In: Graphics Interface (1998) Google Scholar

Copyright information

© Springer-Verlag 2010

Authors and Affiliations

  1. 1.Ecole Centrale ParisParisFrance
  2. 2.Lawrence Livermore National LaboratoryLawrenceUSA

Personalised recommendations