Advertisement

Largest Empty Square Queries in Rectilinear Polygons

  • Michael GesterEmail author
  • Nicolai Hähnle
  • Jan Schneider
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9155)

Abstract

Given a rectilinear polygon P and a point \(p \in P\), what is a largest axis-parallel square in P that contains p? This question arises in VLSI design from physical limitations of manufacturing processes. Related problems with disks instead of squares and point sets instead of polygons have been studied previously.

We present an efficient algorithm to preprocess P in time O(n) for simple polygons or \(O(n \log n)\) if holes are allowed. The resulting data structure of size O(n) can be used to answer largest square queries for any point in P in time \(O(\log n)\). Given a set of points Q instead of a rectilinear polygon, the same algorithm can be used to find a largest square containing a given query point but not containing any point in Q in its interior.

Keywords

Voronoi diagram Computational geometry Rectilinear polygon VLSI design 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ahn, H.-K., Bae, S.W., Knauer, C., Lee, M., Shin, C.-S., Vigneron, A.: Realistic roofs over a rectilinear polygon. Computational Geometry: Theory and Applications 46(9), 1042–1055 (2013)zbMATHMathSciNetCrossRefGoogle Scholar
  2. 2.
    Aichholzer, O., Aurenhammer, F., Alberts, D., Gärtner, B.: A novel type of skeleton for polygons. Journal of Universal Computer Science 1(12), 752–761 (1995)MathSciNetGoogle Scholar
  3. 3.
    Aichholzer, O., Cheng, H., Devadoss, S.L., Hackl, T., Huber, S., Li, B., Risteski, A.: What makes a tree a straight skeleton? In: CCCG, pp. 253–258 (2012)Google Scholar
  4. 4.
    Augustine, J., Das, S., Maheshwari, A., Nandy, S.C., Roy, S., Sarvattomananda, S.: Localized geometric query problems. Computational Geometry 46(3), 340–357 (2013)zbMATHMathSciNetCrossRefGoogle Scholar
  5. 5.
    Aurenhammer, F., Klein, R., Lee, D.-T.: Voronoi Diagrams and Delaunay Triangulations. World Scientific (2013)Google Scholar
  6. 6.
    Bagheri, A., Razzazi, M.: Drawing free trees inside simple polygons using polygon skeleton. Computing and Informatics 23(3), 239–254 (2012)MathSciNetGoogle Scholar
  7. 7.
    Blum, H., et al.: A transformation for extracting new descriptors of shape. Models for the perception of speech and visual form 19(5), 362–380 (1967)Google Scholar
  8. 8.
    Boissonnat, J.-D., Czyzowicz, J., Devillers, O., Yvinec, M.: Circular separability of polygons. Algorithmica 30(1), 67–82 (2001)zbMATHMathSciNetCrossRefGoogle Scholar
  9. 9.
    Chin, F., Snoeyink, J., Wang, C.A.: Finding the medial axis of a simple polygon in linear time. Discrete & Computational Geometry 21(3), 405–420 (1999)zbMATHMathSciNetCrossRefGoogle Scholar
  10. 10.
    Duda, R., Hart, P.: Pattern classification and scene analysis (1973)Google Scholar
  11. 11.
    Dumitrescu, A., Jiang, M.: Maximal empty boxes amidst random points. In: Gupta, A., Jansen, K., Rolim, J., Servedio, R. (eds.) APPROX 2012 and RANDOM 2012. LNCS, vol. 7408, pp. 529–540. Springer, Heidelberg (2012) CrossRefGoogle Scholar
  12. 12.
    Gester, M., Müller, D., Nieberg, T., Panten, C., Schulte, C., Vygen, J.: BonnRoute: Algorithms and data structures for fast and good VLSI routing. ACM Transactions on Design Automation of Electronic Systems (TODAES) 18(2), 32:1–32:24 (2013). Preliminary version in the Proceedings of the 49th Annual Design Automation Conference, pp. 459–464CrossRefGoogle Scholar
  13. 13.
    Guibas, L., Stolfi, J.: Primitives for the manipulation of general subdivisions and the computation of Voronoi. ACM Transactions on Graphics (TOG) 4(2), 74–123 (1985)zbMATHCrossRefGoogle Scholar
  14. 14.
    Gürsoy, H.N., Patrikalakis, N.M.: An automatic coarse and fine surface mesh generation scheme based on medial axis transform: Part I algorithms. Engineering with computers 8(3), 121–137 (1992)zbMATHCrossRefGoogle Scholar
  15. 15.
    Hwang, F.K.: An \(O(n \log n)\) algorithm for rectilinear minimal spanning trees. Journal of the ACM 26(2), 177–182 (1979)zbMATHCrossRefGoogle Scholar
  16. 16.
    Kaplan, H., Mozes, S., Nussbaum, Y., Sharir, M.: Submatrix maximum queries in monge matrices and monge partial matrices, and their applications. In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, pp. 338–355. SIAM (2012)Google Scholar
  17. 17.
    Kaplan, H., Sharir, M.: Finding the maximal empty disk containing a query point. In: Proceedings of the 2012 Symposium on Computational Geometry, pp. 287–292. ACM (2012)Google Scholar
  18. 18.
    Kirkpatrick, D.: Optimal search in planar subdivisions. SIAM Journal on Computing 12(1), 28–35 (1983)zbMATHMathSciNetCrossRefGoogle Scholar
  19. 19.
    Lee, D.-T., Wong, C.K.: Voronoi diagrams in \(L_1 (L_\infty )\) metrics with 2-dimensional storage applications. SIAM Journal on Computing 9(1), 200–211 (1980)zbMATHMathSciNetCrossRefGoogle Scholar
  20. 20.
    Muller, D.E., Preparata, F.P.: Finding the intersection of two convex polyhedra. Theoretical Computer Science 7(2), 217–236 (1978)zbMATHMathSciNetCrossRefGoogle Scholar
  21. 21.
    Papadopoulou, E., Lee, D.-T.: The \(L_\infty \) Voronoi diagram of segments and VLSI applications. International Journal of Computational Geometry & Applications 11(05), 503–528 (2001)zbMATHMathSciNetCrossRefGoogle Scholar
  22. 22.
    Peschka, G.: Kotirte Ebenen und deren Anwendung. Verlag Buschak & Irrgang, Brünn (1877)Google Scholar
  23. 23.
    Rosenfeld, A.: Axial representations of shape. Computer Vision, Graphics, and Image Processing 33(2), 156–173 (1986)zbMATHMathSciNetCrossRefGoogle Scholar
  24. 24.
    Seidel, R.: The nature and meaning of perturbations in geometric computing. Discrete & Computational Geometry 19(1), 1–17 (1998)zbMATHMathSciNetCrossRefGoogle Scholar
  25. 25.
    Shamos, M.I., Hoey, D.: Closest-point problems. In: 16th Annual Symposium on Foundations of Computer Science, pp. 151–162 (1975)Google Scholar
  26. 26.
    Tanase, M., Veltkamp, R.C.: Polygon decomposition based on the straight line skeleton. In: Proceedings of the Nineteenth Annual Symposium on Computational Geometry, pp. 58–67. ACM (2003)Google Scholar
  27. 27.
    Vermeer, P.J.: Two-dimensional MAT to boundary conversion. In: Proceedings on the Second ACM Symposium on Solid Modeling and Applications, pp. 493–494. ACM (1993)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Michael Gester
    • 1
    Email author
  • Nicolai Hähnle
    • 1
  • Jan Schneider
    • 1
  1. 1.Research Institute for Discrete MathematicsUniversity of BonnBonnGermany

Personalised recommendations