Abstract
Let Γn denote the collection of visibility graphs of staircase polygons (orthogonal convex fans) which consist of n−1 horizontal steps of arbitrary lengths. We show that for n≥7 there are graphs in Γn which cannot be realized as the visibility graphs of staircase polygons with uniform step length.
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 callMore From: International Journal of Computational Geometry & Applications
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.
