Edgebreaker: Connectivity compression for triangle meshes

DMCA

Edgebreaker: Connectivity compression for triangle meshes (1999)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Jarek Rossignac

Venue:	IEEE Transactions on Visualization and Computer Graphics
Citations:	297 - 24 self

BibTeX

@ARTICLE{Rossignac99edgebreaker:connectivity,
    author = {Jarek Rossignac},
    title = {Edgebreaker: Connectivity compression for triangle meshes},
    journal = {IEEE Transactions on Visualization and Computer Graphics},
    year = {1999}
}

OpenURL

Abstract

Edgebreaker is a simple scheme for compressing the triangle/vertex incidence graphs (sometimes called connectivity or topology) of three-dimensional triangle meshes. Edgebreaker improves upon the worst case storage required by previously reported schemes, most of which require O(nlogn) bits to store the incidence graph of a mesh of n triangles. Edgebreaker requires only 2n bits or less for simple meshes and can also support fully general meshes by using additional storage per handle and hole. Edgebreaker’s compression and decompression processes perform the same traversal of the mesh from one triangle to an adjacent one. At each stage, compression produces an op-code describing the topological relation between the current triangle and the boundary of the remaining part of the mesh. Decompression uses these op-codes to reconstruct the entire incidence graph. Because Edgebreaker’s compression and decompression are independent of the vertex locations, they may be combined with a variety of vertex-compressing techniques that exploit topological information about the mesh to better estimate vertex locations. Edgebreaker may be used to compress the connectivity of an entire mesh bounding a 3D polyhedron or the connectivity of a triangulated surface patch whose boundary needs not be encoded. Its superior compression capabilities, the simplicity of its implementation, and its versatility make Edgebreaker particularly suitable for the emerging 3D data exchange standards for interactive graphic applications. The paper also offers a comparative survey of the rapidly growing field of geometric compression.

Keyphrases

connectivity compression triangle mesh simple scheme case storage triangle vertex incidence graph entire mesh incidence graph topological relation edgebreaker compression current triangle estimate vertex location geometric compression interactive graphic application triangulated surface patch decompression process additional storage vertex location general mesh simple mesh three-dimensional triangle mesh adjacent one superior compression capability entire incidence graph vertex-compressing technique comparative survey topological information data exchange standard

DMCA