Finding all weakly-visible chords of a polygon in linear time

Extended abstract
  • Gautam Das
  • Paul J. Heffernan
  • Giri Narasimhan
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 824)


A chord of a simple polygon P is weakly-visible if every point on P is visible from some point on the chord. We give an optimal linear-time algorithm which computes all weakly-visible chords of a simple polygon P with n vertices.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Avis, D., Toussaint, G.T.: An optimal algorithm for determining the visibility of a polygon from an edge. IEEE Transactions on Computers 30 (1981) 910–914Google Scholar
  2. 2.
    Chen, D.Z.: Optimally computing the shortest weakly-visible edge of a simple polygon. Proc. Fourth ISAAC, LNCS 762 (1993) 323–332Google Scholar
  3. 3.
    Doh, J., Chwa, K.: An algorithm for determining visibility of a simple polygon from an Internal Line Segment. J. of Algorithms 14(1) (1993) 139–168Google Scholar
  4. 4.
    Das, D., Heffernan, P.J., Narasimhan, G.: LR-visibility in polygons. Proc. 5th Canadian Conference on Computational Geometry (1993) 303–308. Submitted to special issue of Computational Geometry — Theory and Appln.Google Scholar
  5. 5.
    Das, G., Narasimhan, G.: Optimal Linear-Time Algorithm for the Shortest Illuminating Line Segment in a Polygon. Proc. 10th Annual ACM Symp. on Computational Geometry (1994)Google Scholar
  6. 6.
    Guibas, L., Hershberger, J., Leven, D., Sharir, M., Tarjan, R.: Linear time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica 2 (1987) 209–233CrossRefGoogle Scholar
  7. 7.
    Heffernan, P.J.: An optimal algorithm for the two-guard problem. Proc. 9th Annual ACM Symp. on Computational Geometry (1993) 348–358Google Scholar
  8. 8.
    Icking, C., Klein, R.: The two guards problem. Proc. 7th Annual ACM Symp. on Computational Geometry (1991) 166–175Google Scholar
  9. 9.
    Ke, Y.: Detecting the weak visibility of a simple polygon and related problems. Tech. Report, The Johns Hopkins University (1987)Google Scholar
  10. 10.
    Lee, D.T., Preparata, F.P.: An optimal algorithm for finding the kernel of a polygon. Journal of the ACM, 26(3) (1979) 415–421Google Scholar
  11. 11.
    Sack, J.-R., Suri, S.: An optimal algorithm for detecting weak visibility. IEEE Transactions on Computers 39(10) (1990) 1213–1219Google Scholar
  12. 12.
    Tseng, L.H., Lee, D.T.: Two-guard walkability of simple polygons. manuscript (1993)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Gautam Das
    • 1
  • Paul J. Heffernan
    • 1
  • Giri Narasimhan
    • 1
  1. 1.Memphis State UniversityMemphis

Personalised recommendations