HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Journal articles

Splitting a Delaunay Triangulation in Linear Time

Bernard Chazelle 1 Olivier Devillers 2 Ferran Hurtado 3 Mercè Mora 3 Vera Sacristan 3 Monique Teillaud 2
1 Computer Science Department [Princeton]
2 GEOMETRICA - Geometric computing
CRISAM - Inria Sophia Antipolis - Méditerranée
3 Departament de Matemàtica Aplicada II
Abstract : Computing the Delaunay triangulation of n points requires usually a minimum of Omega(n log n) operations, but in some special cases where some additional knowledge is provided, faster algorithms can be designed. Given two sets of points, we prove that, if the Delaunay triangulation of all the points is known, the Delaunay triangulation of each set can be computed in randomized expected linear time.
Document type :
Journal articles
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download
https://hal.inria.fr/inria-00090664
Contributor : Olivier Devillers Connect in order to contact the contributor
Submitted on : Friday, September 1, 2006 - 4:02:18 PM
Last modification on : Friday, February 4, 2022 - 3:18:28 AM
Long-term archiving on: : Tuesday, April 6, 2010 - 12:44:03 AM

File

Vignette du document
algorithmica.pdf

Identifiers

Collections

INRIA | INRIA2

Citation

Bernard Chazelle, Olivier Devillers, Ferran Hurtado, Mercè Mora, Vera Sacristan, et al.. Splitting a Delaunay Triangulation in Linear Time. Algorithmica, Springer Verlag, 2002, 34 (1), pp.39--46. ⟨10.1007/s00453-002-0939-8⟩. ⟨inria-00090664⟩

Export

BibTeX TEI DC DCterms EndNote Datacite

Share

Metrics

Record views

139

Files downloads

321

Designed by Inria-IES Team : http://hal.inria.fr/    Hosted by HAL : http://hal.archives-ouvertes.fr/