Advertisement

Reconstructing Generalized Staircase Polygons with Uniform Step Length

  • Nodari Sitchinava
  • Darren Strash
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10692)

Abstract

Visibility graph reconstruction, which asks us to construct a polygon that has a given visibility graph, is a fundamental problem with unknown complexity (although visibility graph recognition is known to be in PSPACE). We show that two classes of uniform step length polygons can be reconstructed efficiently by finding and removing rectangles formed between consecutive convex boundary vertices called tabs. In particular, we give an \(O(n^2m)\)-time reconstruction algorithm for orthogonally convex polygons, where n and m are the number of vertices and edges in the visibility graph, respectively. We further show that reconstructing a monotone chain of staircases (a histogram) is fixed-parameter tractable, when parameterized on the number of tabs, and polynomially solvable in time \(O(n^2m)\) under reasonable alignment restrictions.

Keywords

Visibility graphs Polygon reconstruction Visibility graph recognition Orthogonal polygons Fixed-parameter tractability 

References

  1. 1.
    Abello, J., Eğecioğlu, Ö.: Visibility graphs of staircase polygons with uniform step length. Int. J. Comput. Geom. Ap. 03(01), 27–37 (1993)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Abello, J., Eğecioğlu, Ö., Kumar, K.: Visibility graphs of staircase polygons and the weak Bruhat order, I: from visibility graphs to maximal chains. Discrete Comput. Geom. 14(3), 331–358 (1995)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Abello, J., Kumar, K.: Visibility graphs of 2-spiral polygons (Extended abstract). In: Baeza-Yates, R., Goles, E., Poblete, P.V. (eds.) LATIN 1995. LNCS, vol. 911, pp. 1–15. Springer, Heidelberg (1995).  https://doi.org/10.1007/3-540-59175-3_77 CrossRefGoogle Scholar
  4. 4.
    Abello, J., Kumar, K.: Visibility graphs and oriented matroids. Discrete Comput. Geom. 28(4), 449–465 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Asano, T., Ghosh, S.K., Shermer, T.C.: Visibility in the plane. In: Urrutia, J.-R.S.J. (ed.) Handbook of Computational Geometry, pp. 829–876. North-Holland, Amsterdam (2000). Chap. 19CrossRefGoogle Scholar
  6. 6.
    Babai, L.: Graph isomorphism in quasipolynomial time [extended abstract]. In: Proceedings of 48th ACM Symposium on Theory of Computing (STOC 2016), pp. 684–697, New York, NY, USA. ACM (2016)Google Scholar
  7. 7.
    Choi, S.-H., Shin, S.Y., Chwa, K.-Y.: Characterizing and recognizing the visibility graph of a funnel-shaped polygon. Algorithmica 14(1), 27–51 (1995)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Colley, P.: Visibility graphs of uni-monotone polygons. Master’s thesis, Department of Computer Science, University of Waterloo, Waterloo, Canada (1991)Google Scholar
  9. 9.
    Colley, P.: Recognizing visibility graphs of unimonotone polygons. In: Proceedings of 4th Canadian Conference on Computational Geometry, pp. 29–34 (1992)Google Scholar
  10. 10.
    Durocher, S., Mehrabi, S.: Computing partitions of rectilinear polygons with minimum stabbing number. In: Gudmundsson, J., Mestre, J., Viglas, T. (eds.) COCOON 2012. LNCS, vol. 7434, pp. 228–239. Springer, Heidelberg (2012).  https://doi.org/10.1007/978-3-642-32241-9_20 CrossRefGoogle Scholar
  11. 11.
    ElGindy, H.: Hierarchical decomposition of polygons with applications. Ph.D. thesis, McGill University, Montreal, Canada (1985)Google Scholar
  12. 12.
    Evans, W., Saeedi, N.: On characterizing terrain visibility graphs. J. Comput. Geom. 6(1), 108–141 (2015)MathSciNetzbMATHGoogle Scholar
  13. 13.
    Everett, H.: Visibility graph recognition. Ph.D. thesis, University of Toronto (1990)Google Scholar
  14. 14.
    Everett, H., Corneil, D.: Recognizing visibility graphs of spiral polygons. J. Algorithms 11(1), 1–26 (1990)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Ghosh, S.K.: Visibility Algorithms in the Plane. Cambridge University Press, New York (2007)CrossRefzbMATHGoogle Scholar
  16. 16.
    Ghosh, S.K., Mount, D.M.: An output-sensitive algorithm for computing visibility. SIAM J. Comput. 20(5), 888–910 (1991)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Jackson, L., Wismath, S.: Orthogonal polygon reconstruction from stabbing information. Comp. Geom. Theor. Appl. 23(1), 69–83 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  18. 18.
    O’Rourke, J.: Art Gallery Theorems and Algorithms. Oxford University Press, New York (1987)zbMATHGoogle Scholar
  19. 19.
    Sitchinava, N., Strash, D.: Reconstructing generalized staircase polygons with uniform step length. arXiv preprint https://arxiv.org/abs/1708.09842 (2017)

Copyright information

© Springer International Publishing AG 2018

Authors and Affiliations

  1. 1.Department of Information and Computer SciencesUniversity of HawaiiManoaUSA
  2. 2.Department of Computer ScienceColgate UniversityHamiltonUSA

Personalised recommendations