Stable Delaunay Graphs

作者：Agarwal Pankaj K^*; Gao Jie; Guibas Leonidas J; Kaplan Haim; Rubin Natan; Sharir Micha

来源：Discrete & Computational Geometry, 2015, 54(4): 905-929.

DOI：10.1007/s00454-015-9730-x

• Delaunay triangulation
• Voronoi diagram
• Moving points
• Kinetic data structure
• Bisector
• Convex distance function

Let P be a set of n points in , and let denote its Euclidean Delaunay triangulation. We introduce the notion of the stability of edges of . Specifically, defined in terms of a parameter , a Delaunay edge pq is called -stable, if the (equal) angles at which p and q see the corresponding Voronoi edge are at least . A subgraph G of is called a -stable Delaunay graph ( in short), for some absolute constant , if every edge in G is -stable and every -stable edge of 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 -stable edge in is -stable in the Delaunay triangulation under the distance function induced by a regular k-gon for , 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 - 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 time. We also show that several useful properties of are retained by any SDG of P (although some other properties are not).

• 出版日期2015-12