Parallel computation of the topology of level sets

DOI10.1007/S00453-003-1052-3MaRDI QIDQ1889597zbMATH OpenOpenAlexFDO

Authors Valerio Pascucci, Kree Cole-McLaughlin

Publication date 2 December 2004

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://digital.library.unt.edu/ark:/67531/metadc1405312/, http://www.osti.gov/biblio/15015923

zbMATH Keywords

Betti numbercountour tree

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)

Recommendations

• Avoiding the global sort: a faster contour tree algorithm
• Avoiding the global sort: a faster contour tree algorithm
• Simple and optimal output-sensitive construction of contour trees using monotone paths
• Representing Interpolant Topology for Contour Tree Computation
• Distributed contour trees

Cited in

(26)

• Topological zone organization of scalar volume data
• Avoiding the global sort: a faster contour tree algorithm
• Computing contour trees in all dimensions
• Moduli spaces of Morse functions for persistence
• Topology analysis of time-dependent multi-fluid data using the Reeb graph
• Robust computation of Morse-Smale complexes of bilinear functions
• A categorical approach to contour, split and join trees with application to airway segmentation
• Categorified Reeb graphs
• Avoiding the global sort: a faster contour tree algorithm
• Computational Topology via Functional Programming: A Baseline Analysis
• Distributed contour trees
• Topology Based Selection and Curation of Level Sets
• Representing Interpolant Topology for Contour Tree Computation
• The toporrery: computation and presentation of multi-resolution topology
• Isocontour based Visualization of Time-varying Scalar Fields
• scientific article; zbMATH DE number 1445395 (Why is no real title available?)
• Triplet merge trees
• Flexible fiber surfaces: a Reeb-free approach
• W-Structures in Contour Trees
• Distributed Task-Parallel Topology-Controlled Volume Rendering
• High performance computing for the level-set reconstruction algorithm
• Simple and optimal output-sensitive construction of contour trees using monotone paths
• Parallel level-set methods on adaptive tree-based grids
• Efficient algorithms for computing Reeb graphs
• Time-varying Reeb graphs for continuous space-time data
• 3D edge detection by selection of level surface patches

This page was built for publication: Parallel computation of the topology of level sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1889597)