Abstract
A recent paper contained the following theorem: the visibility graph of a set of n nonintersecting line segments in the plane contains at least 5n-4 edges. Crucial details of the proof given do not hold. Rather than attempt to patch that proof we present an alternative, more direct proof.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.