Abstract
We show that the abstract Voronoi diagram ofn sites in the plane can be constructed in timeO(n logn) by a randomized algorithm. This yields an alternative, but simpler,O(n logn) algorithm in many previously considered cases and the firstO(n logn) algorithm in some cases, e.g., disjoint convex sites with the Euclidean distance function. Abstract Voronoi diagrams are given by a family of bisecting curves and were recently introduced by Klein [13]. Our algorithm is based on Clarkson and Shor's randomized incremental construction technique [7].
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Aurenhammer, F., Power diagrams: properties, algorithms and applications,SIAM J. Comput. 16 (1987), 78–96.
Aurenhammer, F., Improved algorithms for discs and balls using power diagrams,J. Algorithms 9 (1988), 151–161.
Aurenhammer, F., Voronoi Diagrams—A Survey, Technical Report 263, Institutes for Information Processing, Craz Technical University (1988).
Aurenhammer, F., and Edelsbrunner, H., An optimal algorithm for constructing the weighted Voronoi diagram in the plane,Pattern Recognition 17 (2) (1984), 251–257.
Brown, K. Q., Voronoi diagrams from convex hulls,IPL 9 (1979), 223–228.
Chew, L. P., and Drysdale III, R. L., Voronoi diagrams based on convex distance functions,Proc. Ist ACM Symp. on Computational Geometry (1985), pp. 235–244.
Clarkson, K. L., and Shor, P. W., Applications of random sampling in computational geometry, II,Discrete Comput. Geom.,4 (1989), 387–421.
Edelsbrunner, H. and Seidel, R., voronoi diagrams and arrangements,Discrete Comput. Geom. 1 (1986), 25–44.
Fortune, S., A fast algorithm for polygon containment by translation (extended abstract),Proc. 12th Int. Colloq. on Automata, Languages, and Programming (1985), Lecture Notes in Computer Science, Vol. 194, Springer-Verlag, Berlin, pp. 189–198.
Fortune, S., A sweepline algorithm for Voronoi diagrams,Algorithmica 2 (1987), 153–174.
Imai, H., Iri, M., and Murota, K., Voronoi diagram in the Laguerre geometry and its applications,SiAM J. Comput. 14 (1985), 93–105.
Kirkpatrik, D. G., Efficient computation of continuous skeletons,Proc. 20th IEEE Symp. on Foundations of Computer Science (1979), pp. 18–27.
Klein, R., Abstract Voronoi diagrams and their applications (extended abstract), in: H. Noltemeier (ed.),Proc. Computational Geometry and its Applications (CG'88), Würzburg (1988), Lecture Notes in Computer Science, Vol. 333, Springer-Verlag, Berlin, pp. 148–157.
Klein, R. Voronoi diagrams in the Moscow metric (extended abstract), in: J. van Leeuwen (ed.),Proc. Graphtheoretic Concepts in Computer Science (WG'88), Amsterdam (1988), Lecture Notes in Computer Science, Vol. 344, Springer-Verlag, Berlin, pp. 434–441.
Klein, R.,Concrete and Abstract Voronoi Diagrams, Lecture Notes in Computer Science, Vol. 400, Springer-Verlag, Berlin.
Klein, R., Mehlhorn, K., and Meiser, S., On the construction of abstract Voronoi diagrams, II,Proc. SIGAL Symp. on Algorithms, Tokyo (1990), Lecture Notes in Computer Science, Vol. 450, Springer-Verlag, Berlin, pp. 138–154.
Klein, R., and Wood, D., Voronoi diagrams based on general metrics in the plane, in: R. Cori and M. Wirsing (eds.),Proc. 5th Annual Symp. on Theoretical Aspects of Computer Science, (STACS), Bordeaux (1988), Lecture Notes in Computer Science, Vol. 294, Springer-Verlag, Berlin, pp. 281–291.
Lee, D. T., Two-dimensional Voronoi diagrams in theL p-metric,J. Assoc. Comput. Mach. 27 (1980), 604–618.
Leven, D., and Sharir, M., Intersection and proximity problems and Voronoi diagrams, in: J. Schwartz and C. K. Yap (eds.),Advances in Robotics, Vol. 1 (1986), Erlbaum Hillsdale, NJ, pp. 187–228.
Leven, D., and Sharir, M., Planning a purely translational motion for a convex object in two-dimensional space using generalized Voronoi diagrams,Discrete Comput. Geom. 2 (1987), 9–13.
Mitchell, J. S. B., and Papadimitriou, C. H., The weighted region problem,Proc. 3rd ACM Symp. on Computational Geometry, Waterloo (1987), pp. 30–38.
Shamos, M. I., and Hoey, D., Closest point problems,Proc. 16th IEEE Symp. on Foundations of Computer Science (1975), pp. 151–162.
Sharir, M., Intersection and closest-pair problems for a set of planar discs,SIAM J. Comput. 14 (1985), 448–468.
Author information
Authors and Affiliations
Additional information
This work was supported by the DFG, Me 620/6, and ESPRIT P3075 ALCOM. A preliminary version of this paper has been presented at STACS '90, Rouen, France.
Rights and permissions
About this article
Cite this article
Mehlhorn, K., Meiser, S. & Ó'Dúnlaing, C. On the construction of abstract voronoi diagrams. Discrete Comput Geom 6, 211–224 (1991). https://doi.org/10.1007/BF02574686
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF02574686