נתן רובין

Let P be a set of n points in R², and let DT(P) denote its Euclidean Delaunay triangulation. We introduce the notion of the stability of edges of DT(P). Specifically, defined in terms of a parameter α > 0, a Delaunay edge pq is called α-stable, if the (equal) angles at which p and q see the corresponding Voronoi edge e_pq are at least α. A subgraph G of DT(P) is called a (cα, α)-stable Delaunay graph (SDG in short), for some absolute constant c ≥ 1, if every edge in G is α-stable and every cα-stable edge of DT(P) is in G. Stability can also be defined, in a similar manner, for edges of Delaunay triangulations under general convex distance functions, induced by arbitrary compact convex sets Q. We show that if an edge is stable in the Euclidean Delaunay triangulation of P, then it is also a stable edge, though for a different value of α, in the Delaunay triangulation of P under any convex distance function that is sufficiently close to the Euclidean norm, and vice-versa. In particular, a 6α-stable edge in DT(P) is α-stable in the Delaunay triangulation under the distance function induced by a regular k-gon for k ≥ 2π/α, and vice-versa. This relationship, along with the analysis in the companion paper [3], yields a linear-size kinetic data structure (KDS) for maintaining an (8α, α)-SDG as the points of P move. If the points move along algebraic trajectories of bounded degree, the KDS processes a nearly quadratic number of events during the motion, each of which can be processed in O(logn) time. We also show that several useful properties of DT(P) are retained by any SDG of P (although some other properties are not).