Curved edge routing
K Freivalds - … of Computation Theory: 13th International Symposium …, 2001 - Springer
Fundamentals of Computation Theory: 13th International Symposium, FCT 2001 …, 2001•Springer
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.
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.
Abstract
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.
Springer