Abstract
The authors consider the problem of constructing a planar grid embedding for G, where G is a planar graph with n vertices, which maps vertices to distinct grid points and edges to nonintersecting grid paths. A new algorithm is presented that runs in O(n) time and produces grid embeddings with the following properties: (1) the total number of bends is at most 2.4n+2; (2) the number of bends along each edge is at most 4; (3) the length of every edge is O(n); and (4) the area of the embedding is O(n/sup 2/).< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
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.
