Vertex Deletion for 3D Delaunay Triangulations - Archive ouverte HAL Access content directly
Conference Papers 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).

Domains

Computer Science [cs] Computational Geometry [cs.CG]
Fichier principal
Vignette du fichier
main.pdf (392.84 Ko) Télécharger le fichier
Vignette du fichier
vignette.jpg (10.62 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Format : Figure, Image

Olivier Devillers  : Connect in order to contact the contributor

https://hal.inria.fr/hal-00832992

Submitted on : Tuesday, June 11, 2013-4:57:01 PM

Last modification on : Tuesday, November 29, 2022-12:12:15 PM

Long-term archiving on: Tuesday, April 4, 2017-7:24:18 PM

Download

Dates and versions

hal-00832992 , version 1 (11-06-2013)

Identifiers

Cite

Kevin Buchin, Olivier Devillers, Wolfgang Mulzer, Okke Schrijvers, Jonathan Shewchuk. Vertex Deletion for 3D Delaunay Triangulations. Proceedings of the 21st European Symposium on Algorithms, 2013, Sophia Antipolis, France. pp.253-264, ⟨10.1007/978-3-642-40450-4_22⟩. ⟨hal-00832992⟩

Export

BibTeX TEI Dublin Core DC Terms EndNote Datacite

Collections

INRIA IRISA INRIA2 UR1-MATH-STIC UR1-UFR-ISTIC UR1-MATH-NUM
290 View
361 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More