Parallel computation of the topology of level sets
From MaRDI portal
Publication:1889597
DOI10.1007/s00453-003-1052-3zbMath1072.68112OpenAlexW2095326847MaRDI QIDQ1889597
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/
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)
Related Items (17)
Categorified Reeb graphs ⋮ Computational Topology via Functional Programming: A Baseline Analysis ⋮ Distributed Contour Trees ⋮ 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 ⋮ Efficient algorithms for computing Reeb graphs ⋮ Triplet Merge Trees ⋮ Flexible Fiber Surfaces: A Reeb-Free Approach ⋮ Time-varying Reeb graphs for continuous space-time data ⋮ Simple and optimal output-sensitive construction of contour trees using monotone paths ⋮ 3D edge detection by selection of level surface patches ⋮ Topology Based Selection and Curation of Level Sets ⋮ Representing Interpolant Topology for Contour Tree Computation ⋮ Isocontour based Visualization of Time-varying Scalar Fields ⋮ W-Structures in Contour Trees ⋮ Distributed Task-Parallel Topology-Controlled Volume Rendering
This page was built for publication: Parallel computation of the topology of level sets
