On Deletion in Delaunay Triangulation
| dc.creator | Devillers, Olivier | |
| dc.date | 1999-07-16 | |
| dc.date.accessioned | 2026-07-07T03:24:14Z | |
| dc.date.available | 2026-07-07T03:24:14Z | |
| dc.description | 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, which is popular in the geographic information system community. Unfortunately, Heller algorithm is false, as explained in this paper. | |
| dc.description | 15 pages 5 figures. in Proc. 15th Annu. ACM Sympos. Comput. Geom., 181--188, 1999 | |
| dc.identifier | https://arxiv.org/abs/cs/9907023 | |
| dc.identifier | http://arxiv.org/abs/cs/9907023 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/33247 | |
| dc.subject | Computational Geometry | |
| dc.subject | F.2.2; I.3.5 | |
| dc.title | On Deletion in Delaunay Triangulation | |
| dc.type | text |