Simple and optimal output-sensitive construction of contour trees using monotone paths
From MaRDI portal
A new agorithm for computing contours trees in high dimensional spaces is described. Compared with previous algorithms for the same problem, the new one has the advantage of avoiding some sorting of the whole dataset by sorting only a subset of critical points. The experiments on unstructured three-dimensional meshes are based on real-world scientific visualisation applications.
Recommendations
- Nearly optimal monotone drawing of trees
- Optimal monotone drawings of trees
- I/O-efficient contour tree simplification
- Computing contour trees in all dimensions
- Publication:4952718
- scientific article; zbMATH DE number 4020870
- Representing Interpolant Topology for Contour Tree Computation
- Optimal decision trees on simplicial complexes
- On parameters in monotonically labelled trees
Cites work
- Combinatorial manifolds with few vertices
- Computing contour trees in all dimensions
- Critical points and curvature for embedded polyhedra
- Critical Points and Curvature for Embedded Polyhedral Surfaces
- Efficiency of a Good But Not Linear Set Union Algorithm
- Geometric Separators for Finite-Element Meshes
- Hierarchical Morse-Smale complexes for piecewise linear 2-manifolds
- How to Draw a Graph
- scientific article; zbMATH DE number 125589 (Why is no real title available?)
- scientific article; zbMATH DE number 554764 (Why is no real title available?)
- scientific article; zbMATH DE number 3337454 (Why is no real title available?)
- scientific article; zbMATH DE number 3343351 (Why is no real title available?)
- Introduction to algorithms
- Loops in Reeb graphs of 2-manifolds
- Morse Theory. (AM-51)
- Parallel computation of the topology of level sets
- Singularities of piecewise linear mappings. I Mappings into the real line
- The Safari interface for visualizing time-dependent volume data using iso-surfaces and contour spectra
- Topological modeling for visualization
- Topological volume skeletonization and its application to transfer function design
- Topological zone organization of scalar volume data
- Topologically non-degenerate functions on a compact n-manifold M
- Trekking in the alps without freezing or getting tired
Cited in
(15)- Avoiding the global sort: a faster contour tree algorithm
- Computing contour trees in all dimensions
- Parallel computation of the topology of level sets
- Reeb graphs for shape analysis and applications
- Avoiding the global sort: a faster contour tree algorithm
- Distributed contour trees
- Representing Interpolant Topology for Contour Tree Computation
- TOPOLOGY-GUIDED TESSELLATION OF QUADRATIC ElEMENTS
- The toporrery: computation and presentation of multi-resolution topology
- I/O-efficient contour tree simplification
- scientific article; zbMATH DE number 1445395 (Why is no real title available?)
- Topological subdivision graphs for comparative and multifield visualization
- Using Contour Trees in the Analysis and Visualization of Radio Astronomy Data Cubes
- Flexible isosurfaces: Simplifying and displaying scalar topology using the contour tree
- Time-varying Reeb graphs for continuous space-time data
This page was built for publication: Simple and optimal output-sensitive construction of contour trees using monotone paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q705555)
