Vertex Removal in Two Dimensional Delaunay Triangulation: Asymptotic Complexity is Pointless - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2009

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

Olivier Devillers

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.
Fichier principal
Vignette du fichier
RR-7104.pdf (491.69 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00433107 , version 1 (18-11-2009)

Identifiers

  • HAL Id : inria-00433107 , version 1

Cite

Olivier Devillers. Vertex Removal in Two Dimensional Delaunay Triangulation: Asymptotic Complexity is Pointless. [Research Report] RR-7104, INRIA. 2009, pp.15. ⟨inria-00433107⟩
366 View
213 Download

Share

Gmail Facebook X LinkedIn More