Drawing Contour Trees in the Plane

The contour tree compactly describes scalar field topology. From the viewpoint of graph drawing, it is a tree with attributes at vertices and optionally on edges. Standard tree drawing algorithms emphasize structural properties of the tree and neglect the attributes. Applying known techniques to convey this information proves hard and sometimes even impossible. We present several adaptions of popular graph drawing approaches to the problem of contour tree drawing and evaluate them. We identify five esthetic criteria for drawing contour trees and present a novel algorithm for drawing contour trees in the plane that satisfies four of these criteria. Our implementation is fast and effective for contour tree sizes usually used in interactive systems (around 100 branches) and also produces readable pictures for larger trees, as is shown for an 800 branch example.

[1]  Edward M. Reingold,et al.  Tidier Drawings of Trees , 1981, IEEE Transactions on Software Engineering.

[2]  Gerik Scheuermann,et al.  Interactive Comparison of Scalar Fields Based on Largest Contours with Applications to Flow Visualization , 2008, IEEE Transactions on Visualization and Computer Graphics.

[3]  Colin Ware,et al.  Information Visualization: Perception for Design , 2000 .

[4]  David Harel,et al.  Axis-by-Axis Stress Minimization , 2003, GD.

[5]  Emden R. Gansner,et al.  A Technique for Drawing Directed Graphs , 1993, IEEE Trans. Software Eng..

[6]  J. Tenenbaum,et al.  A global geometric framework for nonlinear dimensionality reduction. , 2000, Science.

[7]  Bernd Hamann,et al.  Topology-Controlled Volume Rendering , 2006, IEEE Transactions on Visualization and Computer Graphics.

[8]  Valerio Pascucci,et al.  Topological Landscapes: A Terrain Metaphor for Scientific Data , 2007, IEEE Transactions on Visualization and Computer Graphics.

[9]  Vijay Natarajan,et al.  Efficient algorithms for computing Reeb graphs , 2009, Comput. Geom..

[10]  Satoru Kawai,et al.  An Algorithm for Drawing General Undirected Graphs , 1989, Inf. Process. Lett..

[11]  Valerio Pascucci,et al.  Loop surgery for volumetric meshes: Reeb graphs reduced to contour trees , 2009, IEEE Transactions on Visualization and Computer Graphics.

[12]  Jack Snoeyink,et al.  Path Seeds and Flexible Isosurfaces - Using Topology for Exploratory Visualization , 2003, VisSym.

[13]  Michael Kaufmann,et al.  yFiles - Visualization and Automatic Layout of Graphs , 2001, Graph Drawing Software.

[14]  Vijay Natarajan,et al.  Efficient Output-Sensitive Construction of Reeb Graphs , 2008, ISAAC.

[15]  Yi-Jen Chiang,et al.  Progressive Simplification of Tetrahedral Meshes Preserving All Isosurface Topologies , 2003, Comput. Graph. Forum.

[16]  Bongshin Lee,et al.  Visualizations for taxonomic and phylogenetic trees , 2004, Bioinform..

[17]  Arne Frick.  Upper Bounds on the Number of Hidden Nodes in Sugiyama's Algorithm , 1996, Graph Drawing.

[18]  Ivan Herman,et al.  Graph Visualization and Navigation in Information Visualization: A Survey , 2000, IEEE Trans. Vis. Comput. Graph..

[19]  Vincent Kanade,et al.  Clustering Algorithms , 2021, Wireless RF Energy Transfer in the Massive IoT Era.

[20]  Yuriko Takeshima,et al.  Introducing topological attributes for objective-based visualization of simulated datasets , 2005, Fourth International Workshop on Volume Graphics, 2005..

[21]  Valerio Pascucci,et al.  The contour spectrum , 1997, Proceedings. Visualization '97 (Cat. No. 97CB36155).

[22]  Masato Okada,et al.  Applying Manifold Learning to Plotting Approximate Contour Trees , 2009, IEEE Transactions on Visualization and Computer Graphics.

[23]  Michael Kaufmann,et al.  An Efficient Implementation of Sugiyama's Algorithm for Layered Graph Drawing , 2004, J. Graph Algorithms Appl..

[24]  Roger L. Boyell,et al.  Hybrid techniques for real-time radar simulation , 1963, AFIPS '63 (Fall).

[25]  Tosiyasu L. Kunii,et al.  Surface coding based on Morse theory , 1991, IEEE Computer Graphics and Applications.

[26]  Jack Snoeyink,et al.  Simplifying flexible isosurfaces using local geometric measures , 2004, IEEE Visualization 2004.

[27]  Yuriko Takeshima,et al.  Topological volume skeletonization using adaptive tetrahedralization , 2004, Geometric Modeling and Processing, 2004. Proceedings.

[28]  C. Bajaj,et al.  Fast Matching of Volumetric Functions Using Multi-resolution Dual Contour Trees , 2004 .

[29]  David Harel,et al.  Graph Drawing by High-Dimensional Embedding , 2002, J. Graph Algorithms Appl..

[30]  David Auber,et al.  Tulip - A Huge Graph Visualization Framework , 2004, Graph Drawing Software.

[31]  Helen C. Purchase,et al.  Which Aesthetic has the Greatest Effect on Human Understanding? , 1997, GD.

[32]  Yehuda Koren,et al.  Graph Drawing by Stress Majorization , 2004, GD.

[33]  Mitsuhiko Toda,et al.  Methods for Visual Understanding of Hierarchical System Structures , 1981, IEEE Transactions on Systems, Man, and Cybernetics.

[34]  Pascucci,et al.  Multi-Resolution Representation of Topology , 2004 .

[35]  Emden R. Gansner,et al.  An open graph visualization system and its applications to software engineering , 2000, Softw. Pract. Exp..