Vertex Deletion for 3D Delaunay Triangulations
Résumé
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).
Domaines
Géométrie algorithmique [cs.CG]
Fichier principal
poster.pdf (808.58 Ko)
Télécharger le fichier
vignette.jpeg (1.69 Ko)
Télécharger le fichier
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
| Format | Figure, Image |
|---|