Edgebreaker: Connectivity compression for triangle meshes

IEEE Transactions on Visualization and Computer Graphics

Volumn 5, Issue 1, 1999, Pages 47-61

  Rossignac, Jarek ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA STORAGE EQUIPMENT; GRAPH THEORY; IMAGE COMPRESSION; IMAGE RECONSTRUCTION; MATHEMATICAL MODELS; THREE DIMENSIONAL COMPUTER GRAPHICS;

EDGEBREAKERS;

COMPUTATIONAL GEOMETRY;

EID: 0032674171     PISSN: 10772626     EISSN: None     Source Type: Journal    
DOI: 10.1109/2945.764870     Document Type: Article

References (41)

1. A.V. Aho, J.E. Hopcroft, and J.D. Ullman, The Design and Analysis of Computer Algorithms. Reading, Mass.: Addison-Wesley, 1974.
2. R. Bar-Yehuda and C. Gotsman, "Time / SpaceTrade ffs for Polygon Mesh Rendering," ACM Trans. Graphics, vol. 15, no. 2, pp. 141-152, Apr. 1996.
3. R. Carey, G. Bell, and C. Martin, "The Virtual Reality Modeling Language ISO/IEC DIS 14772-1," Apr. 1997, http://www.vrml.org/ Specifications.VRML97/DIS.
4. M. Chow, "Optimized Geometry Compression for Real-time Rendering," Proc. IEEE Visualization '97, pp. 347-354, Phoenix, Ariz., Oct. 1997.
5. L. Darsa, B. Costa Suva, and A. Varshney, "Navigating Siatic Environments Using Image-Space Simplification and Morphing," Proc. 1995 Symp. Interactive 3D Graphics, pp. 7-16, Apr. 1997.
6. M. Deering, "Geometry Compression, Computer Graphits," Proc. SIGGRAPH '95, pp. 13-20, Aug. 1995.
7. M. Denny and C. Sohler, "Encoding a Triangulation as a Permutation of Its Point Set," Proc. Ninth Canadian CoJ. Computational Geometry, pp. 39-43, Ontario, Aug. 1997.
8. D. Dobkin and D. Kirkpatrick, "A Linear Algorithm fcr Determining the Separation of Convex Polyhedra," J. Algorithms, vol. 6, pp. 381-392, 1985.
9. F. Evans, S. Skiena, and A. Varshney, "Optimizing Triangle Strips for Fast Rendering," Proc. IEEE Vizualization '96, pp. 319-326, 1996.
10. S. Cumhold and W. Strasser, "Real Time Compression of Triangle Mesh Connectivity," Proc. ACM SIGGRAPH '98, pp. 133-140, July 1998.
11. [II] P. Heckbert and M. Garland, "Survey of Polygonal Surfice Simplification Algorithms," Multiresolution Surface Modeling Course, ACM SIGGRAPH course notes, 1997.
12. H. Hoppe, T. DeRose, T. Duchamp, J. McDonald, and W. Sfuetzle, "Mesh Optimization" Proc. SIGGRAPH'93, pp. 19-26, Aug. 1993.
13. H. Hoppe, "Progressive Meshes," Proc. ACM SIGGRAPH '96, pp. 99-108, Aug. 1996.
14. H. Hoppe, "View Dependent Refinement of Progressive Meshes," Proc. ACM SIGGRAPH'97, Aug. 1997.
15. A. Itai and M. Rodeh, "Representation of Graphs," Ada Informatica, no. 17, pp. 215-219.1982.
16. K. Keeler and J. Westbrook, "Short Encodings of Planar Graphs and Maps," Discrete Applied Math., no. 58, pp. 239-252,1995.
17. D. Kirkpatrick, "Optimal Search in Planar Subdivisions," SIAM }. Computing, vol. 12, pp. 28-35,1983.
18. D.T. Lee and RP. Preparata, "Location of a Point in a Planar Subdivision and Its Applications," SIAM J. Computing, vol. 6, pp. 594606,1977.
19. J. Li and C.C Kuo, "Progressive Coding of 3D Graphic Models," Proc. IEEE, pp. 1,052-1,063, June 1998.
20. Y. Mann and D. Cohen-Or, "Selective Pixel Transmission for Navigation in Remote Environments," Proc. Eurographics'97, Budapest, Hungary, Sept. 1997.
21. W. Mark, L. McMillan and G. Bishop, "Post-Rendering 3D Warping," Proc. 1995 Symp. Interactive 3D Graphics, pp. 7-16, Apr. 1997.
22. W. Massey, Algebraic Topology: An Introduction. Harcourt, Brace & World Inc., 1967.
23. epresentation of General Unlabeled Graphs," Discrete Applied Math., vol. 29, pp. 303-307,1990.
24. J. Neider, T. Davis, and M. Woo, OpenGL Programming Guide. Addison-Wesley, 1993.
25. M.R. Nelson, "LZW Data Compression," Dr. Dobb's J., Oct. 1989.
26. A. Rockwood, K. Heaton, and T. Davis, "Real-Time Rendering of Trimmed Surfaces," Computer Graphics, vol. 23, no. 3, pp. 107-116, 1989.
27. R. Ronfard. and J. Rossignac, "Full-Range Approximation of Triangulated Polyhedra," Proc. Eurographics '96, Computer Graphics Forum, vol. 15, no. 3, pp. 67, Aug. 1996.
28. J. Rossignac, "Through the Cracks of the Solid Modeling Milestone," From Object Modelling to Advanced Visual Comm., Coquillart, Strasser, Stucki, eds., pp. 1-75, Springer-Verlag, 1994.
29. J. Rossignac, "Geometric Simplification and Compression," Multiresolution Surface Modeling Course, ACM SIGGRAPH course notes 25, Los Angeles, 1997.
30. J. Rossignac and D. Cardoze, "Matchmaker: Manifold Breps for Non-Manifold r-sets," Technical Report: GIT-GVU-99-03, GVU Center, Georgia Inst. of Technology, Oct. 1998, httpy/www.gvu.gatech. edu/gvu/reports/1999. To appear in the Proc. ACM Symp. Solid Modeling, 1999.
31. J. Rossignac, "3D Geometry Compression: Just-in-Time Upgrades for Triangle Meshes," 3D Geometry Compression, course notes 21, SIGGRAPH '98, Orlando, Fla., July 1998.
32. J. Snoeyink and M. van Kerveld, "Good Orders for Incremental (Re)Construction," Proc. ACM Symp. Computational Geometry, pp. 400-402, Nice, France, June 1997.
33. G. Taubin and J. Rossignac, "Geometric Compression through Topological Surgery," ACM Trans. Graphics, vol. 17, no. 2, pp. 84-115, Apr. 1998.
34. G. Taubin, W. Horn, F. LAriz.arus, and J. Rossignac, "Geometry Coding and VRML," Proc. IEEE, pp. 1,228-1,243, vol. 96, no. 6, June 1998.
35. G. Taubin, A. Gueziec, W. Horn, and F. LArizarus, "Progressive Forest Split Compression," Proc. ACM SIGGRAPH'98, pp. 123-132, July 1998.
36. G. Taubin and J. Rossignac, "3D Geometry Compression," course notes 21, SIGGRAPH'98, Orlando, Fla., July, 1998.
37. C. Tourna and C. Gotsman, "Triangle Mesh Compression," Proc. Graphics Interface '98, pp. 26-34,1998.
38. G. Turan, "Succinct Representations of Graphs," Discrete Applied Math., vol. 8, pp. 289-294, 1984.
39. W.T. Tuttc, "The Enumerative Theory of Planar Graphs," A Survey of Computational Theory, J.N. Srinivasan et al., eds. North-Holland, 1973.
40. T Welch, "A Technique for High-Performance Data Compression," Computer, vol. 17, no. 6, pp. 8-19, June 1984.
41. J. Ziv and A. Lempel, "A Universal Algorithm for Sequential Data Compression," IEEE Trans. Information Theory, vol. 23, no. 3, pp. 337-343, May 1977.