A probabilistic approach to reducing the algebraic complexity of computing Delaunay triangulations

Jean-Daniel Boissonnat 1 Ramsay Dyer 2 Arijit Ghosh 3
1 GEOMETRICA - Geometric computing
CRISAM - Inria Sophia Antipolis - Méditerranée , Inria Saclay - Ile de France
3 Algorithms and Complexity
MPII - Max Planck Institut für Informatik
Abstract : Computing Delaunay triangulations in Rd involves evaluating the so-called in\_sphere predicate that determines if a point x lies inside, on or outside the sphere circumscribing d+1 points p0,...,pd. This predicate reduces to evaluating the sign of a multivariate polynomial of degree d+2in the coordinates of the points x, p0,... pd. Despite much progress on exact geometric computing, the fact that the degree of the polynomial increases with d makes the evaluation of the sign of such a polynomial problematic except in very low dimensions. In this paper, we propose a new approach that is based on the witness complex, a weak form of the Delaunay complex introduced by Carlsson and de Silva. The witness complex wit (L,W) is defined from two sets L and W in some metric space X: a finite set of points L on which the complex is built, and a set W of witnesses that serves as an approximation of X. A fundamental result of de Silva states that wit (L,W)= del (L) if W=X=Rd. In this paper, we give conditions on L that ensure that the witness complex and the Delaunay triangulation coincide when W is a finite set, and we introduce a new perturbation scheme to compute a perturbed set L' close to L such that del (L')= wit (L', W). Our perturbation algorithm is a geometric application of the Moser-Tardos constructive proof of the Lovàsz local lemma. The only numerical operations we use are (squared) distance comparisons (i.e., predicates of degree 2). The time-complexity of the algorithm is sublinear in |W|. Interestingly, although the algorithm does not compute any measure of simplex quality, a lower bound on the thickness of the output simplices can be guaranteed.
Type de document :
Pré-publication, Document de travail
2015
Liste complète des métadonnées

https://hal.inria.fr/hal-01153979
Contributeur : Jean-Daniel Boissonnat <>
Soumis le : mercredi 20 mai 2015 - 18:49:48
Dernière modification le : mardi 10 octobre 2017 - 13:44:41
Document(s) archivé(s) le : jeudi 20 avril 2017 - 05:51:19

Identifiants

  • HAL Id : hal-01153979, version 1

Collections

Citation

Jean-Daniel Boissonnat, Ramsay Dyer, Arijit Ghosh. A probabilistic approach to reducing the algebraic complexity of computing Delaunay triangulations. 2015. 〈hal-01153979〉

Partager

Métriques

Consultations de
la notice

227

Téléchargements du document

89