Abstract
Let P be a set of n points in \({\mathbb R}^2\), and let \(\mathop {{\mathrm {DT}}}(P)\) denote its Euclidean Delaunay triangulation. We introduce the notion of the stability of edges of \(\mathop {{\mathrm {DT}}}(P)\). Specifically, defined in terms of a parameter \(\alpha >0\), a Delaunay edge pq is called \(\alpha \)-stable, if the (equal) angles at which p and q see the corresponding Voronoi edge \(e_{pq}\) are at least \(\alpha \). A subgraph G of \(\mathop {{\mathrm {DT}}}(P)\) is called a \((c\alpha , \alpha )\) -stable Delaunay graph (\(\mathop {{\mathrm {SDG}}}\) in short), for some absolute constant \(c \ge 1\), if every edge in G is \(\alpha \)-stable and every \(c\alpha \)-stable edge of \(\mathop {{\mathrm {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 \(\alpha \), 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\alpha \)-stable edge in \(\mathop {{\mathrm {DT}}}(P)\) is \(\alpha \)-stable in the Delaunay triangulation under the distance function induced by a regular k-gon for \(k \ge 2\pi /\alpha \), 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\alpha ,\alpha )\)-\(\mathop {{\mathrm {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(\log n)\) time. We also show that several useful properties of \(\mathop {{\mathrm {DT}}}(P)\) are retained by any SDG of P (although some other properties are not).
Similar content being viewed by others
Notes
This argument also covers the cases when a point r crosses \(\ell \) from side to side: Since each point, on either side of \(\ell \), sees pq at an angle of \(\le \pi -\alpha \), it follows that no point can cross pq itself – the angle has to increase from \(\pi -\alpha \) to \(\pi \). Any other crossing of \(\ell \) by a point r causes \(\angle prq\) to decrease to 0, and even if it increases to \(\alpha /2\) on the other side of \(\ell \), pq is still an edge of \(\mathop {{\mathrm {DT}}}\), as is easily checked.
The Hausdorff distance between Q and \(D_O\) is at most \(1-\cos \alpha \approx \alpha ^2/2\).
As is easy to check, the one-dimensional portion \(\tilde{e}_{pq}^Q\) of \(e^Q_{pq}\) varies continuously (in Hausdorff sense) with any sufficiently small perturbation of p and q within P. Furthermore, it is the only such portion: If a ray u[p] hits \(e^Q_{pq}\) outside \(\tilde{e}_{pq}^Q\) (i.e., within its two-dimensional portion), there is a symbolic perturbation of p and q causing u[p] to completely miss \(e_{pq}^Q\).
References
Agarwal, P.K., Eppstein, D., Guibas, L.J., Henzinger, M.R.: Parametric and kinetic minimum spanning trees. In: Proceedings of the 39th IEEE Symposium on Foundations of Computer Science, pp. 596–605 (1998)
Agarwal, P.K., Wang, Y., Yu, H.: A 2D kinetic triangulation with near-quadratic topological changes. Discrete Comput. Geom. 36, 573–592 (2006)
Agarwal, P.K., Kaplan, H., Sharir, M.: Kinetic and dynamic data structures for closest pair and all nearest neighbors. ACM Trans. Algorithms 5, 4 (2008)
Agarwal, P.K., Gao, J., Guibas, L., Kaplan, H., Koltun, V., Rubin, N., Sharir, M.: Kinetic stable Delaunay graphs. arxiv.org/abs/1104.0622 (2011)
Agarwal, P.K., Kaplan, H., Rubin, N., Sharir, M.: Kinetic Voronoi diagrams and Delaunay triangulations under polygonal distance functions. Discrete Comput. Geom. (2014). doi:10.1007/s00454-015-9729-3
Amenta, N., Bern, M.: Surface reconstruction by Voronoi filtering. Discrete Comput. Geom. 22, 481–504 (1999)
Amenta, N., Bern, M.W., Eppstein, D.: The crust and beta-skeleton: combinatorial curve reconstruction. Graph. Models Image Process. 60(2), 125–135 (1998)
Aurenhammer, F., Klein, R., Lee, D.-T.: Voronoi Diagrams and Delaunay Triangulations. World Scientific, Singapore (2013)
Basch, J., Guibas, L.J., Hershberger, J.: Data structures for mobile data. J. Algorithms 31, 1–28 (1999)
Basch, J., Guibas, L.J., Zhang, L.: Proximity problems on moving points. In: Proceedings of the 13th Annual Symposium on Computational Geometry, pp. 344–351 (1997)
Chew, L.P., Drysdale, R.L.: Voronoi diagrams based on convex distance functions. In: Proceedings of the 1st Annual Symposium on Computational Geometry, pp. 235–244 (1985)
Fu, J.-J., Lee, R.C.T.: Voronoi diagrams of moving points in the plane. Int. J. Comput. Geom. Appl. 1, 23–32 (1991)
Guibas, L.J., Mitchell, J.S.B., Roos, T.: Voronoi diagrams of moving points in the plane. In: Proceedings of the 17th International Workshop on Graph-Theoretic Concepts in Computer Science, pp. 113–125 (1992)
Kaplan, H., Rubin, N., Sharir, M.: A kinetic triangulation scheme for moving points in the plane. Comput. Geom. Theory Appl. 44, 191–205 (2011)
Kirkpatrick, D., Radke, J.D.: A framework for computational morphology. In: Toussaint, G. (ed.) Computational Geometry, pp. 217–248. North-Holland, Amsterdam (1985)
Leven, D., Sharir, M.: Planning a purely translational motion for a convex object in two-dimensional space using generalized Voronoi diagrams. Discrete Comput. Geom. 2, 9–31 (1987)
Rahmati, Z., Ali Abam, M., King, V., Whitesides, S., Zarei, A.: A simple, faster method for kinetic proximity problems. arxiv.org/abs/1311.2032 (2013)
Rubin, N.: On topological changes in the Delaunay triangulation of moving points. Discrete Comput. Geom. 49, 710–746 (2013)
Rubin, N.: On kinetic Delaunay triangulations: a near quadratic bound for unit speed motions. In: Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, pp. 519–528 (2013). (J. ACM, to appear)
Sharir, M., Agarwal, P.K.: Davenport–Schinzel Sequences and Their Geometric Applications. Cambridge University Press, New York (1995)
Acknowledgments
P.A. and M.S. were supported by Grant 2012/229 from the U.S.–Israel Binational Science Foundation. P.A. was also supported by NSF under Grants CCF-09-40671, CCF-10-12254, and CCF-11-61359, and by an ERDC contract W9132V-11-C-0003. L.G. was supported by NSF grants CCF-10-11228 and CCF-11-61480. H.K. was supported by Grant 822/10 from the Israel Science Foundation, Grant 1161/2011 from the German-Israeli Science Foundation, and by the Israeli Centers for Research Excellence (I-CORE) program (Center No. 4/11). N.R. was supported by Grants 975/06 and 338/09 from the Israel Science Fund, by Minerva Fellowship Program of the Max Planck Society, by the Fondation Sciences Mathématiques de Paris (FSMP), and by a public grant overseen by the French National Research Agency (ANR) as part of the “Investissements d’Avenir” program (reference: ANR-10-LABX-0098). M.S. was supported by NSF Grant CCF-08-30272, by Grants 338/09 and 892/13 from the Israel Science Foundation, by the Israeli Centers for Research Excellence (I-CORE) program (Center No. 4/11), and by the Hermann Minkowski–MINERVA Center for Geometry at Tel Aviv University
Author information
Authors and Affiliations
Corresponding author
Additional information
Editor in Charge: János Pach
An earlier version [4] of this paper appeared in Proceedings of the 26th Annual Symposium on Computational Geometry, 2010, 127–136.
Rights and permissions
About this article
Cite this article
Agarwal, P.K., Gao, J., Guibas, L.J. et al. Stable Delaunay Graphs. Discrete Comput Geom 54, 905–929 (2015). https://doi.org/10.1007/s00454-015-9730-x
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-015-9730-x