Skip to main navigation Skip to search Skip to main content

Geodesic delaunay triangulation and witness complex in the plane

  • Stony Brook University
  • Stanford University

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We introduce a novel feature size for bounded planar domains endowed with an intrinsic metric. Given a point × in such a domain X, the homotopy feature size of X at x, or hfs(x) for short, measures half the length of the shortest loop through × that is not null-homotopic in X. The resort to an intrinsic metric makes hfs(x) rather insensitive to the local geometry of X, in contrast with its predecessors (local feature size, weak feature size, homology feature size). This leads to a reduced number of samples that still capture the topology of X. Under reasonable sampling conditions involving hfs, we show that the geodesic Delaunay triangulation Dx(L) of a finite sampling L of X is homotopy equivalent to X. Moreover, Dx(L) is sandwiched between the geodesic witness complex C W X(L) and a relaxed version C W X,v(L), defined by a parameter v. Taking advantage of this fact, we prove that the homology of D x(L) (and hence of X) can be retrieved by computing the persistent homology between C W X(L) and C W X,v (L). We propose algorithms for estimating hfs, selecting a landmark set of sufficient density, building its geodesic Delaunay triangulation, and computing the homology of X using C W X(L) and C W X,v(L). We also present some simulation results in the context of sensor networks that corroborate our theoretical statements.

Original languageEnglish
Title of host publicationProceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms
Pages571-580
Number of pages10
Publication statusPublished - 1 Dec 2008
Externally publishedYes
Event19th Annual ACM-SIAM Symposium on Discrete Algorithms - San Francisco, CA, United States
Duration: 20 Jan 200822 Jan 2008

Publication series

NameProceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Conference

Conference19th Annual ACM-SIAM Symposium on Discrete Algorithms
Country/TerritoryUnited States
CitySan Francisco, CA
Period20/01/0822/01/08

Fingerprint

Dive into the research topics of 'Geodesic delaunay triangulation and witness complex in the plane'. Together they form a unique fingerprint.

Cite this