Piecewise regular meshes: Construction and compression

Graphical Models

Volumn 64, Issue 3-4, 2002, Pages 183-198

  Szymczak, Andrzej ^a   Rossignac, Jarek ^a   King, Davis ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BANDWIDTH; COMPUTATIONAL GEOMETRY; COMPUTER AIDED DESIGN; SURFACES; THREE DIMENSIONAL;

MEAN SQUARE ERROR; PIECEWISE REGULAR MESHES;

GRAPH THEORY;

GRAPHICAL METHOD;

EID: 0036590409     PISSN: 15240703     EISSN: None     Source Type: Journal    
DOI: 10.1006/gmod.2002.0577     Document Type: Article

References (33)

1. P. Alliez and M. Desburn, Valence-driven connectivity encoding for 3D meshes, Comput. Graphics Forum 20, 2001, 480-489.
2. P. Alliez and M. Desburn, Progressive compression for lossless transmission of triangle meshes, in Computer Graphics (Proc. SIGGRAPH 2001), pp. 195-202.
3. M. de Berg, M. van Kreveld, M. Overamrs, and O. Schwartzkopf, Computational Geometry, Algorithms and Applications, Springer-Verlag, Berlin/Heidelberg, 1997.
4. B. Chazelle, D. P. Dobkin, N. Shouraboura, and A. Tal, Strategies for polyhedral surface decomposition: An experimental study, in Symposium on Computational Geometry 1995, pp. 297-305.
5. P. Cignoni, C. Rocchini, and R. Scopigno, Metro: Measuring error on simplified surfaces, Comput. Graphics Forum 17, 1998, 167-174.
6. M. Deering, Geometry compression, in Computer Graphics, Proc. SIGGRAPH 1995, pp. 13-20.
7. M. Garland and P. Heckbert, Surface simplification using quadratic error metric, in Computer Graphics (Proc. SIGGRAPH 1997), pp. 209-216, August 1997.
8. M. Garland, A. Willmott, and P. S. Heckbert, Hierarchical face clustering on polygonal surfaces, in 2001 ACM Symposium on Interactive 3D Graphics, 2001, pp. 49-58.
9. S. Gumhold and W. Strasser, Real time compression of triangle mesh connectivity, in Computer Graphics (Proc. SIGGRAPH), July 1998, pp. 133-140.
10. I. Guskov, K. Vidimce, W. Sweldens, and P. Schroder, Normal meshes, in Proc SIGGRAPH 2000, pp. 95-102.
11. M. Hilaga, Y. Schinagawa, T. Kohmura, and T. L. Kuni, Topology matching for fully automatic similarity estimation of 3D shapes, in Computer Graphics (Proc. SIGGRAPH 2001), pp. 203-212.
12. M. Isenburg and J. Snoeyink, Spirale Reversi: Reverse Decoding of Edgebreaker Encoding, Technical Report TR-99-08, Department of Computer Science, University of British Columbia, September 1999.
13. Z. Karni and C. Gotsman, Spectral Compression of Mesh Geometry, in Computer Graphics (Proc. SIGGRAPH 2000), 2000, pp. 279-286.
14. A. Khodakovsky and I. Guskov, Normal mesh compression, available from www.multires.caltech.edu/pubs/pubs.htm
15. A. Khodakovsky, P. Schroder, and W. Sweldens, Progressive geometry compression, in Proc. SIGGRAPH 2000, 2000, pp. 271-278.
16. F. Lazarus and A. Verroust, Level set diagrams for polyhedral objects, in Proc. Fifth ACM Symposium on Solid Modeling and Applications, June 9-11, 1999, pp. 130-140.
17. A. Lee, W. Sweldens, P. Schrder, L. Cowsar, and D. Dobkin, MAPS: Multiresolution adaptive parameterization of surfaces, in Proceedings of SIGGRAPH 98, pp. 95-104.
18. M. Levoy, K. Pulli, B. Curless, S. Rusinkiewicz, D. Koller, L. Pereira, M. Ginzton, S. Anderson, J. Davis, J. Ginsberg, J. Shade, and D. Fulk, The Digital Michelangelo Project: 3D scanning of large statues, in Computer Graphics (SIGGRAPH 2000 Proceedings).
19. J. S. B. Mitchell, D. M. Mount, and C. H. Papadimitriou, The discrete geodesic problem, SIAM J. Comput. 16, 1987, 647-668.
20. R. Pajarola and J. Rossignac, Compressed progressive meshes, IEEE Trans. Visual. Comput. Graphics 6, 2000, 79-93.
21. R. Pajarola and J. Rossignac, Squeeze: Fast and progressive decompression of triangle meshes, in Computer Graphics International Conference, Switzerland, June 2000, pp. 173-182.
22. M. Pauly and M. Gross, Spectral processing of point-sampled geometry, in Computer Graphics (Proc. SIGGRAPH 2001), pp. 379-386.
23. J. Popovic and H. Hoppe, Progressive simplicial complexes, in Proceedings of SIGGRAPH 97, 1997, pp. 217-224.
24. J. Rossignac, Edgebreaker: Compressing the Connectivity of Triangle Meshes, GVU Technical Report GIT-GVU-98-17, Georgia Institute of Technology, IEEE Transactions on Visualization and Computer Graphics Vol. 5(1), 1999.
25. J. Rossignac and A. Szymczak, Edgebreaker compression and Wrap & Zip decoding of the connectivity of triangle meshes, Comput. Geom. Theory Appl. 14, 1999, 119-135.
26. A. Said and W. A. Pearlman, A new, fast and efficient image codec based on set partitioning in hierarhical trees, IEEE Trans. Circuits Syst. Video Technol. 6, 1996, 243-250.
27. D. Salomon, Data Compression: The Complete Reference, Springer-Verlag, Berlin/Heidelberg, 2000.
28. M. Schindler, A fast renormalization for arithmetic coding, in Proc. IEEE Data Compression Conference, Snowbird UT, 1998, p. 572. www.compressionconsult.com/rangecoder
29. J. Shapiro, Embedded image coding using zero-trees of wavelet coefficients, IEEE Trans. Signal Process. 41, 1993, 3445-3462.
30. A. Szymczak, D. King, and J. Rossignac, An Edgebreaker-based efficient compression scheme for regular meshes, Computational Geometry, 20, 2001, 53-68.
31. G. Taubin and J. Rossignac, Geometric compression through topological surgery, ACM Trans. Graphics 17, 1998, 84-115.
32. C. Touma and C. Gotsman, Triangle mesh compression, in Proceedings Graphics Interface 1998, pp. 26-34.
33. G. Turk, Re-tiling polygonal surfaces, Comput. Graphics 26, 1992 (SIGGRAPH 92 Conference Proceedings), 55-64.