A Randomized Incremental Approach for the Hausdorff Voronoi Diagram of Non-crossing Clusters

  • Panagiotis Cheilaris
  • Elena Khramtcova
  • Stefan Langerman
  • Evanthia Papadopoulou
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8392)

Abstract

In the Hausdorff Voronoi diagram of a set of point-clusters in the plane, the distance between a point t and a cluster P is measured as the maximum distance between t and any point in P, and the diagram reveals the nearest cluster to t. This diagram finds direct applications in VLSI computer-aided design. In this paper, we consider “non-crossing” clusters, for which the combinatorial complexity of the diagram is linear in the total number n of points on the convex hulls of all clusters. We present a randomized incremental construction, based on point-location, to compute the diagram in expected O(nlog2 n) time and expected O(n) space, which considerably improves previous results. Our technique efficiently handles non-standard characteristics of generalized Voronoi diagrams, such as sites of non-constant complexity, sites that are not enclosed in their Voronoi regions, and empty Voronoi regions.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abellanas, M., Hernandez, G., Klein, R., Neumann-Lara, V., Urrutia, J.: A combinatorial property of convex sets. Discrete Comput. Geom. 17(3), 307–318 (1997)CrossRefMATHMathSciNetGoogle Scholar
  2. 2.
    Abellanas, M., Hurtado, F., Icking, C., Klein, R., Langetepe, E., Ma, L., Palop, B., Sacristán, V.: The farthest color Voronoi diagram and related problems. In: 17th Eur. Workshop on Comput. Geom. (EWCG), pp. 113–116 (2001)Google Scholar
  3. 3.
    Arge, L., Brodal, G.S., Georgiadis, L.: Improved dynamic planar point location. In: 47th Ann. IEEE Symp. Found. Comput. Sci. (FOCS), pp. 305–314 (2006)Google Scholar
  4. 4.
    Aronov, B., Bose, P., Demaine, E.D., Gudmundsson, J., Iacono, J., Langerman, S., Smid, M.: Data structures for halfplane proximity queries and incremental Voronoi diagrams. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol. 3887, pp. 80–92. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  5. 5.
    Baumgarten, H., Jung, H., Mehlhorn, K.: Dynamic point location in general subdivisions. J. Algorithm 17(3), 342–380 (1994)CrossRefMATHMathSciNetGoogle Scholar
  6. 6.
    Boissonnat, J.-D., Wormser, C., Yvinec, M.: Curved Voronoi diagrams. In: Boissonnat, J.-D., Teillaud, M. (eds.) Effective Computational Geometry for Curves and Surfaces, pp. 67–116. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  7. 7.
    Cheilaris, P., Khramtcova, E., Langerman, S., Papadopoulou, E.: A randomized incremental approach for the Hausdorff Voronoi diagram of non-crossing clusters. CoRR abs/1312.3904 (2013)Google Scholar
  8. 8.
    Cheong, O., Everett, H., Glisse, M., Gudmundsson, J., Hornus, S., Lazard, S., Lee, M., Na, H.S.: Farthest-polygon Voronoi diagrams. Comput. Geom. 44(4), 234–247 (2011)CrossRefMATHMathSciNetGoogle Scholar
  9. 9.
    Clarkson, K., Shor, P.: Applications of random sampling in computational geometry, II. Discrete Comput. Geom. 4, 387–421 (1989)CrossRefMATHMathSciNetGoogle Scholar
  10. 10.
    Dehne, F., Maheshwari, A., Taylor, R.: A coarse grained parallel algorithm for Hausdorff Voronoi diagrams. In: 35th Int. Conf. on Parallel Processing (ICPP), pp. 497–504 (2006)Google Scholar
  11. 11.
    Devillers, O.: The Delaunay Hierarchy. Int. J. Found. Comput. S. 13, 163–180 (2002)CrossRefMATHMathSciNetGoogle Scholar
  12. 12.
    Edelsbrunner, H.: Computing the extreme distances between two convex polygons. J. Algorithm 6(2), 213–224 (1985)CrossRefMATHMathSciNetGoogle Scholar
  13. 13.
    Edelsbrunner, H., Guibas, L.J., Sharir, M.: The upper envelope of piecewise linear functions: algorithms and applications. Discrete Comput. Geom. 4, 311–336 (1989)CrossRefMATHMathSciNetGoogle Scholar
  14. 14.
    Huttenlocher, D.P., Kedem, K., Sharir, M.: The upper envelope of Voronoi surfaces and its applications. Discrete Comput. Geom. 9, 267–291 (1993)CrossRefMATHMathSciNetGoogle Scholar
  15. 15.
    Karavelas, M., Yvinec, M.: The Voronoi diagram of convex objects in the plane. Technical report RR-5023, INRIA (2003)Google Scholar
  16. 16.
    Klein, R.: Concrete and Abstract Voronoi Diagrams. LNCS, vol. 400. Springer, Heidelberg (1989)MATHGoogle Scholar
  17. 17.
    Klein, R., Mehlhorn, K., Meiser, S.: Randomized incremental construction of abstract Voronoi diagrams. Comput. Geom. 3(3), 157–184 (1993)CrossRefMATHMathSciNetGoogle Scholar
  18. 18.
    McAllister, M., Kirkpatrick, D., Snoeyink, J.: A compact piecewise-linear Voronoi diagram for convex sites in the plane. Discrete Comput. Geom. 15(1), 73–105 (1996)CrossRefMATHMathSciNetGoogle Scholar
  19. 19.
    Megiddo, N., Tamir, A., Zemel, E., Chandrasekaran, R.: An O(nlog2 n) algorithm for the kth longest path in a tree with applications to location problems. SIAM J. Comput. 10(2), 328–337 (1981)CrossRefMATHMathSciNetGoogle Scholar
  20. 20.
    Papadopoulou, E.: The Hausdorff Voronoi diagram of point clusters in the plane. Algorithmica 40(2), 63–82 (2004)CrossRefMATHMathSciNetGoogle Scholar
  21. 21.
    Papadopoulou, E.: Net-aware critical area extraction for opens in VLSI circuits via higher-order Voronoi diagrams. IEEE T. Comput. Aid D. 30(5), 704–716 (2011)CrossRefGoogle Scholar
  22. 22.
    Papadopoulou, E., Lee, D.T.: The Hausdorff Voronoi diagram of polygonal objects: a divide and conquer approach. Int. J. Comput. Geom. Ap. 14(6), 421–452 (2004)CrossRefMATHMathSciNetGoogle Scholar
  23. 23.
    Papadopoulou, E., Xu, J.: The L  ∞  Hausdorff Voronoi diagram revisited. In: 8th Int. Symp. on Voronoi Diagr. in Sci. and Eng. (ISVD), pp. 67–74 (2011)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • Panagiotis Cheilaris
    • 1
  • Elena Khramtcova
    • 1
  • Stefan Langerman
    • 2
  • Evanthia Papadopoulou
    • 1
  1. 1.Faculty of InformaticsUniversità della Svizzera italianaLuganoSwitzerland
  2. 2.Départment d’InformatiqueUniversité Libre de BruxellesBrusselsBelgium

Personalised recommendations