Streaming Compression of Hexahedral Meshes
We describe a method for streaming compression of hexahedral meshes. Given an interleaved stream of vertices and hexahedral our coder incrementally compresses the mesh in the presented order. Our coder is extremely memory efficient when the input stream 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 file 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.
- Research Organization:
- Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- W-7405-ENG-48
- OSTI ID:
- 986614
- Report Number(s):
- LLNL-CONF-423218; TRN: US201017%%423
- Resource Relation:
- Conference: Presented at: Computer Graphics International, Singapore, Singapore, Jun 09 - Jun 11, 2010
- Country of Publication:
- United States
- Language:
- English
Similar Records
Grouper: A Compact, Streamable Triangle Mesh Data Structure
A characterization of the quadrilateral meshes of a surface which admit a compatible hexahedral mesh of the enclosed volume