6533b831fe1ef96bd12997b2

RESEARCH PRODUCT

Curved Edge Routing

Kārlis Freivalds

subject

Graph drawingComputer scienceDifferential equationControl pointMultigraphMultiple edgesForce-directed graph drawingTopological graphCurvatureTopologyGraphMathematicsofComputing_DISCRETEMATHEMATICS

description

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.

yearjournalcountryeditionlanguage
2001-01-01
https://doi.org/10.1007/3-540-44669-9_14