Introduction to algorithms
Computer graphics: principles and practice (2nd ed.)
Computer graphics: principles and practice (2nd ed.)
Combinatorial algorithms for integrated circuit layout
Combinatorial algorithms for integrated circuit layout
Algorithms for drawing graphs: an annotated bibliography
Computational Geometry: Theory and Applications
Robot Motion Planning
A Technique for Drawing Directed Graphs
IEEE Transactions on Software Engineering
Implementing a General-Purpose Edge Router
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
A Framework for Drawing Planar Graphs with Curves and Polylines
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Fast edge-routing for large graphs
GD'09 Proceedings of the 17th international conference on Graph Drawing
Exploring the design space of interactive link curvature in network diagrams
Proceedings of the International Working Conference on Advanced Visual Interfaces
| Hi-index | 0.00 |
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.