On Deletion in Delaunay Triangulations

1 GEOMETRICA - Geometric computing
CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : This paper presents how the space of spheres and shelling may be used to delete a point from a $d$-dimensional triangulation efficiently. In dimension two, if k is the degree of the deleted vertex, the complexity is O(k log k), but we notice that this number only applies to low cost operations, while time consuming computations are only done a linear number of times. This algorithm may be viewed as a variation of Heller's algorithm [Heller, Symp. Spatial Data Handling 1990] which is popular in the geographic information system community. Unfortunately, Heller algorithm is false, as explained in this paper.
Type de document :
Article dans une revue
International Journal of Computational Geometry and Applications, World Scientific Publishing, 2002, 12, pp.193-205. 〈10.1142/S0218195902000815〉

Littérature citée [24 références]

https://hal.inria.fr/inria-00167201
Contributeur : Olivier Devillers <>
Soumis le : jeudi 16 août 2007 - 14:30:43
Dernière modification le : mercredi 7 mars 2018 - 10:22:06
Document(s) archivé(s) le : vendredi 9 avril 2010 - 00:48:50

Fichier

hal.pdf
Fichiers produits par l'(les) auteur(s)

Citation

Olivier Devillers. On Deletion in Delaunay Triangulations. International Journal of Computational Geometry and Applications, World Scientific Publishing, 2002, 12, pp.193-205. 〈10.1142/S0218195902000815〉. 〈inria-00167201〉

Métriques

Consultations de la notice

191

Téléchargements de fichiers