Abstract
An orthogonal drawing of a plane graph \(G\) is a planar drawing, denoted by \(D(G)\), of \(G\) such that each vertex of \(G\) is drawn as a point on the plane, and each edge is drawn as a sequence of horizontal and vertical line segments with no crossings. \(D(G)\) is called orthogonally convex if each of its faces is an orthogonally convex polygon \(P\). (Namely, for any horizontal or vertical line \(L\), the intersection of \(L\) and \(P\) is a single line segment or empty). Recently, Chang et al. [1] gave a necessary and sufficient condition for a plane graph to have such a drawing.
Sign-in/Register to access full text options 
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.
