Abstract
We consider the problem of computing the visible region of a simple polygon from a line segment in the polygon. The region, called the visibility polygon, is the area that can be illuminated by a tubular light source represented as a line segment. We present an O(nlog n) algorithm for computing the visibility polygon, where n is the number of vertices of the polygon. The algorithm has been implemented in Pascal and some computer output samples are also included.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
