Advertisement

Algorithms for convex visibility problems

  • Supriya Biswas
  • D. Chithra Prasad
  • Sudebkumar Prasant Pal
Algorithms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 880)

Abstract

Two points in a simple polygon are said to be convex visible if the Euclidean shortest path between them makes either only right turns or only left turns. We propose an O(n2 log n) time algorithm for finding a line segment inside a simple polygon (if there exists one) such that every point in the polygon is convex visible from some point of the line segment. We propose an O(n3) time algorithm for finding the maximum independent set of the convex visibility graph for a restricted class of simple polygons.

Keywords

Short Path Line Segment Time Algorithm Simple Polygon Restricted Class 
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.
    S. Biswas, Chithra Prasad, and Sudebkumar Prasant Pal. Algorithms for convex visibility problems. Manuscript, 1994.Google Scholar
  2. 2.
    Goutam Das and Giri Narasimhan. Optimal linear-time algorithm for the shortest illuminating line segment in a polygon. In Proceedings of the ACM Symposium on Computational Geometry, 1994.Google Scholar
  3. 3.
    Jeong-In Doh and Kyung-Yong Chwa. An algorithm for determining visibility of a simple polygon from an internal line segment. Journal of Algorithms, 14: 139–168, 1993.Google Scholar
  4. 4.
    H. Everett. Visibility graph recognition. PhD thesis, University of Toronto, Technical Report 231/90, 1990.Google Scholar
  5. 5.
    S. K. Ghosh. Problems in computational geometry. PhD thesis, University of Bombay, 1987.Google Scholar
  6. 6.
    S. K. Ghosh, A. Maheshwari, S. P. Pal, S. Saluja, and C. E. Veni Madhavan. An algorithm for recognizing palm polygons. In Proceedings of the Second Canadian Conference in Computational Geometry (also to appear in The Visual Computer, Springer-Verlag), 1990.Google Scholar
  7. 7.
    S. K. Ghosh, A. Maheshwari, S. P. Pal, S. Saluja, and C. E. Veni Madhavan. Characterizing and recognizing weak visibility polygons. Computational Geometry: Theory and Applications, 3: 213–233, 1993.Google Scholar
  8. 8.
    L. Guibas, J. Hershberger, D. Leven, M. Sharir, and R. Tarjan. Linear time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica, 2: 209–233, 1987.Google Scholar
  9. 9.
    Y. Ke. Detecting the weak visibility of a simple polygon and related problems. Technical report, Johns Hopkins University, JHU-88/17, 1988.Google Scholar
  10. 10.
    T. Shermer. Hiding people in polygons. Computing, 42: 109–132, 1989.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Supriya Biswas
    • 1
  • D. Chithra Prasad
    • 1
  • Sudebkumar Prasant Pal
    • 1
  1. 1.Department of Computer Science and EngineeringIndian Institute of TechnologyKharagpurIndia

Personalised recommendations