Abstract
Real-world data sets produce unmanageably large contour trees because of noise. Contour Tree Simplification (CTS) would remove small scale branches, and maintain essential structure of data. Despite multiple measures of importance (MOIs) available, conventional CTS approaches often use a single MOI, which is not enough in evaluating the importance of branches in the CTS. This paper proposes an importance-driven CTS approach. The proposed approach combines multiple MOIs through the introduction of various concepts to maximize advantages of each MOI. In the attribute space, various attributes of a branch are organized in a single space. The concept of the importance triangle is used to evaluate the importance of a branch by size of the importance triangle. It considers the whole attribute space and gives better evaluation of importance. Finally, new importance values of branches are compared in the importance space to make simplification decisions.
Graphical Abstract
Similar content being viewed by others
References
Carr H, Snoeyink J, van de Panne M (2010) Flexible isosurfaces: simplifying and displaying scalar topology using the contour tree. Comp Geo 43(1):42–58
Correa C, Lindstrom P, Bremer P-T (2011) Topological Spines: a structure-preserving visual representation of scalar fields. IEEE Trans Visual Comput Graphics 17(12):1842–1851
Edelsbrunner H, Harer J, Zomorodian A (2001) Hierarchical morse complexes for piecewise linear 2-manifolds. In Proceedings of the 17th annual symposium on Computational geometry, pp 70–79
Fitting M (2001) Pythagoras’ Theorem for areas––revisited. Technical report, department of mathematics and computer science, City University of New York
Johansson G, Museth K, Carr H (2007) Flexible and topologically localized segmentation. In Proceedings of Eurographics/IEEE VGTC Symposium on Visualization (EuroVis2007) pp 179–186
Merriam-Webster (2010). Merriam-Webster Online. http://www.merriam-webster.com/dictionary/importance
Natarajan V, Pascucci V (2005) Volumetric data analysis using morse- smale complexes. In: Proceedings of the International Conference on Shape Modeling and Applications 2005 pp 322–327
Pascucci V, Cole-McLaughlin K, Scorzelli G (2004) Multi-resolution computation and presentation of contour trees. In: Proceedings of the IASTED conference on Visualization, Imaging, and Image Processing, pp 452–290
Pascucci V, Scorzelli G, Bremer P-T, Mascarenhas A (2007) Robust on-line computation of Reeb graphs: simplicity and speed. ACM Trans Graph 26(3):58
Quadrat J-P, Lassere JB, Hiriart-Urruty J-B (2001) Pythagoras’ theorem for areas. Amer Mathem Month 108(6):549–551
Reeb G (1946) Sur les points singuliers d’une forme de pfaff completement integrable ou d’une fonction numerique. Comptes Rendus Acad, Science Paris 222:847–849
Smale S (1961) On gradient dynamical systems. Ann Math 74:199–206
Takahashi S, Nielson GM Takeshima Y, Fujishiro I (2004a) Topological volume skeletonization using adaptive tetrahedralization. In: Proceedings of the Geometric Modeling and Processing 2004, pp 227–236
Takahashi S, Takeshima Y, Fujishiro I (2004b) Topological volume skeletonization and its application to transfer function design. Graph Models 66(1):24–49
Weber G, Dillard S, Carr H, Pascucci V, Hamann B (2007) Topology-controlled volume rendering. IEEE Trans Visual Comput Graphics 13(2):330–341
Zhou J, Takatsuka M (2009) Automatic transfer function generation using contour tree controlled residue flow model and color harmonics. IEEE Trans Visual Comput Graphics 15(6):1481–1488
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zhou, J., Xiao, C. & Takatsuka, M. A multi-dimensional importance metric for contour tree simplification. J Vis 16, 341–349 (2013). https://doi.org/10.1007/s12650-013-0180-3
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12650-013-0180-3