Compact 3D Representations

[1]  K. Sahr,et al.  Discrete Global Grid Systems , 1998 .

[2]  Craig Gotsman,et al.  Optimized compression of triangle mesh geometry using prediction trees , 2002, Proceedings. First International Symposium on 3D Data Processing Visualization and Transmission.

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

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

[5]  Jarek Rossignac,et al.  3D compression made simple: Edgebreaker with ZipandWrap on a corner-table , 2001, Proceedings International Conference on Shape Modeling and Applications.

[6]  Ian H. Witten,et al.  Arithmetic coding for data compression , 1987, CACM.

[7]  Alireza Entezari,et al.  A Granular Three Dimensional Multiresolution Transform , 2006, EuroVis.

[8]  Renato Pajarola,et al.  Compressed Progressive Meshes , 2000, IEEE Trans. Vis. Comput. Graph..

[9]  Seungyong Lee,et al.  Multiresolution Random Accessible Mesh Compression , 2006, Comput. Graph. Forum.

[10]  Pierre Alliez,et al.  Recent advances in compression of 3D meshes , 2005, 2005 13th European Signal Processing Conference.

[11]  Peter Lindstrom,et al.  LR: compact connectivity representation for triangle meshes , 2011, SIGGRAPH 2011.

[12]  D. Cohen-Or,et al.  Multi-way Geometry Encoding , 2002 .

[13]  Pierre Alliez,et al.  Valence‐Driven Connectivity Encoding for 3D Meshes , 2001, Comput. Graph. Forum.

[14]  James E. Gain,et al.  Distance‐Ranked Connectivity Compression of Triangle Meshes , 2007, Comput. Graph. Forum.

[15]  Bernd Hamann,et al.  Wavelet-based multiresolution with n-th-root-of-2 Subdivision , 2004 .

[16]  Jarek Rossignac,et al.  Edgebreaker: Connectivity Compression for Triangle Meshes , 1999, IEEE Trans. Vis. Comput. Graph..

[17]  Bruce G. Baumgart.  A polyhedron representation for computer vision , 1975, AFIPS '75.

[18]  Lee Westover,et al.  Footprint evaluation for volume rendering , 1990, SIGGRAPH.

[19]  A. James Stewart,et al.  Triangulation of hierarchical hexagon meshes , 2008, SPM '08.

[20]  Henry Fuchs,et al.  On visible surface generation by a priori tree structures , 1980, SIGGRAPH '80.

[21]  Donald Meagher,et al.  Geometric modeling using octree encoding , 1982, Comput. Graph. Image Process..

[22]  Mike M. Chow.  Optimized geometry compression for real-time rendering , 1997 .

[23]  Hans-Peter Seidel,et al.  Geometry prediction for high degree polygons , 2005, SCCG '05.

[24]  Glen G. Langdon,et al.  Arithmetic Coding , 1979 .

[25]  T. Hales.  The Kepler conjecture , 1998, math/9811078.

[26]  Olivier Devillers,et al.  Progressive lossless compression of arbitrary simplicial complexes , 2002, SIGGRAPH.

[27]  Martin Isenburg,et al.  Streaming compression of tetrahedral volume meshes , 2006, Graphics Interface.

[28]  Gabriel Taubin,et al.  Progressive forest split compression , 1998, SIGGRAPH.

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

[30]  Céline Hudelot,et al.  Taylor Prediction for Mesh Geometry Compression , 2011, Comput. Graph. Forum.

[31]  Valerio Pascucci,et al.  Single Resolution Compression of Arbitrary Triangular Meshes with Properties , 1999, Data Compression Conference.

[32]  Luiz Velho,et al.  CHF: A Scalable Topological Data Structure for Tetrahedral Meshes , 2005, XVIII Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI'05).

[33]  C.-C. Jay Kuo,et al.  Technologies for 3D mesh compression: A survey , 2005, J. Vis. Commun. Image Represent..

[34]  John Hart,et al.  ACM Transactions on Graphics: Editorial , 2003, SIGGRAPH 2003.

[35]  Dieter Schmalstieg,et al.  Smooth levels of detail , 1997, Proceedings of IEEE 1997 Annual International Symposium on Virtual Reality.

[36]  Raphaëlle Chaine,et al.  Reconstruction Algorithms as a Suitable Basis for Mesh Connectivity Compression , 2009, IEEE Trans Autom. Sci. Eng..

[37]  Thierry Blu,et al.  On the multidimensional extension of the quincunx subsampling matrix , 2005, IEEE Signal Processing Letters.

[38]  D. Huffman.  A Method for the Construction of Minimum-Redundancy Codes , 1952 .

[39]  K. Sahr,et al.  Geodesic Discrete Global Grid Systems , 2003 .

[40]  Martin Isenburg,et al.  Streaming compression of triangle meshes , 2005, SIGGRAPH '05.

[41]  Pierre Alliez,et al.  Angle‐Analyzer: A Triangle‐Quad Mesh Codec , 2002, Comput. Graph. Forum.

[42]  Sudhir P. Mudur,et al.  Compression of Large 3D Engineering Models using Automatic Discovery of Repeating Geometric Features , 2001, VMV.

[43]  Peter Lindstrom,et al.  Random-Accessible Compressed Triangle Meshes , 2007, IEEE Transactions on Visualization and Computer Graphics.

[44]  Wolfgang Straßer,et al.  Tetrahedral mesh compression with the cut-border machine , 1999, Proceedings Visualization '99 (Cat. No.99CB37067).

[45]  Jaroslaw R. Rossignac,et al.  3D Mesh Compression , 2005, The Visualization Handbook.

[46]  Urs Bischoff,et al.  TetStreamer: compressed back-to-front transmission of Delaunay tetrahedra meshes , 2005, Data Compression Conference.

[47]  Jon Louis Bentley,et al.  Quad trees a data structure for retrieval on composite keys , 1974, Acta Informatica.

[48]  W. T. Tutte,et al.  A Census of Planar Triangulations , 1962, Canadian Journal of Mathematics.

[49]  Seungyong Lee,et al.  Transitive Mesh Space of a Progressive Mesh , 2003, IEEE Trans. Vis. Comput. Graph..

[50]  Tony DeRose,et al.  Mesh optimization , 1993, SIGGRAPH.

[51]  Jarek Rossignac,et al.  SQuad: Compact Representation for Triangle Meshes , 2011, Comput. Graph. Forum.

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

[53]  Hugues Hoppe,et al.  Progressive meshes , 1996, SIGGRAPH.

[54]  Martin Isenburg,et al.  Streaming meshes , 2005, VIS 05. IEEE Visualization, 2005..

[55]  Günther Greiner,et al.  Hierarchical tetrahedral-octahedral subdivision for volume visualization , 2000, The Visual Computer.

[56]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.

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

[58]  Pierre Alliez,et al.  Progressive compression for lossless transmission of triangle meshes , 2001, SIGGRAPH.

[59]  A. James Stewart,et al.  Multiresolution sphere packing tree: a hierarchical multiresolution 3D data structure , 2008, SPM '08.

[60]  Chris L. Jackins,et al.  Oct-trees and their use in representing three-dimensional objects , 1980 .

[61]  C.-C. Jay Kuo,et al.  Geometry-guided progressive lossless 3D mesh coding with octree (OT) decomposition , 2005, SIGGRAPH 2005.

[62]  Konrad Polthier,et al.  FreeLence ‐ Coding with Free Valences , 2005, Comput. Graph. Forum.

[63]  Martin Isenburg,et al.  Compressing polygon mesh geometry with parallelogram prediction , 2002, IEEE Visualization, 2002. VIS 2002..

[64]  Luiz Velho,et al.  GEncode: Geometry‐driven compression for General Meshes , 2006, Comput. Graph. Forum.

[65]  William E. Lorensen,et al.  Marching cubes: A high resolution 3D surface construction algorithm , 1987, SIGGRAPH.