Passer à la navigation principale Passer à la recherche Passer au contenu principal

Geodesic delaunay triangulation and witness complex in the plane

  • Stony Brook University
  • Stanford University

Résultats de recherche: Le chapitre dans un livre, un rapport, une anthologie ou une collectionContribution à une conférenceRevue par des pairs

Résumé

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.

langue originaleAnglais
titreProceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms
Pages571-580
Nombre de pages10
étatPublié - 1 déc. 2008
Modification externeOui
Evénement19th Annual ACM-SIAM Symposium on Discrete Algorithms - San Francisco, CA, États-Unis
Durée: 20 janv. 200822 janv. 2008

Série de publications

NomProceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Une conférence

Une conférence19th Annual ACM-SIAM Symposium on Discrete Algorithms
Pays/TerritoireÉtats-Unis
La villeSan Francisco, CA
période20/01/0822/01/08

Empreinte digitale

Examiner les sujets de recherche de « Geodesic delaunay triangulation and witness complex in the plane ». Ensemble, ils forment une empreinte digitale unique.

Contient cette citation