Advertisement

Optimal Guard Placement Problem Under L-Visibility

  • Debabrata Bardhan
  • Sasanka Roy
  • Sandip Das
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3980)

Abstract

Two points a and b in the presence of polygonal obstacles are L-visible if the length of the shortest path avoiding obstacles is no more than L. For a given convex polygon Q, Gewali et al [4]. addressed the guard placement problem on the exterior boundary that will cover the maximum area exterior to the polygon under L-visibility. They proposed a linear time algorithm for some given value of L. When the length L is greater than half of the perimeter, they declared that problem as open. Here we address that open problem and present an algorithm whose time complexity is linear in number of vertices of the polygon.

Keywords

Convex Polygon Clockwise Direction Steiner Point Linear Time Algorithm Sector Angle 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aronov, B., Davis, A.R., Dey, T.K., Pal, S.P., Prasad, D.C.: Visibility with reflection. In: Proc. of the 11th ACM symposium on computational geometry, pp. 316–325 (1995)Google Scholar
  2. 2.
    Chvatal, V.: A combinatorial theorem in plane geometry. Journal of combinatorial Theory SER B 18, 39–41 (1975)MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    ElGindy, H., Avis, D.: A linear time algorithm for computing the visibility polygon from a point. Journal of Algorithms 2, 186–197 (1981)CrossRefMathSciNetGoogle Scholar
  4. 4.
    Gewali, L., Venkatasubramanian, R., Glasser, D.: Algorithms for Computing Grazing Area (unpublished results), http://www.egr.unlv.edu/~laxmi/
  5. 5.
    Ntafos, S.: Watchman routes under limited visibility. Computational Geometry: Theory and Application 1, 149–170 (1992)MATHMathSciNetGoogle Scholar
  6. 6.
    O’Rourke, J.: Art Gallery Theorems and Algorithms. Oxford University Press, Oxford (1987)MATHGoogle Scholar
  7. 7.
    Sack, J.R., Urrutia, J.: Handbook of computational geometry. North-Holland/Elsevier Science B. V, Netherlands (2000)MATHGoogle Scholar
  8. 8.
    Shermer, T.: Recent results in Art Galleries. Proceedings of the IEEE, 1384–1399 (1992)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Debabrata Bardhan
    • 1
  • Sasanka Roy
    • 2
  • Sandip Das
    • 3
  1. 1.LSI Logic India Pvt. Ltd.KolkataIndia
  2. 2.Indian Statistical InstituteKolkataIndia
  3. 3.Institut de MathematiquesUniversite de BourgogneDijonFrance

Personalised recommendations