Representing Interpolant Topology for Contour Tree Computation
DOI10.1007/978-3-540-88606-8_5zbMATH Open1161.05342OpenAlexW86788902MaRDI QIDQ3628680FDOQ3628680
Authors: Hamish Carr, Jack Snoeyink 
Publication date: 20 May 2009
Published in: Mathematics and Visualization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-88606-8_5
Recommendations
- Parallel computation of the topology of level sets
- Flexible isosurfaces: Simplifying and displaying scalar topology using the contour tree
- Simple and optimal output-sensitive construction of contour trees using monotone paths
- Publication:4952718
- Avoiding the global sort: a faster contour tree algorithm
topologytransversalsfinite state machinesVisualizationwidgetscomputing contour treesdigital image connectivityinterpolation on meshesmarching cubes casesmesh-based interpolant
Applications of graph theory (05C90) Graph algorithms (graph-theoretic aspects) (05C85) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies for image processing (68U10) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Cites Work
- Morse Theory. (AM-51)
- Efficiency of a Good But Not Linear Set Union Algorithm
- Title not available (Why is that?)
- Computing contour trees in all dimensions
- Parallel computation of the topology of level sets
- Hierarchical morse complexes for piecewise linear 2-manifolds
- The Safari interface for visualizing time-dependent volume data using iso-surfaces and contour spectra
- Topological volume skeletonization and its application to transfer function design
- Simple and optimal output-sensitive construction of contour trees using monotone paths
Cited In (9)
- Title not available (Why is that?)
- Simple and optimal output-sensitive construction of contour trees using monotone paths
- Distributed contour trees
- High-quality topological structure extraction of volumetric data on \(C^2\)-continuous framework
- W-Structures in Contour Trees
- DeBruijn counting for visualization algorithms
- The toporrery: computation and presentation of multi-resolution topology
- Parallel computation of the topology of level sets
- Flexible isosurfaces: Simplifying and displaying scalar topology using the contour tree
This page was built for publication: Representing Interpolant Topology for Contour Tree Computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3628680)
