I have the combinatorial embedding of a generic planar graph (vertices, edges, the cyclic ordering of edges around vertices and the external face) and I need to draw it.
The vertices must be adimensional and the drawing must comply with the defined cyclic ordering of edges around vertices (and with the external face), even if the input graph is not 3-connected or maximal planar.
It would be better if the drawing algorithm was already implemented (perhaps in a Java library), but a paper with the algorithm explanation is still sufficient.
