Affiliation:
1. INRIA, B.P. 93, 06902 Sophia-Antipolis cedex, France
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,1,2 which is popular in the geographic information system community. Unfortunately, Heller algorithm is false, as explained in this paper.
Publisher
World Scientific Pub Co Pte Lt
Subject
Applied Mathematics,Computational Mathematics,Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献