Computing contour trees in all dimensions
From MaRDI portal
Publication:1869743
DOI10.1016/S0925-7721(02)00093-7zbMath1052.68098OpenAlexW3138447845WikidataQ56970615 ScholiaQ56970615MaRDI QIDQ1869743
Ulrike Axen, Hamish Carr, Jack Scott Snoeyink
Publication date: 28 April 2003
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0925-7721(02)00093-7
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (49)
The Safari interface for visualizing time-dependent volume data using iso-surfaces and contour spectra ⋮ High-quality topological structure extraction of volumetric data on \(C^2\)-continuous framework ⋮ Segmentation of regions of interest using active contours with SPF function ⋮ Categorified Reeb graphs ⋮ Computational Topology via Functional Programming: A Baseline Analysis ⋮ Distributed Contour Trees ⋮ Measuring the Distance Between Merge Trees ⋮ Topological Features in Glyph-Based Corotation Visualization ⋮ Visualizing Multivariate Data Using Singularity Theory ⋮ Contours and tight clusters ⋮ Approximate streamsurfaces for flow visualization ⋮ Multivariate topology simplification ⋮ A deterministic \(O(m \log {m})\) time algorithm for the Reeb graph ⋮ Estimation of level set trees using adaptive partitions ⋮ Visual data mining based on differential topology: a survey ⋮ Continuous Histograms for Anisotropy of 2D Symmetric Piece-Wise Linear Tensor Fields ⋮ Some equivalence relation between persistent homology and morphological dynamics ⋮ Avoiding the global sort: a faster contour tree algorithm ⋮ On merge trees and discrete Morse functions on paths and trees ⋮ Interactive comparison of multifield scalar data based on largest contours ⋮ Robust computation of Morse-Smale complexes of bilinear functions ⋮ Critical sets in discrete Morse theories: relating Forman and piecewise-linear approaches ⋮ Efficient algorithms for computing Reeb graphs ⋮ Measuring the Error in Approximating the Sub-Level Set Topology of Sampled Scalar Data ⋮ Hierarchies and Ranks for Persistence Pairs ⋮ Triplet Merge Trees ⋮ Pathological and Test Cases for Reeb Analysis ⋮ Flexible Fiber Surfaces: A Reeb-Free Approach ⋮ Topological Subdivision Graphs for Comparative and Multifield Visualization ⋮ Interpreting Galilean Invariant Vector Field Analysis via Extended Robustness ⋮ Time-varying Reeb graphs for continuous space-time data ⋮ Probabilistic convergence and stability of random mapper graphs ⋮ Provably Robust Simplification of Component Trees of Multidimensional Images ⋮ Reeb graphs for shape analysis and applications ⋮ FLOODING COUNTRIES AND DESTROYING DAMS ⋮ Simple and optimal output-sensitive construction of contour trees using monotone paths ⋮ 3D finite element meshing from imaging data ⋮ Reeb posets and tree approximations ⋮ 3D edge detection by selection of level surface patches ⋮ Flexible isosurfaces: Simplifying and displaying scalar topology using the contour tree ⋮ Topology Based Selection and Curation of Level Sets ⋮ Representing Interpolant Topology for Contour Tree Computation ⋮ TOPOLOGY-GUIDED TESSELLATION OF QUADRATIC ElEMENTS ⋮ Isocontour based Visualization of Time-varying Scalar Fields ⋮ W-Structures in Contour Trees ⋮ Topology-Based Feature Design and Tracking for Multi-center Cyclones ⋮ Using Contour Trees in the Analysis and Visualization of Radio Astronomy Data Cubes ⋮ Visually Evaluating the Topological Equivalence of Bounded Bivariate Fields ⋮ Local, smooth, and consistent Jacobi set simplification
Cites Work
This page was built for publication: Computing contour trees in all dimensions
