W-Structures in Contour Trees

DOI10.1007/978-3-030-83500-2_1OpenAlexW3122899101MaRDI QIDQ5861911

Hamish Carr, Petar Hristov

Publication date: 3 March 2022

Published in: Mathematics and Visualization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-83500-2_1

Mathematics Subject Classification ID

Persistent homology and applications, topological data analysis (55N31) Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computer science (68-XX) Computational aspects of data analysis and big data (68T09) Computational aspects of digital topology (68U03) Computational methods for problems pertaining to algebraic topology (55-08)

Related Items (1)

Pathological and Test Cases for Reeb Analysis

Cites Work

• Unnamed Item
• Unnamed Item
• Flexible isosurfaces: Simplifying and displaying scalar topology using the contour tree
• Extending persistence using Poincaré and Lefschetz duality
• Topological persistence and simplification
• Computing contour trees in all dimensions
• Parallel computation of the topology of level sets
• Reeb graphs for shape analysis and applications
• Topological methods in data analysis and visualization. Theory, algorithms, and applications. Based on the 3rd workshop on topological methods in data analysis and visualization, Snowbird, UT, USA, February 23--24, 2009
• Distributed Contour Trees
• Representing Interpolant Topology for Contour Tree Computation
• The TOPORRERY: computation and presentation of multi-resolution topology
• Efficiency of a Good But Not Linear Set Union Algorithm
• Pathological and Test Cases for Reeb Analysis

This page was built for publication: W-Structures in Contour Trees