Abstract
The planar embedding of a planar graph with the simultaneous minimization of an objective function of graph edge lengths is considered. It is shown that the so-called force embedding of a planar graph dictates a distinctive placement of the graph vertices and edges. This placement is a rectilinear edge embedding in which there are no edge intersections and the quadratic objective function of the edge lengths equals its global minimum. The, effectively O(mn), algorithm for finding the force embedding of a planar graph, where m and n are the number of the graph edges and the number of the graph vertices respectively, is presented. >
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.
