Results 1  10
of
30
Edgebreaker: Compressing the incidence graph of triangle meshes
 IEEE Transactions on Visualization and Computer Graphics
, 1999
"... Edgebreaker is a simple scheme for compressing the triangle/vertex incidence graphs (sometimes called topology) of threedimensional triangle meshes. Edgebreaker improves upon the worst case and the expected compression ratios of previously reported schemes, most of which require O(nlogn) bits to sto ..."
Abstract

Cited by 11 (7 self)
 Add to MetaCart
Edgebreaker is a simple scheme for compressing the triangle/vertex incidence graphs (sometimes called topology) of threedimensional triangle meshes. Edgebreaker improves upon the worst case and the expected compression ratios of previously reported schemes, most of which require O(nlogn) bits
Surface Simplification and Edgebreaker Compression for 2D Cell Animations
"... Figure 1. (see color plate) The consecutive frames of the animation of a uniform (black) region (topleft) are treated as a set of voxels from which a trianglemesh isosurface is extracted (top center), simplified (top right), and compressed. After downloading and decompressing the isosurface, the ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
that it sweeps out. To reduce transmission costs, we triangulate and simplify the bounding surface and then encode it using the Edgebreaker compression scheme. To restore a close approximation of the original animation, the client player decompresses the surface and produces the successive frames by intersecting
Edgebreaker: Connectivity compression for triangle meshes
 IEEE Transactions on Visualization and Computer Graphics
, 1999
"... Edgebreaker is a simple scheme for compressing the triangle/vertex incidence graphs (sometimes called connectivity or topology) of threedimensional triangle meshes. Edgebreaker improves upon the worst case storage required by previously reported schemes, most of which require O(nlogn) bits to store ..."
Abstract

Cited by 298 (24 self)
 Add to MetaCart
Edgebreaker is a simple scheme for compressing the triangle/vertex incidence graphs (sometimes called connectivity or topology) of threedimensional triangle meshes. Edgebreaker improves upon the worst case storage required by previously reported schemes, most of which require O(nlogn) bits
International Journal of Shape Modeling c ○ World Scientific Publishing Company SPACETIME SURFACE SIMPLIFICATION AND EDGEBREAKER COMPRESSION FOR 2D CEL ANIMATIONS
"... Digitized cel animations are typically composed of frames containing a small number of regions; each region contains pixels of the same color and exhibits a significant level of shape coherence through time. To exploit this coherence, we treat the stack of frames as a 3D volume and represent the evo ..."
Abstract
 Add to MetaCart
the evolution of each region by the bounding surface of the 3D subvolume V that it sweeps out. To reduce transmission costs, we triangulate and simplify the bounding surface and then encode it using the Edgebreaker compression scheme. To restore a close approximation of the original animation, the client
Rossignac&Szymczak Computational Geometry: Theory and Applications (5/2/99 11:42 AM) page 1 Edgebreaker compression and Wrap&Zip decoding of the connectivity of triangle meshes
"... The Edgebreaker compression, introduced by Rossignac in [13], encodes any unlabeled triangulated planar graph of t triangles using a CLERS string of 2t bits, which represents a sequence of t symbols from the set {C,L,E,R,S}. Exploiting constraints between consecutive symbols, the CLERS string may in ..."
Abstract
 Add to MetaCart
The Edgebreaker compression, introduced by Rossignac in [13], encodes any unlabeled triangulated planar graph of t triangles using a CLERS string of 2t bits, which represents a sequence of t symbols from the set {C,L,E,R,S}. Exploiting constraints between consecutive symbols, the CLERS string may
Wrap&Zip decompression of the connectivity of triangle meshes compressed with Edgebreaker
 Journal of Computational Geometry, Theory and Applications
, 1999
"... The Edgebreaker compression (Rossignac, 1999; King and Rossignac, 1999) is guaranteed to encode any unlabeled triangulated planar graph of t triangles with at most 1.84t bits. It stores the graph as a CLERS string a sequence of t symbols from the set {C, L,E,R,S}, each represented by a 1, 2 or ..."
Abstract

Cited by 43 (14 self)
 Add to MetaCart
The Edgebreaker compression (Rossignac, 1999; King and Rossignac, 1999) is guaranteed to encode any unlabeled triangulated planar graph of t triangles with at most 1.84t bits. It stores the graph as a CLERS string a sequence of t symbols from the set {C, L,E,R,S}, each represented by a 1, 2
An EdgebreakerBased Efficient Compression Scheme for Regular Meshes
, 2000
"... One of the most natural measures of regularity of a triangular mesh homeomorphic to the twodimensional sphere is the fraction of its vertices having degree 6. We construct a lineartime connectivity compression scheme build upon Edgebreaker which explicitly takes advantage of regularity and prove r ..."
Abstract

Cited by 42 (12 self)
 Add to MetaCart
One of the most natural measures of regularity of a triangular mesh homeomorphic to the twodimensional sphere is the fraction of its vertices having degree 6. We construct a lineartime connectivity compression scheme build upon Edgebreaker which explicitly takes advantage of regularity and prove
Edgebreaker: A Simple Compression for Surfaces with Handles
 In Proceedings of the seventh ACM symposium on Solid modeling and applications
, 2002
"... The Edgebreaker is an efficient scheme for compressing triangulated surfaces. A surprisingly simple implementation of Edgebreaker has been proposed for surfaces homeomorphic to a sphere. It uses the CornerTable data structure, which represents the connectivity of a triangulated surface by two table ..."
Abstract

Cited by 17 (8 self)
 Add to MetaCart
The Edgebreaker is an efficient scheme for compressing triangulated surfaces. A surprisingly simple implementation of Edgebreaker has been proposed for surfaces homeomorphic to a sphere. It uses the CornerTable data structure, which represents the connectivity of a triangulated surface by two
Efficient edgebreaker for surfaces of arbitrary topology
 In Sibgrapi
, 2004
"... Abstract. The typical surfaces models handled by contemporary Computer Graphics applications have millions of triangles and numerous connected component, handles and boundaries. Edgebreaker and Spirale Reversi are examples of efficient schemes to compress and decompress their connectivity. A surpris ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
Abstract. The typical surfaces models handled by contemporary Computer Graphics applications have millions of triangles and numerous connected component, handles and boundaries. Edgebreaker and Spirale Reversi are examples of efficient schemes to compress and decompress their connectivity. A
Efficient Edgebreaker for surfaces of arbitrary topology
, 2004
"... The typical surfaces models handled by contemporary Computer Graphics applications have millions of triangles and numerous connected component, handles and boundaries. Edgebreaker and Spirale Reversi are examples of efficient schemes to compress and decompress their connectivity. A surprisingly si ..."
Abstract
 Add to MetaCart
The typical surfaces models handled by contemporary Computer Graphics applications have millions of triangles and numerous connected component, handles and boundaries. Edgebreaker and Spirale Reversi are examples of efficient schemes to compress and decompress their connectivity. A surprisingly
Results 1  10
of
30