Techniques For Drawing Curved Edges In Graphs

摘要

A system and method for drawing curved edges in graphs is disclosed. The system and method implement a heuristic algorithm to draw curved edges in graphs using Bezier curves. The algorithm assumes that every pair of nodes has a unique edge between them. It also assumes that the graph is “leveled,” which means the nodes can be grouped such that all the nodes in a group are laid out at the same y location in a vertical layout. Any generic graph can be converted to a leveled graph, so the techniques described in the algorithm are applicable to any graph.