Geodesic Delaunay Triangulations in Bounded Planar Domains

被引:7
作者
Oudot, Steve Y.
Guibas, Leonidas J. [1 ]
Gao, Jie [2 ]
Wang, Yue [2 ]
机构
[1] Stanford Univ, Dept Comp Sci, Stanford, CA 94305 USA
[2] SUNY Stony Brook, Stony Brook, NY 11794 USA
关键词
Alexandrov space; Delaunay triangulation; feature size; intrinsic metric; systole; witness complex; SURFACE RECONSTRUCTION;
D O I
10.1145/1824777.1824787
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We introduce a new feature size for bounded domains in the plane endowed with an intrinsic metric. Given a point x in a domain X, the systolic feature size of X at x measures half the length of the shortest loop through x that is not null-homotopic in X. The resort to an intrinsic metric makes the systolic feature size rather insensitive to the local geometry of the domain, in contrast with its predecessors (local feature size, weak feature size, homology feature size). This reduces the number of samples required to capture the topology of X, provided that a reliable approximation to the intrinsic metric of X is available. Under sufficient sampling conditions involving the systolic feature size, we show that the geodesic Delaunay triangulation D-X(L) of a finite sampling L is homotopy equivalent to X. Under similar conditions, D-X(L) is sandwiched between the geodesic witness complex C-X(W)(L) and a relaxed version C-X,v(W)(L). In the conference version of the article, we took advantage of this fact and proved that the homology of D-X(L) (and hence the one of X) can be retrieved by computing the persistent homology between C-X(W)(L) and C-X,v(W)(L). Here, we investigate further and show that the homology of X can also be recovered from the persistent homology associated with inclusions of type C-X,v(W)(L) -> C-X,v'(W)(L), under some conditions on the parameters v <= v'. Similar results are obtained for Vietoris-Rips complexes in the intrinsic metric. The proofs draw some connections with recent advances on the front of homology inference from point cloud data, but also with several well-known concepts of Riemannian (and even metric) geometry. On the algorithmic front, we propose algorithms for estimating the systolic feature size of a bounded planar domain X, selecting a landmark set of sufficient density, and computing the homology of X using geodesic witness complexes or Rips complexes.
引用
收藏
页数:47
相关论文
共 39 条
[1]   The crust and the β-skeleton:: Combinatorial curve reconstruction [J].
Amenta, N ;
Bern, M ;
Eppstein, D .
GRAPHICAL MODELS AND IMAGE PROCESSING, 1998, 60 (02) :125-135
[2]   Surface reconstruction by Voronoi filtering [J].
Amenta, N ;
Bern, M .
DISCRETE & COMPUTATIONAL GEOMETRY, 1999, 22 (04) :481-504
[3]  
[Anonymous], 1996, Classics in mathematics
[4]  
[Anonymous], 2001, ALGEBRAIC TOPOLOGY
[5]  
Attali D., 2007, P ACM S SOL PHYS MOD, P143
[6]  
Axelsson A, 2004, TRENDS MATH, P3
[7]   A discrete Laplace-Beltrami operator for simplicial surfaces [J].
Bobenko, Alexander I. ;
Springborn, Boris A. .
DISCRETE & COMPUTATIONAL GEOMETRY, 2007, 38 (04) :740-756
[8]  
Boissonnat J.-D., 2006, Proceedings of the Twenty-Second Annual Symposium on Computational Geometry (SCG'06), P337, DOI 10.1145/1137856.1137906
[9]  
Boissonnat J.-D., 2007, SCG 07, P194
[10]  
Borsuk K., 1948, Fundamenta Mathematicae, V35, P217