Implementing a general-purpose edge router
David Dobkin, Emden R. Gansner, Eleftherios Koutsofios, Stephen C. North · Lecture notes in computer science · 1997
Although routing is a well-studied problem in various contexts, there remain unsolved problems in routing edges for graph layouts. In contrast with techniques from other domains such as VLSI CAD and robotics, where physical constraints play a major role, aesthetics play the more important role in graph layout. For graphs, we seek paths that are easy to follow and add meaning to the layout. We describe a collection of aesthetic attributes applicable to drawing edges in graphs, and present a general approach for routing individual edges subject to these principles. We also give implementation details and survey difficulties that arise in an implementation. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.