Vertex Removal in Two Dimensional Delaunay Triangulation: Asymptotic Complexity is Pointless

Olivier Devillers 1
1 GEOMETRICA - Geometric computing
CRISAM - Inria Sophia Antipolis - Méditerranée , Inria Saclay - Ile de France
Abstract : The theoretical complexity of vertex removal in a Delaunay triangulation is often given in terms of the degree d of the removed point with usual results O(d), O(d log d), or O(d²). In fact the asymptotic complexity is of poor interest since d is usually quite small. In this paper we carefully design code for small degrees 3 ≤ d ≤ 7, it improves the global behavior of the removal for random points by a factor of 2.
Type de document :
Rapport
[Research Report] RR-7104, INRIA. 2009, pp.15
Liste complète des métadonnées

https://hal.inria.fr/inria-00433107
Contributeur : Olivier Devillers <>
Soumis le : mercredi 18 novembre 2009 - 11:01:00
Dernière modification le : jeudi 11 janvier 2018 - 16:25:55
Document(s) archivé(s) le : mardi 16 octobre 2012 - 14:21:17

Fichier

RR-7104.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00433107, version 1

Collections

Citation

Olivier Devillers. Vertex Removal in Two Dimensional Delaunay Triangulation: Asymptotic Complexity is Pointless. [Research Report] RR-7104, INRIA. 2009, pp.15. 〈inria-00433107〉

Partager

Métriques

Consultations de la notice

370

Téléchargements de fichiers

208