Straight line planar embedding of a graph structure

Question

Here is my problem: I have a graph structure (with straight line edges) which I know to be planar (i.e. there exists an embedding of the graph where no edges cross). I need an algorithm which will take my graph and produce a straight line planar embedding of it. The algorithm does not need to be too efficient (an O(N^2) algorithm would do fine). Any ideas/suggestions?

score 1 · Answer 1 · answered Dec 14 '10 at 17:02

you may want at graphviz ( http://www.graphviz.org/ ). This will be able to draw it in many different formats and a pretty simple input definition. Several algorithms can be used to create graphs.

otherwise, scheck out Boyer-Myrvold planarity algorithm and assorted c code from wikipedia: http://jgaa.info/accepted/2004/BoyerMyrvold2004.8.3/planarity.zip

score 1 · Answer 2 · edited Apr 27 '13 at 22:32

1

Read this document...

I had this project for my Algorithms course, to embed the graph we used SVG format... once u decide the algorithm, SVG format is easy to generate...

edited Apr 27 '13 at 22:32

Dan D.

73,243
15
104
123

answered Dec 14 '10 at 17:03

Eternal Noob

2,717
5
27
41

Straight line planar embedding of a graph structure

2 Answers2