Curved Edge Routing

We consider the problem of drawing a graph where edges are represented by smooth curves between the associated nodes. Previously curved edges were drawn as splines defined by carefully calculated control points. We present a completely different approach where finding an edge is reduced to solving a differential equation. This approach allows to represent the graph drawing aesthetics directly, even the most complex ones denoting the dependencies among the paths.

[1]  Georg Sander,et al.  Graph Layout through the VCG Tool , 1994, GD.

[2]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[3]  Antonio Bicchi,et al.  Planning shortest bounded-curvature paths for a class of nonholonomic vehicles among obstacles , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.

[4]  Ioannis G. Tollis,et al.  Algorithms for Drawing Graphs: an Annotated Bibliography , 1988, Comput. Geom..

[5]  L. M. Giannini.  Optimum design of open pit mines , 1991, Bulletin of the Australian Mathematical Society.

[6]  Thomas Lengauer,et al.  Combinatorial algorithms for integrated circuit layout , 1990, Applicable theory in computer science.

[7]  Michael T. Goodrich,et al.  Drawing planar graphs with circular arcs , 1999, GD.

[8]  Michael T. Goodrich,et al.  A Framework for Drawing Planar Graphs with Curves and Polylines , 1998, Graph Drawing.

[9]  M. Carter.  Computer graphics: Principles and practice , 1997 .

[10]  Emden R. Gansner,et al.  A Technique for Drawing Directed Graphs , 1993, IEEE Trans. Software Eng..

[11]  Roberto Tamassia,et al.  An incremental approach to aesthetic graph layout , 1993, Proceedings of 6th International Workshop on Computer-Aided Software Engineering.

[12]  Jean-Claude Latombe,et al.  Robot motion planning , 1970, The Kluwer international series in engineering and computer science.

[13]  David P. Dobkin,et al.  Implementing a General-Purpose Edge Router , 1997, Graph Drawing.