Randomized incremental construction of Delaunay triangulations of nice point sets - Archive ouverte HAL Access content directly
Journal Articles Discrete and Computational Geometry Year : 2020

## Randomized incremental construction of Delaunay triangulations of nice point sets

(1) , (2, 3) , (1) , (1)
1
2
3
Jean-Daniel Boissonnat
• Function : Author
Olivier Devillers
Kunal Dutta
• Function : Author
Marc Glisse

#### Abstract

Randomized incremental construction (RIC) is one of the most important paradigms for building geometric data structures. Clarkson and Shor developed a general theory that led to numerous algorithms that are both simple and efficient in theory and in practice. Randomized incremental constructions are usually space-optimal and time-optimal in the worst-case, as exemplified by the construction of convex hulls, Delaunay triangulations and arrangements of line segments. However, the worst-case scenario occurs rarely in practice and we would like to understand how RIC behaves when the input is nice in the sense that the associated output is significantly smaller than in the worst-case. For example, it is known that the Delaunay triangulations of nicely distributed points in ${\mathbb E}^d$ or on polyhedral surfaces in ${\mathbb E}^3$ has linear complexity, as opposed to a worst-case complexity of $\Theta(n^{\lfloor d/2\rfloor})$ in the first case and quadratic in the second. The standard analysis does not provide accurate bounds on the complexity of such cases and we aim at establishing such bounds in this paper. More precisely, we will show that, in the two cases above and variants of them, the complexity of the usual RIC is $O(n\log n)$, which is optimal. In other words, without any modification, RIC nicely adapts to good cases of practical value. At the heart of our proof is a bound on the complexity of the Delaunay triangulation of random subsets of $\varepsilon$-nets. Along the way, we prove a probabilistic lemma for sampling without replacement, which may be of independent interest.

### Dates and versions

hal-02937624 , version 1 (14-09-2020)

### Identifiers

• HAL Id : hal-02937624 , version 1
• DOI :

### Cite

Jean-Daniel Boissonnat, Olivier Devillers, Kunal Dutta, Marc Glisse. Randomized incremental construction of Delaunay triangulations of nice point sets. Discrete and Computational Geometry, 2020, 64, pp.33. ⟨10.1007/s00454-020-00235-7⟩. ⟨hal-02937624⟩

### Export

BibTeX TEI Dublin Core DC Terms EndNote Datacite

91 View