A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
Filters
Edgebreaker
2002
Proceedings of the seventh ACM symposium on Solid modeling and applications - SMA '02
Preserved Fulltext
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. ...
We extend this simple formulation to deal with triangulated surfaces with handles and present the detailed pseudocode for the encoding and decoding algorithms (which take one page each). ...
This simple implementation of Edgebreaker, as a state machine, is publicly available through the web [3] and has been recently enhanced to support meshes with an arbitrary number of handles (also called ...
doi:10.1145/566313.566324
fatcat:rskqkznnxvg27m4fbvhdo6bmyq
Edgebreaker
2002
Proceedings of the seventh ACM symposium on Solid modeling and applications - SMA '02
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
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. ...
We extend this simple formulation to deal with triangulated surfaces with handles and present the detailed pseudocode for the encoding and decoding algorithms (which take one page each). ...
This simple implementation of Edgebreaker, as a state machine, is publicly available through the web [3] and has been recently enhanced to support meshes with an arbitrary number of handles (also called ...
doi:10.1145/566282.566324
dblp:conf/sma/LopesTRSS02
fatcat:2myh5rchd5ctbg26nw64rhifu4
Edgebreaker: connectivity compression for triangle meshes
1999
IEEE Transactions on Visualization and Computer Graphics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
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 is a simple scheme for compressing the triangle/vertex incidence graphs (sometimes called connectivity or topology) of three-dimensional triangle meshes. ...
Acknowledgments The author thanks Andrzej Szymczak from Georgia Tech for pointing out that the CL and CE combinations are impossible, Antonio Haro from Georgia Tech for developing an early implementation ...
doi:10.1109/2945.764870
fatcat:b2cm26xxore3jle74mai6xt2fi
Optimized Edgebreaker encoding for large and regular triangle meshes
2003
The Visual Computer
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
It is exceptionally simple to implement and can easily incorporated into any existing Edgebreaker implementation which uses the Spirale Reversi algorithm for decompression. ...
We present a technique designed aiming to improve the compression of the Edgebreaker CLERS string for large and regular meshes, where regularity is understood as the compactness of the distribution of ...
Conclusion We presented a context-based entropy coding procedure optimized to work for the Edgebreaker CLERS sequences for large and regular meshes. ...
doi:10.1007/s00371-003-0208-0
fatcat:auspurt27jeivatjgvrthaeuye
Wrap&Zip decompression of the connectivity of triangle meshes compressed with Edgebreaker
1999
Computational geometry
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
and Wrap&zip techniques for compressing more general, manifold, triangle meshes with holes and handles. ...
The simple and efficient solution provided by the combination of Wrap&Zip with of the work reported in [16, 11] yields a simple and effective solution for compressing the connectivity information of large ...
We say that such a surface has a hole and is thus a two-manifold with boundary, having for boundary a single one-manifold curve. Of course, a surface may have multiple holes. ...
doi:10.1016/s0925-7721(99)00028-0
fatcat:4q5dipan2beazippjhce7ggyje
Edgebreaker on a Corner Table: A Simple Technique for Representing and Compressing Triangulated Surfaces
[chapter]
2003
Mathematics and Visualization
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
We present here a publicly available, simple, state-machine implementation of the Edgebreaker compression, which traverses the corner table, computes the CLERS symbols, and constructs an ordered list of ...
A triangulated surface S with V vertices is sometimes stored as a list of T independent triangles, each described by the 3 floating-point coordinates of its vertices. ...
The Edgebreaker compression scheme, discussed here, has been extended to manifold meshes with handles and holes [Ross99] , to triangulated boundaries of non-manifold solids [RoCa99] , and to meshes that ...
doi:10.1007/978-3-642-55787-3_3
fatcat:p52ord7g65g7bh66ldrlqlcx7i
SPACE-TIME SURFACE SIMPLIFICATION AND EDGEBREAKER COMPRESSION FOR 2D CEL ANIMATIONS
2002
International journal of shape modeling
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
To restore a close approximation of the original animation, the client player decompresses the surface and produces the successive frames by intersecting V with constant-time planes. ...
To reduce transmission costs, we triangulate and simplify the bounding surface and then encode it using the Edgebreaker compression scheme. ...
Acknowledgements We would like to thank Davis King and Andrzej Szymczak for helping with the simplification and compression software. ...
doi:10.1142/s0218654302000091
fatcat:3yylzoy7tzdmdcy7zsfvwvrl2y
3D Compression: from A to Zip a first complete example
2008
Revista de Informática Teórica e Aplicada
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
This expansion has accelerated with the development of efficient schemes dedicated to image compression. ...
This work is part of a tutorial given at the XXth Brazilian Symposium on Computer Graphics and Image Processing (Sibgrapi 2007). ...
We compared with the original Edgebreaker implementation with the Huffman encoding of [21] and the border handling of [37] , and the encoding of [19] with the simple arithmetic coder of [53] . ...
doi:10.22456/2175-2745.6011
fatcat:fl4z7rph7bc3jkf6kaewduncoe
Efficient Edgebreaker for surfaces of arbitrary topology
Proceedings. 17th Brazilian Symposium on Computer Graphics and Image Processing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A surprisingly simple lineartime implementation has been proposed for triangulated surfaces homeomorphic to a sphere and was subsequently extended to surfaces with handles. ...
The result is a simple and efficient compression/decompression solution for the broad class of orientable manifold surfaces. ...
This simple algorithm has been extended to deal with surfaces with handles in [13] . ...
doi:10.1109/sibgra.2004.1352964
dblp:conf/sibgrapi/LewinerLRV04
fatcat:mtqhxyo5cvafnlddj7ifnwl2ny
Optimized Edgebreaker encoding for large and regular triangle meshes
Proceedings DCC 2002. Data Compression Conference
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
It is exceptionally simple to implement and can easily incorporated into any existing Edgebreaker implementation which uses the Spirale Reversi algorithm for decompression. ...
We present a technique designed aiming to improve the compression of the Edgebreaker CLERS string for large and regular meshes, where regularity is understood as the compactness of the distribution of ...
Conclusion We presented a context-based entropy coding procedure optimized to work for the Edgebreaker CLERS sequences for large and regular meshes. ...
doi:10.1109/dcc.2002.1000015
dblp:conf/dcc/Szymczak02
fatcat:lpuxvcslczb5pczpeqrvbmydae
SwingWrapper
2003
ACM Transactions on Graphics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The proposed solution may also be used to encode crude meshes for adaptive transmission or for controlling subdivision surfaces. ...
compression combined with a novel geometry predictor. ...
Thus the total size is about 4T bits for large meshes, while it is guaranteed not to exceed 288+5.83T bits for meshes without handles. We have implemented a prototype to test the described method. ...
doi:10.1145/944020.944022
fatcat:hjwg46bcrbh45mup63faumonda
Dealing with Shape Complexity for Internet Access and Graphic Applications
[article]
2000
Eurographics State of the Art Reports
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
Standard representations of 3D models are so verbose that only very simple models can be accessed over common communication links for immediate viewing. ...
This situation is not likely to improve, since the need for more accurate 3D models and their deployment throughout a broader spectrum of industrial, scientific, and consumer application areas will outpace ...
Later, when we discuss the extension of the Edgebreaker algorithm to meshes with handles, we will learn a practical method for dealing with handles (and of course for detecting if there are any). ...
doi:10.2312/egt.20001032
fatcat:phg2jw3rife4lm2wop6jxzp2re
3D Mesh Compression
[chapter]
2005
Visualization Handbook
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
The storage of triangle meshes compressed with these techniques is usually reduced to about a byte per triangle. ...
In this chapter, we discuss 3D compression techniques for reducing the delays in transmitting triangle meshes over the Internet. ...
In what follows, we assume that our triangle mesh is a connected manifold surface with no boundary and no handle and that it has v vertices, e edges, and t triangles. ...
doi:10.1016/b978-012387582-2/50020-4
fatcat:5eostzi5zndald3vafetkbna6i
Delphi: geometry-based connectivity prediction in triangle mesh compression
2004
The Visual Computer
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
Delphi is a new geometry-guided predictive scheme for compressing the connectivity of triangle meshes. ...
When v coincides with a previously visited vertex that is not adjacent to the parent triangle (EdgeBreaker S case), the offset, which identifies the vertex v, must be encoded, mimicking the Cut-Border ...
A detailed description of the EdgeBreaker compression and decompression and extensions to meshes with handles and holes are discussed in 16, 18, 29 . ...
doi:10.1007/s00371-004-0255-1
fatcat:xeqxmsv375d4hp2pk3qd75qbhi
GEncode: Geometry-Driven Compression in Arbitrary Dimension and Co-Dimension
2005
XVIII Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI'05)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Compression results for surfaces are competitive with existing schemes. ...
It improves existing geometry-driven schemes for general meshes on both geometry and connectivity compression. ...
For surface, the resulting compression ratios are competitive with the Edgebreaker with the parallelogram prediction. Overview. This work is organized as follow. ...
doi:10.1109/sibgrapi.2005.27
dblp:conf/sibgrapi/LewinerCLPVF05
fatcat:qqqhxqbezzhdfhmvdzscrr2uue
« Previous
Showing results 1 — 15 out of 70 results