Representing interpolant topology for contour tree computation

Mathematics and Visualization

Volumn 0, Issue , 2009, Pages 59-73

  Carr, Hamish ^a   Snoeyink, Jack ^b  

^a UNIVERSITY COLLEGE DUBLIN   (Ireland)

^b UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY; TREES (MATHEMATICS); VISUALIZATION;

ALGORITHM IMPLEMENTATION; ALGORITHMS DEVELOPMENT; BARYCENTRIC INTERPOLATION; CONTOUR TREES; DIGITAL IMAGE; FINITE STATES MACHINE; INTERPOLANTS; MARCHING CUBE; TOPOLOGICAL FEATURES; TRILINEAR INTERPOLATION;

INTERPOLATION;

EID: 77957897320     PISSN: 16123786     EISSN: 2197666X     Source Type: Book Series    
DOI: 10.1007/978-3-540-88606-8_5     Document Type: Conference Paper

References (33)

1. C. L. Bajaj, V. Pascucci, and D. R. Schikore. The Contour Spectrum. In Proceedings of Visualization 1997, pages 167–173, 1997.
2. P. Bhaniramka, R. Wenger, and R. A. Crawfis. Isosurface Construction in Any Dimension Using Convex Hulls. IEEE Transactions on Visualization and Computer Graphics, 10(2):130–141, 2004.
3. R. L. Boyell and H. Ruston. Hybrid Techniques for Real-time Radar Simulation. In Proceedings of the 1963 Fall Joint Computer Conference, pages 445–458. IEEE, 1963.
4. H. Carr, T. Möller, and J. Snoeyink. Simplicial Subdivisions and Sampling Artifacts. In Proceedings of Visualization 2001, pages 99–106, 2001.
5. H. Carr and J. Snoeyink. Path Seeds and Flexible Isosurfaces: Using Topology for Exploratory Visualization. In Proceedings of Eurographics Visualization Symposium 2003, pages 49–58, 285, 2003.
6. H. Carr, J. Snoeyink, and U. Axen. Computing Contour Trees in All Dimensions. Computational Geometry: Theory and Applications, 24(2):75–94, 2003.
7. H. Carr, J. Snoeyink, and M. van de Panne. Simplifying Flexible Isosurfaces with Local Geometric Measures. In Proceedings of Visualization 2004, pages 497–504, 2004.
8. H. Carr, T. Theußl, and T. Möller. Isosurfaces on Optimal Regular Samples. In Proceedings of Eurographics Visualization Symposium 2003, pages 39–48, 284, 2003.
9. Y.-J. Chiang, T. Lenz, X. Lu, and G. Rote. Simple and Optimal Output-Sensitive Construction of Contour Trees Using Monotone Paths. Computational Geometry: Theory and Applications, 30:165–195, 2005.
10. Y.-J. Chiang and X. Lu. Progressive Simplification of Tetrahedral Meshes Preserving All Isosurface Topologies. Computer Graphics Forum, 22(3), 2003.
11. M. Dürst. Letters: Additional Reference to ”Marching Cubes”. Computer Graphics, 22(4):65–74, 1988.
12. H. Edelsbrunner, J. Harer, and A. Zomorodian. Hierarchical Morse Complexes for Piecewise Linear 2-Manifolds. In Proceedings of the 17th ACM Symposium on Computational Geometry, pages 70–79. ACM, 2001.
13. H. Freeman and S. Morse. On Searching A Contour Map for a Given Terrain Elevation Profile. Journal of the Franklin Institute, 284(1):1–25, 1967.
14. L. Kettner, J. Rossignac, and J. Snoeyink. The Safari Interface for Visualizing Time-Dependent Volume Data Using Iso-surfaces and Contour Spectra. Computational Geometry: Theory and Applications, 25(1–2):97–116, 2001.
15. A. Lopes and K. Brodlie. Improving the robustness and accuracy of the marching cubes algorithm for isosurfacing. IEEE Transactions on Visualization and Computer Graphics, 9(1):16–29, 2003.
16. W. E. Lorenson and H. E. Cline. Marching Cubes: A High Resolution 3D Surface Construction Algorithm. Computer Graphics, 21(4):163–169, 1987.
17. J. Milnor. Morse Theory. Princeton University Press, Princeton, NJ, 1963.
18. S. Mizuta and T. Matsuda. Description of the Topological Structure of Digital Images by Region-based Contour Tree and Its Application. Technical report, Institute of Electronics, Information and Communication Engineers, 2004.
19. C. Montani, R. Scateni, and R. Scopigno. A modified look-up table for implicit disambiguation of Marching Cubes. Visual Computer, 10:353–355, 1994.
20. B. Natarajan. On generating topologically consistent isosurfaces from uniform samples. Visual Computer, 11:52–62, 1994.
21. G. M. Nielson. On Marching Cubes. IEEE Transactions on Visualization and Computer Graphics, 9(3):283–297, 2003.
22. G. M. Nielson and B. Hamann. The Asymptotic Decider: Resolving the Ambiguity in Marching Cubes. In Proceedings of Visualization 1991, pages 83–91. IEEE, 1991.
23. V. Pascucci. On the Topology of the Level Sets of a Scalar Field. In Abstracts of the 13th Canadian Conference on Computational Geometry, pages 141–144, 2001.
24. V. Pascucci and K. Cole-McLaughlin. Parallel Computation of the Topology of Level Sets. Algorithmica, 38(2):249–268, 2003.
25. G. Reeb. Sur les points singuliers d’une forme de Pfaff complètement intégrable ou d’une fonction numérique. Comptes Rendus de l’Acadèmie des Sciences de Paris, 222:847–849, 1946.
26. Y. Shinagawa, T. L. Kunii, and Y. L. Kergosien. Surface Coding Based on Morse Theory. IEEE Computer Graphics and Applications, 11:66–78, September 1991.
27. S. Takahashi, T. Ikeda, Y. Shinagawa, T. L. Kunii, and M. Ueda. Algorithms for Extracting Correct Critical Points and Constructing Topological Graphs from Discrete Geographical Elevation Data. Computer Graphics Forum, 14(3):C– 181–C–192, 1995.
28. S. Takahashi, Y. Takeshima, and I. Fujishiro. Topological volume skeletonization and its application to transfer function design. Graphical Models, 66(1):24–49, 2004.
29. S. P. Tarasov and M. N. Vyalyi. Construction of Contour Trees in 3D in O(n log n) steps. In Proceedings of the 14th ACM Symposium on Computational Geometry, pages 68–75, 1998.
30. R. E. Tarjan. Efficiency of a good but not linear set union algorithm. Journal of the ACM, 22:215–225, 1975.
31. M. van Kreveld, R. van Oostrum, C. L. Bajaj, V. Pascucci, and D. R. Schikore. Contour Trees and Small Seed Sets for Isosurface Traversal. In Proceedings of the 13th ACM Symposium on Computational Geometry, pages 212–220, 1997.
32. G. Weber, S. Dillard, H. Carr, V. Pascucci, and B. Hamann. Topology-based, flexible volume rendering. To appear in IEEE Transactions on Visualization and Computer Graphics, 2007.
33. X. Zhang, C. L. Bajaj, and N. Baker. Fast Matching of Volumetric Functions Using Multi-resolution Dual Contour Trees. Technical report, Texas Institute for Computational and Applied Mathematics, Austin, Texas, 2004.