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.
CITATION STYLE
Freivalds, K. (2001). Curved edge routing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2138, pp. 126–137). Springer Verlag. https://doi.org/10.1007/3-540-44669-9_14
Mendeley helps you to discover research relevant for your work.