The topology toolkit
This system paper presents the Topology ToolKit (TTK), a software platform designed for the
topological analysis of scalar data in scientific visualization. While topological data analysis …
topological analysis of scalar data in scientific visualization. While topological data analysis …
A survey of topology‐based methods in visualization
This paper presents the state of the art in the area of topology‐based visualization. It
describes the process and results of an extensive annotation for generating a definition and …
describes the process and results of an extensive annotation for generating a definition and …
Topology-based individual tree segmentation for automated processing of terrestrial laser scanning point clouds
Terrestrial laser scanning (TLS) is a ground-based approach to rapidly acquire 3D point
clouds via Light Detection and Ranging (LiDAR) technologies. Quantifying tree-scale …
clouds via Light Detection and Ranging (LiDAR) technologies. Quantifying tree-scale …
Progressive wasserstein barycenters of persistence diagrams
This paper presents an efficient algorithm for the progressive approximation of Wasserstein
barycenters of persistence diagrams, with applications to the visual analysis of ensemble …
barycenters of persistence diagrams, with applications to the visual analysis of ensemble …
Task-based augmented merge trees with fibonacci heaps
This paper presents a new algorithm for the fast, shared memory multi-core computation of
augmented merge trees on triangulations. In contrast to most existing parallel algorithms …
augmented merge trees on triangulations. In contrast to most existing parallel algorithms …
Wasserstein distances, geodesics and barycenters of merge trees
This paper presents a unified computational framework for the estimation of distances,
geodesics and barycenters of merge trees. We extend recent work on the edit distance 104 …
geodesics and barycenters of merge trees. We extend recent work on the edit distance 104 …
Principal geodesic analysis of merge trees (and persistence diagrams)
This article presents a computational framework for the Principal Geodesic Analysis of
merge trees (MT-PGA), a novel adaptation of the celebrated Principal Component Analysis …
merge trees (MT-PGA), a novel adaptation of the celebrated Principal Component Analysis …
Lifted Wasserstein matcher for fast and robust topology tracking
M Soler, M Plainchault, B Conche… - 2018 IEEE 8th …, 2018 - ieeexplore.ieee.org
This paper presents a robust and efficient method for tracking topological features in time-
varying scalar data. Structures are tracked based on the optimal matching between …
varying scalar data. Structures are tracked based on the optimal matching between …
Contour forests: Fast multi-threaded augmented contour trees
This paper presents a new algorithm for the fast, shared memory multi-threaded computation
of contour trees on tetrahedral meshes. In contrast to previous multi-threaded algorithms, our …
of contour trees on tetrahedral meshes. In contrast to previous multi-threaded algorithms, our …
Discrete morse sandwich: Fast computation of persistence diagrams for scalar data–an algorithm and a benchmark
P Guillou, J Vidal, J Tierny - IEEE Transactions on Visualization …, 2023 - ieeexplore.ieee.org
This paper introduces an efficient algorithm for persistence diagram computation, given an
input piecewise linear scalar field defined on a-dimensional simplicial complex, with. Our …
input piecewise linear scalar field defined on a-dimensional simplicial complex, with. Our …