Abstract

AbstractGiven a simple polygon in the plane, we study the problem of computing the weak visibility polygon from any query line segment in the polygon. This is a basic problem in computational geometry and has been studied extensively before. In this paper, we present new algorithms and data structures that improve the previous results.

Full Text
Paper version not known

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 call

Disclaimer: 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.