Vertex Deletion for 3D Delaunay Triangulations - Archive ouverte HAL Access content directly
Poster Communications Year : 2013

Vertex Deletion for 3D Delaunay Triangulations

(1) , (2) , (3) , (4) , (5)
1
2
3
4
5

Abstract

We show how to delete a vertex q from a three-dimensional Delaunay triangulation DT(S) in expected O(C(P)) time, where P is the set of vertices neighboring q in DT(S) and C(P) is an upper bound on the expected number of tetrahedra whose circumspheres enclose q that are created during the randomized incremental construction of DT(P).
Fichier principal
Vignette du fichier
poster.pdf (808.58 Ko) Télécharger le fichier
Vignette du fichier
vignette.jpeg (1.69 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Format : Figure, Image

Dates and versions

hal-00963520 , version 1 (21-03-2014)

Identifiers

  • HAL Id : hal-00963520 , version 1

Cite

Kevin Buchin, Olivier Devillers, Wolfgang Mulzer, Okke Schrijvers, Jonathan Shewchuk. Vertex Deletion for 3D Delaunay Triangulations. ACM. Symposium on Theory of Computing, 2013, Palo Alto, United States. 2013. ⟨hal-00963520⟩
105 View
138 Download

Share

Gmail Facebook Twitter LinkedIn More