Progressive Simplification of Tetrahedral Meshes Preserving All Isosurface Topologies

Computer Graphics Forum

Volumn 22, Issue 3, 2003, Pages 493-504

  Chiang, Yi Jen ^a   Lu, Xiang ^a  

^a POLYTECHNIC UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; DATA REDUCTION; ERROR ANALYSIS; SURFACE STRUCTURE; TOPOLOGY;

ISOSURFACES;

IMAGE SEGMENTATION;

EID: 0141504416     PISSN: 01677055     EISSN: None     Source Type: Journal    
DOI: 10.1111/1467-8659.00697     Document Type: Conference Paper

References (21)

1. C. Bajaj, V. Pascucci, and D. Schikore. The contour spectrum. In Proc. IEEE Visualization, pages 167-175, 1997.
2. T. F. Banchoff. Critical points and curvature for embedded polyhedra. J. Diff. Geom., 1:245-256, 1967.
3. H. Carr, J. Snoeyink, and U. Axen. Computing contour trees in all dimensions. In Proc. ACM-SIAM Sympos. Discrete Algorithms, pages 918-926, 2000.
4. Y.-J. Chiang, T. Lenz, X. Lu, and G. Rote. Simple and output-sensitive construction of contour trees using monotone paths, 2003. Manuscript. http://cis.poly.edu/chiang/contour.pdf.
5. P. Chopra and J. Meyer. Tetfusion: An algorithm for rapid tetrahedral mesh simplification. In Proc. IEEE Visualization, pages 133-140, 2002.
6. P. Cignoni, D. Costanza, C. Montani, C. Rocchini, and R. Scopigno. Simplification of tetrahedral meshes with accurate error evaluation. In Proc. IEEE Visualization, pages 85-92, 2000.
7. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, Cambridge, MA, 2nd edition, 2001.
8. M. de Berg and M. van Kreveld. Trekking in the Alps without freezing or getting tired. Algorithmica, 18:306-323, 1997.
9. T. Dey, H. Edelsbrunner, S. Guha, and D. V. Nekhayev. Topology preserving edge contraction. Publications de l'Institut, Mathématique (Beograd), 60(80), 1999.
10. T. Gerstner and R. Pajarola. Topology preserving and controlled topology simplifying multiresolution isosurface extraction. In Proc. IEEE Visualization, pages 259-266, 2000.
11. J. W. Milnor. Morse Theory. Princeton University Press, Princeton, NJ, 1963.
12. V. Pascucci and K. Cole-McLaughlin. Efficient computation of the topology of level sets. In Proc. IEEE Visualization, pages 187-194, 2002.
13. W. Schroeder, K. Martin, and W. Lorensen. The Visualization Toolkit. Prentice-Hall, 1996.
14. Y. Shinagawa, T. L. Kunii, and Y. L. Kergosien. Surface coding based on Morse theory. IEEE Comput. Graph. Appl., 11:66-78, September 1991.
15. O.G. Staadt and M.H. Gross. Progressive tetrahedralizations. In Proc. IEEE Visualization, pages 397-402, 1998.
16. S. Tarasov and M. Vyalyi. Construction of contour trees in 3D in O(n log n) steps. In Proc. ACM Sympos. Comput. Geom., pages 68-75, 1998.
17. I.J. Trotts, B. Hamann, and K.I. Joy. Simplification of tetrahedral meshes with error bounds. IEEE Trans. Visualization and Computer Graphics, 5(3):224-237, 1999.
18. I.J. Trotts, B. Hamann, K.I. Joy, and D.F. Wiley. Simplification of tetrahedral meshes. In Proc. IEEE Visualization, pages 287-295, 1998.
19. M. van Kreveld, R. van Oostrum, C. Bajaj, V. Pascucci, and D. Schikore. Contour trees and small seed sets for isosurface traversal. In Proc. ACM Sympos. Comput. Geom., pages 212-220, 1997.
20. G. H. Weber, G. Scheuermann, and B. Hamann. Detecting critical regions in scalar fields. In Data Visualization 2003 (Proc. VisSym), 2003.
21. Z. Wood, H. Hoppe, M. Desbrun, and P. Schröder. Isosurface topology simplification, 2002. Manuscript. http://www.multires.caltech.edu/pubs/topo_filt.pdf.