Premium
An algorithm for drawing planar graphs
Author(s) -
Plestenjak Bor
Publication year - 1999
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/(sici)1097-024x(199909)29:11<973::aid-spe268>3.0.co;2-b
Subject(s) - planar , planar graph , simple (philosophy) , algorithm , embedding , planar straight line graph , computer science , book embedding , face (sociological concept) , combinatorics , mathematics , computer graphics (images) , theoretical computer science , chordal graph , graph , artificial intelligence , 1 planar graph , social science , philosophy , sociology , epistemology
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.