An algorithm for drawing planar graphs
Bor Plestenjak · Software Practice and Experience · 1999
A simple algorithm for drawing 3-connected planar graphs is presented. It is derived from the Fruchterman and Reingold spring embedding algorithm by deleting all repulsive forces and fixing vertices of an outer face. The algorithm is implemented in the system for manipulating discrete mathematical structures Vega. Some examples of derived figures are given. Copyright © 1999 John Wiley & Sons, Ltd.