Hierarchyless simplification, stripification and compression of triangulated two-manifolds

Computer Graphics Forum

Volumn 24, Issue 3, 2005, Pages 457-467

  Diaz Gutierrez, Pablo ^a   Gopi, M ^a   Pajarola, Renato ^a  

^a Irvine   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STRUCTURES; EDGE DETECTION; HIERARCHICAL SYSTEMS; IMAGE COMPRESSION; THEOREM PROVING; TOPOLOGY; GEOMETRY; SET THEORY;

COLLAPSIBLE EDGES; GEOMETRIC COMPRESSION; STRIPIFICATION; TRIANGLE STRIP; COMPRESSION ALGORITHMS; CONNECTED COMPONENT; GEOMETRIC SIMPLIFICATION; MULTIRESOLUTION MODEL; ORDER INDEPENDENTS; ORIGINAL MODEL; REFINEMENT OPERATIONS; TRIANGLE STRIPS;

COMPUTER GRAPHICS;

EID: 33745137032     PISSN: 01677055     EISSN: 14678659     Source Type: Journal    
DOI: 10.1111/j.1467-8659.2005.00871.x     Document Type: Article

References (42)

1. [AD01] ALLIEZ P., DESBRUN M.: Valence-driven connectivity encoding for 3D meshes. Computer Graphics Forum (EUROGRAPHICS) 20, 3 (2001), 480-489. 5
2. [BBDL01] BIEDL T. C., BOSE P., DEMAINE E. D., LUBIW A.: Efficient algorithms for Petersen's matching theorem. J. Algorithms 38 (2001), 110-134. 3
3. [BRR*01] BELMONTE O., REMOLAR I., RIBELLES J., CHOVER M., REBOLLO C., FERNANDEZ M.: Multiresolution triangle strips. In Proceedings IASTED Invernational Conference on Visualization, Imaging and Image Processing (2001), pp. 182-187. 1
4. [Cho97] CHOW M. M.: Optimized geometry compression for real-time rendering. In Proc. IEEE Visualization (1997), pp. 347-354. 1
5. [CNW87] CLEARY J. G., NEAL R. M., WITTEN I. H.: Arithmetic coding for data compression. Communications of the ACM 30, 6 (June 1987), 520-540. 6
6. [COM98] COHEN J., OLANO M., MANOCHA D.: Appearance-perserving simplification. In SIGGRAPH (1998), ACM Press, pp. 115-122. 1
7. [Dee95] DEERING M.: Geometry compression. In Proceedings SIGGRAPH (1995), pp. 13-20. 1
8. [DP02] DECORO C., PAJAROLA R.: XFastMesh: Fast view-dependent meshing from external memory. In Proceedings IEEE Visualization (2002), pp. 363-370. 1
9. [ESAV99] EL-SANA J., AZANLI E., VARSHNEY A.: Skip strips: Maintaining triangle strips for view-dependent rendering. In Proc. IEEE Visualization (1999), pp. 131-138. 1, 5
10. [ESC00] EL-SANA J., CHIANG Y.-J.: External memory view-dependent simplification. In Proceedings EUROGRAPHICS (2000), pp. 139-150, 1
11. [ESV96] EVANS F., SKIENA S., VARSHNEY A.: Optimizing triangle strips for fast rendering. In Proceedings IEEE Visualization (1996), pp. 319-326. 1
12. [ESV99] EL-SANA J., VARSHNEY A.: Generalized view-dependent simplification. In Proc. EUROGRAPHICS (1999), pp. 83-94. 1
13. [GE04] GOPI M., EPPSTEIN D.: Single strip triangulation of manifolds with arbitrary topology. Computer Graphics Forum (EUROGRAPHICS) 23, 3 (2004), 371-379. 4, 7
14. [GH97] GARLAND M., HECKBERT P. S.: Surface simplification using quadric error metrics. In Proceedings SIGGRAPH (1997), pp. 209-216. 1, 7
15. [GH98] GARLAND M., HECKBERT P. S.: Simplifying surfaces with color and texture using quadric error metrics. In IEEE Visualization (1998), pp. 264-269. 1
16. [Gop04] GOPI M.: Controllable single-strip generation for triangulated surfaces. In Pacific Graphics (2004), IEEE Computer Society, pp. 61-69. 1
17. [GS98] GUMHOLD S., STRASSER W.: Real time compression of triangle mesh connectivity. In Proceedings SIGGRAPH (1998), pp. 133-140. 5
18. [HDD*93] HOPPE H., DEROSE T., DUCHAMP T., MC-DONALD J., STUETZLE W.: Mesh optimization. In Proceedings SIGGRAPH (1993), pp. 19-26. 1
19. [Hop96] HOPPE H.: Progressive meshes. In Proceedings SIGGRAPH (1996), pp. 99-108. 1
20. [Hop97] HOPPE H.: View-dependent refinement of progressive meshes. In SIGGRAPH (1997), pp. 189-198. 1
21. [Huf52] HUFFMAN D. A.: A method for the construction of minimum redundancy codes. In Proceedings Inst. Electr. Radio Eng. (1952), pp. 1098-1101. 6
22. [Ise00] ISENBURG M.: Triangle strip compression. In Graphics Interface 2000 (2000), pp. 197-204. 1, 5
23. [KL03] KIM J., LEE S.: Transitive mesh space of a progressive mesh. IEEE Trans. on Visualization and Computer Graphics 9, 4 (Oct-Dec 2003), 463-480. 1
24. [Kor99] KORNMANN D.: Fast and simple triangle strip generation. Technical Report, 1999. 1
25. [LT98] LINDSTROM P., TURK G.: Fast and memory efficient polygonal simplification. In IEEE Visualization (1998), pp. 279-286. 1
26. [Lue01] LUEBKE D. P.: A developer's survey of polygonal simplification algorithms. IEEE Computer Graphics & Applications 21, 3 (May/June 2001), 24-35, 1
27. [LZ78] LEMPEL A., ZIV J.: Compression of individual sequences via variable-rate coding. IEEE Trans. on Information Theory 24, 5 (September 1978), 530-536. 6
28. [MNW98] MOFFAT A., NEAL R., WITTEN I. H.: Arithmetic coding revisited. ACM Transactions on Information Systems 16, 3 (July 1998), 256-294. 8
29. [Paj01] PAJAROLA R.: Fastmesh: Efficient view-dependent meshing. In Proceedings Pacific Graphics (2001), pp. 22-30. 1
30. [Pet91] PETERSON J. P. C.: Die theorie der regularen graphs (The Theory of Regular Graphs). Acta Mathematica 15(1891), 193-220. 3
31. [Pug90] PUGH W.: Skip lists: a probabilistic alternative to balanced trees. Commun. ACM 33, 6(1990), 668-676. 4
32. [Ros99] ROSSIGNAC J.: Edgebreaker: Compressing the incidence graph of triangle meshes. IEEE Trans. on Visualization and Computer Graphics 5, 1 (January-March 1999), 47-61. 5
33. [RS99] ROSSIGNAC J., SZYMCZAK A.: Wrap&zip decompression of the connectivity of triangle meshes compressed with edgebreaker. Journal of Computational Geometry, Theory and Applications 14, 1-3 (November 1999), 119-135. 5
34. [Shi] SHIKHARE D.: Edgebreaker 3D compression package. http://www.angelfire.com/space2/dineshshikhare/. 8
35. [SP03] SHAFAE M., PAJAROLA R.: DStrips: Dynamic triangle strips for real-time mesh simplification and rendering. In Pacific Graphics (2003), pp. 271-280. 1, 5
36. [Ste01] STEWART A. J.: Tunneling for triangle strips in continuous level-of-detail meshes. In Proceedings Graphics Interface (2001), pp. 91-100. 1
37. [TDG*00] TAUBIN G., DEERING M., GOTSMAN C., GUMHOLD S., ROSSIGNAC J.: 3D geometry compression. SIGGRAPH 2000 Course Notes 38, 2000. 1
38. [TG98] TOUMA C., GOTSMAN C.: Triangle mesh compression. In Proceedings Graphics Interface (1998), pp. 26-34. 5
39. [Tho00] THORUP M.: Near-optimal fully-dynamic graph connectivity. In Proc. 32nd Annu. ACM Symp. on Theory of Computing (2000), pp. 343-350. 3
40. [TR98] TAUBIN G., ROSSIGNAC J.: Geometric compression through topological surgery. ACM Transactions on Graphics 17, 2 (1998), 84-115. 5
41. [XHM99] XIANG X., HELD M., MITCHELL J. S. B.: Fast and effective stripification of polygonal surface models. In Proceedings Sym. Interactive 3D Graphics (1999), pp. 71-78. 1
42. [XV96] XIA J. C., VARSHNEY A.: Dynamic view-dependent simplification for polygonal models. In Proceedings IEEE Visualization (1996), pp. 327-334. 1