Voronoi diagrams in the moscow metric

Extended abstract
  • Rolf Klein
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 344)


Most of the streets of Moscow are either radii emanating from the Kremlin, or pieces of circles around it. We show that Voronoi diagrams for n points based on this metric can be computed in optimal O(n log n) time and linear space. To this end, we prove a general theorem stating that bisectors of suitably separated point sets do not contain loops if, beside other properties, there are no holes in the circles of the underlying metric. Then the Voronoi diagrams can be computed within O(n log n) steps, using a divide-and-conquer algorithm. Our theorem not only applies to the Moscow metric but to a large class of metrics including the symmetric convex distance functions and all composite metrics obtained by assigning the L1 or the L2 metric to the regions of a planar map.


Bisector computational geometry convex distance function metric norm robotics shortest path Voronoi diagram 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Ar]
    B. Aronov, “On the geodesic Voronoi diagram of point sites in a simple polygon”, Proc. 3rd ACM Symposium on Computational Geometry, Waterloo, 1987, pages 39–49.Google Scholar
  2. [Br]
    K. Q. Brown, “Voronoi diagrams from convex hulls”, Inf. Proc. Lett. 9, pages 223–228, 1979.Google Scholar
  3. [ChDr]
    L. P. Chew and R. L. Drysdale, III, “Voronoi diagrams based on convex distance functions”, Proc. 1st ACM Symposium on Computational Geometry, Baltimore, 1985, pages 235–244.Google Scholar
  4. [DeKl]
    F. Dehne and R. Klein, “A sweepcircle algorithm for Voronoi diagrams”, presented at the Workshop on Graph-Theoretic Concepts in Computer Science (WG 87), Staffelstein, 1987. To appear in LNCS.Google Scholar
  5. [F]
    S. Fortune, “A sweepline algorithm for Voronoi diagrams”, Algorithmica 2(2), 1987, pages 153–174.Google Scholar
  6. [H]
    F. K. Hwang, “An O(n log n) algorithm for rectilinear minimal spanning trees”, JACM 26, 1979, pages 177–182.Google Scholar
  7. [KlWo]
    R. Klein and D. Wood, “Voronoi diagrams based on general metrics in the plane”, in R. Cori and M. Wirsing (eds.), Proc. 5th Annual Symposium on Theoretical Aspects of Computer Science (STACS), Bordeaux, France, 1988, LNCS, pages 281–291.Google Scholar
  8. [L]
    D. T. Lee, “Two-dimensional Voronoi diagrams in the L p metric”, JACM 27, 1980, pages 604–618.Google Scholar
  9. [LePr]
    D. T. Lee and F. P. Preparata, “Euclidean shortest paths in the presence of rectilinear barriers”, Networks 14(3), pages 393–410.Google Scholar
  10. [LeWo]
    D. T. Lee and C. K. Wong, “Voronoi diagrams in L 1 (L ) metrics with 2-dimensional storage applications”, SIAM J. COMPUT. 9, 1980, pages 200–211.Google Scholar
  11. [MiPa]
    J. S. B. Mitchell and Ch. H. Papadimitriou, “The weighted region problem”, Proc. 3rd ACM Symposium on Computational Geometry, Waterloo, 1987, pages 30–38.Google Scholar
  12. [ShHo]
    M. I. Shamos and D. Hoey, “Closest-point problems”, Proc 16th IEEE Symposium on Foundations of Computer Science, 1975, pages 151–162.Google Scholar
  13. [WiWuWo]
    P. Widmayer, Y. F. Wu, and C. K. Wong, “Distance problems in computational geometry for fixed orientations”, Proc. 1st ACM Symposium on Computational Geometry, Baltimore, 1985, pages 186–195.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Rolf Klein
    • 1
  1. 1.Institut für InformatikUniversität FreiburgFreiburgFed. Rep. of Germany

Personalised recommendations