MS-COOT: Comparing Morse-Smale Complexes with Co-Optimal Transport
Not on the map. Why?
Abstract (arXiv)
Understanding and comparing structures in scalar fields is a central challenge in scientific visualization, with applications ranging from feature analysis to temporal and structural comparison. The Morse-Smale (MS) complex provides a natural representation by decomposing a scalar field into regions induced by gradient flow. However, existing approaches typically rely on graph-based representations, capturing relationships between critical points while discarding region-level structure. In this work, we represent the MS complex as a hypergraph, where critical points form nodes and regions define hyperedges. We introduce MS-COOT, a co-optimal transport distance that jointly computes correspondences between critical points and regions. This formulation enables explicit region-to-region matching within a distance-based framework, allowing identification of region-level events such as splitting and merging. We instantiate this framework with domain-specific components, including a hypernetwork function encoding critical point-region relationships, persistence-based probability measures that emphasize topologically significant features, and a sample cost term that incorporates critical point attributes. We evaluate MS-COOT on five datasets spanning 2D simulations, 3D surface meshes, and volumetric data. Our results show that MS-COOT captures region-level structural changes that are not reflected by graph-based distances, while achieving strong performance in downstream tasks such as classification and resolution discrimination.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 23 of its 57 references that are in the map. First posted on arXiv 6 Jun 2026.
Builds on
23 of 57 references.
References · 23
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
- 2015Persistence Images: A Stable Vector Representation of Persistent Homologycited by 236
- 2018Optimal Transport for structured data with application on graphscited by 172
- 2019Sliced Gromov-Wassersteincited by 66
- 2020CO-Optimal Transportcited by 42
- 2018The Topology ToolKitcited by 39
- 2021Wasserstein Distances, Geodesics and Barycenters of Merge Treescited by 16
- 2021Scalar Field Comparison with Topological Descriptors: Properties and Applications for Scientific Visualizationcited by 14
- 2021Hypergraph Co-Optimal Transport: Metric and Categorical Propertiescited by 10
- 2018Lifted Wasserstein Matcher for Fast and Robust Topology Trackingcited by 9
- 2022Edit Distance between Merge Treescited by 8
- 2022Unbalanced CO-Optimal Transportcited by 6
11 more
- 2019Intrinsic Interleaving Distance for Merge Treescited by 5
- 2021Geometry-Aware Merge Tree Comparisons for Time-Varying Data with Interleaving Distancescited by 4
- 2022Branch Decomposition-Independent Edit Distances for Merge Treescited by 4
- 2023Flexible and Probabilistic Topology Tracking with Partial Optimal Transportcited by 4
- 2025A Stable and Theoretically Grounded Gromov-Wasserstein Distance for Reeb Graph Comparison using Persistence Imagescited by 4
- 2024Efficient approximation of Earth Mover's Distance Based on Nearest Neighbor Searchcited by 3
- 2025Tracking Low-Level Cloud Systems with Topologycited by 3
- 2024Rapid and Precise Topological Comparison with Merge Tree Neural Networkscited by 2
- 2025A Comparative Study of Different Edit Distance-Based Methods for Feature Tracking using Merge Trees on Time-Varying Scalar Fieldscited by 2
- 2023Comparing Morse Complexes Using Optimal Transport: An Experimental Studycited by 1
- 2024Fast Comparative Analysis of Merge Trees Using Locality Sensitive Hashingcited by 1
Built on by
Not cited yet.