Series
GVU Technical Report Series

Permanent Link
https://hdl.handle.net/1853/71001
Series Type
Publication Series
Description
Associated Organization(s)
Associated Organization(s)
Organizational Unit

Filters

1999 2
2
2
2
2
2
Reset filters

Settings
Author: King, Davis × Author: Rossignac, Jarek × Author: Szymczak, Andrzej × Type: Text ×

Publication Search Results

Now showing 1 - 2 of 2
Thumbnail Image
Item

Connectivity Compression for Irregular Quadrilateral Meshes

1999 , King, Davis , Szymczak, Andrzej , Rossignac, Jarek

Many 3D models used in engineering, scientific, and visualization applications are represented by an irregular mesh of bounding quadrilaterals. We propose a scheme for compressing the connectivity of irregular quadrilateral meshes in 0.26-1.7 bits/quad, a 25-45% savings over randomly splitting quads into triangles and applying triangle mesh compression. Our approach is an extension of the Edgebreaker compression approach and of the Wrap&Zip decompression technique.

View
Thumbnail Image
Item

Connectivity Compression for Irregular Quadrilateral Meshes

1999 , King, Davis , Rossignac, Jarek , Szymczak, Andrzej

Applications that require Internet access to remote 3D datasets are often limited by the storage costs of 3D models. Several compression methods are available to address these limits for objects represented by triangle meshes. Many CAD and VRML models, however, are represented as quadrilateral meshes or mixed triangle/quadrilateral meshes, and these models may also require compression. We present an algorithm for encoding the connectivity of such quadrilateral meshes, and we demonstrate that by preserving and exploiting the original quad structure, our approach achieves encodings 30 - 80% smaller than an approach based on randomly splitting quads into triangles. We present both a code with a proven worst-case cost of 3 bits per vertex (or 2.75 bits per vertex for meshes without valence-two vertices) and entropy-coding results for typical meshes ranging from 0.3 to 0.9 bits per vertex, depending on the regularity of the mesh. Our method may be implemented by a rule for a particular splitting of quads into triangles and by using the compression and decompression algorithms introduced in [Rossignac99] and [Rossignac&Szymczak99]. We also present extensions to the algorithm to compress meshes with holes and handles and meshes containing triangles and other polygons as well as quads.

View