Wrap&Zip decompression of the connectivity of triangle meshes compressed with Edgebreaker

[1]  Xin He,et al.  Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings , 1999, SIAM J. Discret. Math..

[2]  Jarek Rossignac,et al.  Grow & fold: compression of tetrahedral meshes , 1999, SMA '99.

[3]  Jarek Rossignac,et al.  Matchmaker: manifold BReps for non-manifold r-sets , 1999, SMA '99.

[4]  Jarek Rossignac,et al.  Guaranteed 3.67v bit encoding of planar triangle graphs , 1999, CCCG.

[5]  Wolfgang Straßer,et al.  Real time compression of triangle mesh connectivity , 1998, SIGGRAPH.

[6]  Gabriel Taubin,et al.  Converting sets of polygons to manifold surfaces by cutting and stitching , 1998, Proceedings Visualization '98 (Cat. No.98CB36276).

[7]  Xin He,et al.  Compact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses , 1998, ICALP.

[8]  Gabriel Taubin,et al.  Geometry coding and VRML , 1998, Proc. IEEE.

[9]  Gabriel Taubin,et al.  Geometric compression through topological surgery , 1998, TOGS.

[10]  J. Rossignac Edgebreaker: Compressing the incidence graph of triangle meshes , 1998 .

[11]  Craig Gotsman,et al.  Triangle Mesh Compression , 1998, Graphics Interface.

[12]  Marc J. van Kreveld,et al.  Good orders for incremental (re)construction , 1997, SCG '97.

[13]  Christian Sohler,et al.  Encoding a triangulation as a permutation of its point set , 1997, CCCG.

[14]  Steven Skiena,et al.  Optimizing triangle strips for fast rendering , 1996, Proceedings of Seventh Annual IEEE Visualization '96.

[15]  Michael Deering,et al.  Geometry compression , 1995, SIGGRAPH.

[16]  Jeffery R. Westbrook,et al.  Short Encodings of Planar Graphs and Maps , 1995, Discret. Appl. Math..

[17]  Moni Naor Succinct representation of general unlabeled graphs , 1990, Discret. Appl. Math..

[18]  Mark R. Nelson,et al.  LZW data compression , 1989 .

[19]  Terry A. Welch,et al.  A Technique for High-Performance Data Compression , 1984, Computer.

[20]  Avi Wigderson,et al.  Succinct Representations of Graphs , 1984, Inf. Control..

[21]  David G. Kirkpatrick,et al.  Optimal Search in Planar Subdivisions , 1983, SIAM J. Comput..

[22]  Abraham Lempel,et al.  A universal algorithm for sequential data compression , 1977, IEEE Trans. Inf. Theory.

[23]  D. T. Lee,et al.  Location of a point in a planar subdivision and its applications , 1976, STOC '76.

[24]  W. T. Tutte The Enumerative Theory of Planar Maps , 1973 .