Curve-constrained drawings of planar graphs
Computational Geometry: Theory and Applications
Hi-index | 0.00 |
We submit an animation of an algorithm for drawing an arbitrary planar graph with vertices located on a semi-circle and edges drawn as straight line segments with at most one bend per edge. The animation,produced in .avi format, is available at:www.cs.uleth.ca/~vpak/socg05 .