Abstract
We prove the tight lower bound 4 n − 4 on the size of tangent visibility graphs on n pairwise disjoint bounded obstacles in the euclidean plane, and we give a simple description of the configurations of convex obstacles which realize this lower bound.
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.
