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.
Document type :
Reports
Complete list of metadatas

https://hal.inria.fr/inria-00433107
Contributor : Olivier Devillers <>
Submitted on : Wednesday, November 18, 2009 - 11:01:00 AM
Last modification on : Saturday, January 27, 2018 - 1:31:01 AM
Long-term archiving on : Tuesday, October 16, 2012 - 2:21:17 PM

File

RR-7104.pdf
Files produced by the author(s)

Identifiers

  • 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⟩

Share

Metrics

Record views

477

Files downloads

252