Representing Interpolant Topology for Contour Tree Computation

DOI10.1007/978-3-540-88606-8_5zbMath1161.05342OpenAlexW86788902MaRDI 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

zbMATH Keywords

transversalstopologyVisualizationfinite state machineswidgetscomputing contour treesdigital image connectivityinterpolation on meshesmarching cubes casesmesh-based interpolant

Mathematics Subject Classification ID

Applications of graph theory (05C90) Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

W-Structures in Contour Trees

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

This page was built for publication: Representing Interpolant Topology for Contour Tree Computation