Steinitz Representation of Planar Graphs

designed by Brian Goldsmith and Alexander Smith, Winter 2k4

Double-click anywhere within the canvas to place a vertex. Vertices will be automatically triangulated to form a planar graph.
Once you are done creating the planar graph, click Initialize, then enter numbers in the "# steps" box and click Step to iterate the calculations, bringing the sum of angles associated with each vertex close to 2 Pi.
You may click any vertex to get information about it.
Note: If the outer-most face is not a triangle, algorithm will not function properly



Source code is given below (listed in alphabetical order) :

Edge.java
Face.java
GraphApplet.java
GraphCanvas.java
List.java
PopupColorMenu.java
Position.java
SGraph.java
Selectable.java
Vertex.java

or download it all in a zip here

see our algorithm here

Calculations are all based off of the algorithm. Original code was modified from code for computing the dual of a planar graph, by Shameendra Rajapaksa.



Webpage by
Brian Goldsmith and Alexander Smith
e-mail us: a6smith@ucsd.edu bdgoldsm@ucsd.edu