Computing contour trees in all dimensions
From MaRDI portal
Publication:1869743
Recommendations
Cites work
- scientific article; zbMATH DE number 1445395 (Why is no real title available?)
- scientific article; zbMATH DE number 3401836 (Why is no real title available?)
- Critical points and curvature for embedded polyhedra
- Efficiency of a Good But Not Linear Set Union Algorithm
- Morse Theory. (AM-51)
- Octrees for faster isosurface generation
- Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
Cited in
(51)- Continuous Histograms for Anisotropy of 2D Symmetric Piece-Wise Linear Tensor Fields
- Level set tree methods
- Representing Interpolant Topology for Contour Tree Computation
- Local, smooth, and consistent Jacobi set simplification
- Reeb graphs for shape analysis and applications
- Flooding countries and destroying dams
- Pathological and Test Cases for Reeb Analysis
- scientific article; zbMATH DE number 1445395 (Why is no real title available?)
- Visual data mining based on differential topology: a survey
- Estimation of level set trees using adaptive partitions
- Isocontour based Visualization of Time-varying Scalar Fields
- Topological features in glyph-based corotation visualization
- Time-varying Reeb graphs for continuous space-time data
- Avoiding the global sort: a faster contour tree algorithm
- Computational Topology via Functional Programming: A Baseline Analysis
- The Safari interface for visualizing time-dependent volume data using iso-surfaces and contour spectra
- Reeb posets and tree approximations
- Segmentation of regions of interest using active contours with SPF function
- On merge trees and discrete Morse functions on paths and trees
- TOPOLOGY-GUIDED TESSELLATION OF QUADRATIC ElEMENTS
- Flexible isosurfaces: Simplifying and displaying scalar topology using the contour tree
- A deterministic \(O(m \log {m})\) time algorithm for the Reeb graph
- Robust computation of Morse-Smale complexes of bilinear functions
- Some equivalence relation between persistent homology and morphological dynamics
- 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
- Categorified Reeb graphs
- Efficient algorithms for computing Reeb graphs
- Measuring the distance between merge trees
- Topology Based Selection and Curation of Level Sets
- Contours and tight clusters
- Approximate streamsurfaces for flow visualization
- W-Structures in Contour Trees
- 3D finite element meshing from imaging data
- Simple and optimal output-sensitive construction of contour trees using monotone paths
- Probabilistic convergence and stability of random mapper graphs
- Measuring the error in approximating the sub-level set topology of sampled scalar data
- Multivariate topology simplification
- Provably robust simplification of component trees of multidimensional images
- Interactive comparison of multifield scalar data based on largest contours
- Visualizing multivariate data using singularity theory
- Distributed contour trees
- Flexible fiber surfaces: a Reeb-free approach
- Topological subdivision graphs for comparative and multifield visualization
- Interpreting Galilean invariant vector field analysis via extended robustness
- 3D edge detection by selection of level surface patches
- Critical sets in discrete Morse theories: relating Forman and piecewise-linear approaches
- Triplet merge trees
- Hierarchies and Ranks for Persistence Pairs
- High-quality topological structure extraction of volumetric data on \(C^2\)-continuous framework
This page was built for publication: Computing contour trees in all dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1869743)
