Approximating the Pathway Axis and the Persistence Diagrams for a Collection of Balls in 3-Space

  title={Approximating the Pathway Axis and the Persistence Diagrams for a Collection of Balls in 3-Space},
  author={Eitan Yaffe and Dan Halperin},
  journal={Discrete \& Computational Geometry},
AbstractGiven a collection ℬ of balls in a three-dimensional space, we wish to explore the cavities, voids, and tunnels in the complement space of ∪ℬ. We introduce the pathway axis of ℬ as a useful subset of the medial axis of the complement of ∪ℬ and prove that it satisfies several desirable geometric properties. We present an algorithm that constructs the pathway graph of ∪ℬ, a piecewise-linear approximation of the pathway axis. At the heart of our approach is an approximation scheme that… 
Exploration of Empty Space among Spherical Obstacles via Additively Weighted Voronoi Diagram
A method is proposed to overcome the problem of topological properties of the empty space outside all these balls changing in size by a constant speed by using the additively weighted Voronoi diagram instead of the ordinary diagram.
Tunnels and Voids in Molecules via Voronoi Diagrams and Beta-Complexes
Algorithms to ex- tract tunnels and voids from molecular structures based on the Voronoi diagram of atoms in molecules are presented, which are mathe- matically correct, computationally efficient, numerically robust, and easy to implement.
Tunnels and Voids in Molecules via Voronoi Diagram
  • Deok-Soo Kim, K. Sugihara
  • Chemistry
    2012 Ninth International Symposium on Voronoi Diagrams in Science and Engineering
  • 2012
This paper presents an algorithm to extract tunnels and voids from molecular structures based on the Voronoi diagram of atoms in molecules and its time complexity is O(m) time in the worst case.


Approximating the pathway axis and the persistence diagram of a collection of balls in 3-space
The pathway diagram is introduced as a useful subset of the Voronoi diagram of the centers of the unit balls in <i>K</i><sub>ε</sub>, which can be easily and efficiently computed and shows that the pathway diagram contains an approximation of the pathway axis of β.
Provably good sampling and meshing of surfaces
Towards persistence-based reconstruction in euclidean spaces
A novel approach that stands in-between classical reconstruction and topological estimation, and whose complexity scales up with the intrinsic dimension of the data is introduced.
The Theory of Multidimensional Persistence
This paper proposes the rank invariant, a discrete invariant for the robust estimation of Betti numbers in a multifiltration, and proves its completeness in one dimension.
Three-dimensional alpha shapes
This article introduces the formal notion of the family of α-shapes of a finite point set in R, a well-defined polytope, derived from the Delaunay triangulation of the point set, with a parameter α ε R controlling the desired level of detail.
Weak feature size and persistent homology: computing homology of solids in Rn from noisy data samples
It is proved that under quite general assumptions one can deduce the topology of a bounded open set in Rn from a Hausdorff distance approximation of it and the weak feature size (wfs) is introduced that generalizes the notion of local feature size.
A Linear Bound on the Complexity of the Delaunay Triangulation of Points on Polyhedral Surfaces
It is shown that the complexity of the Delaunay triangulation of points in R3 may be quadratic in the worst case, but it is only linear when the points are distributed on a fixed set of well-sampled facets of R3.
Stability and homotopy of a subset of the medial axis
The "Lambda-Medial Axis" of O is introduced, a subset of the Medial Axis of O which captures the Homotopy type of O when λ < wfs, and it is shown that, at least for some "regular" values of λ, M<inf>λ</inf> remains stable under Hausdorff distance perturbations.
Any open bounded subset of Rn has the same homotopy type as its medial axis
The power crust
A careful design of a key subroutine which labels parts of the MAT as inside or outside of the object, easy in theory but non-trivial in practice is described, which leads to a simple algorithm with theoretical guarantees comparable to those of other surface reconstruction and medial axis approximation algorithms.