Output-sensitive construction of the Delaunay triangulation of points lying in two planes - Archive ouverte HAL Access content directly
Journal Articles International Journal of Computational Geometry and Applications Year : 1996

Output-sensitive construction of the Delaunay triangulation of points lying in two planes

(1) , (1, 2) , (1) , (1)
1
2

Abstract

In this paper, we propose an algorithm to compute the Delaunay triangulation of a set of n points in 3-dimensional space when the points lie in 2 planes. The algorithm is output-sensitive and optimal with respect to the input and the output sizes. Its time complexity is O(n log n+t), where t is the size of the output, and the extra storage is O(n).
Fichier principal
Vignette du fichier
hal.pdf (846.91 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00795075 , version 1 (07-08-2019)

Identifiers

Cite

Jean-Daniel Boissonnat, André Cerezo, Olivier Devillers, Monique Teillaud. Output-sensitive construction of the Delaunay triangulation of points lying in two planes. International Journal of Computational Geometry and Applications, 1996, 6 (1), pp.1-14. ⟨10.1142/S0218195996000022⟩. ⟨hal-00795075⟩
111 View
98 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More