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.


Click on the following title to view and download the paper in PostScript format.

Curved Edge Routing
K. Freivalds, Proc. of the Symposium on Fundamentals of Computation Theory 2001, LNCS vol. 2138.

Return to publications