TL;DR
This paper presents a hierarchical, progressive algorithm for scalar data topological analysis that efficiently refines results and improves runtime, suitable for interactive and batch applications.
Contribution
It introduces a hierarchical, progressive framework for topological analysis that efficiently identifies invariant vertices and accelerates computations.
Findings
Progressive algorithms provide interpretable outputs upon interruption.
The approach improves runtime performance over non-progressive methods.
Shared-memory parallelism further accelerates the analysis.
Abstract
This paper introduces progressive algorithms for the topological analysis of scalar data. Our approach is based on a hierarchical representation of the input data and the fast identification of topologically invariant vertices, which are vertices that have no impact on the topological description of the data and for which we show that no computation is required as they are introduced in the hierarchy. This enables the definition of efficient coarse-to-fine topological algorithms, which leverage fast update mechanisms for ordinary vertices and avoid computation for the topologically invariant ones. We demonstrate our approach with two examples of topological algorithms (critical point extraction and persistence diagram computation), which generate interpretable outputs upon interruption requests and which progressively refine them otherwise. Experiments on real-life datasets illustrate…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
