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

Authors:
Gautam Das;Paul J. Heffernan;Giri Narasimhan
Affiliations:
Mathematical Sciences Department, The University of Memphis, Memphis, TN;Mathematical Sciences Department, The University of Memphis, Memphis, TN;Mathematical Sciences Department, The University of Memphis, Memphis, TN
Venue:
Nordic Journal of Computing
Year:
1994

Citing 10
Cited 3

Computational geometry: an introduction

Computational geometry: an introduction
An Optimal Algorithm for Detecting Weak Visibility of a Polygon

IEEE Transactions on Computers
The two guards problem

SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Triangulating a simple polygon in linear time

Discrete & Computational Geometry
An algorithm for determining visibility of a simple polygon from an internal line segment

Journal of Algorithms
An optimal algorithm for the two-guard problem

SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Optimal linear-time algorithm for the shortest illuminating line segment in a polygon

SCG '94 Proceedings of the tenth annual symposium on Computational geometry
LR-visibility in polygons

Computational Geometry: Theory and Applications - Special issue: computational geometry, theory and applications
An Optimal Algorithm for Finding the Kernel of a Polygon

Journal of the ACM (JACM)
Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon

ISAAC '93 Proceedings of the 4th International Symposium on Algorithms and Computation

Finding the shortest boundary guard of a simple polygon

Theoretical Computer Science
Optimally computing a shortest weakly visible line segment inside a simple polygon

Computational Geometry: Theory and Applications
Optimal Algorithms for Two-Guard Walkability of Simple Polygons

WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

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. Previous algorithms for the problem run in O(n log n) time, and only compute a single weakly-visible chord, if one exists.