Representing Interpolant Topology for Contour Tree Computation
DOI10.1007/978-3-540-88606-8_5zbMath1161.05342MaRDI QIDQ3628680
Jack Scott Snoeyink, Hamish Carr
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
transversals; topology; Visualization; finite state machines; widgets; computing contour trees; digital image connectivity; interpolation on meshes; marching cubes cases; mesh-based interpolant
05C90: Applications of graph theory
68U10: Computing methodologies for image processing
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
65D18: Numerical aspects of computer graphics, image analysis, and computational geometry
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Cites Work
- Unnamed Item
- Simple and optimal output-sensitive construction of contour trees using monotone paths
- Computing contour trees in all dimensions
- The Safari interface for visualizing time-dependent volume data using iso-surfaces and contour spectra
- Parallel computation of the topology of level sets
- Morse Theory. (AM-51)
- Efficiency of a Good But Not Linear Set Union Algorithm
- Topological volume skeletonization and its application to transfer function design
- Hierarchical morse complexes for piecewise linear 2-manifolds