Removing edge-node intersections in drawings of graphs

摘要

The literature on abstract graph layout is quite large compared to that for graphs with nontrivial node sizes. This note presents an approach for drawing the latter kind of graph. Our method may use a variety of aesthetic criteria for edge routing. This method integrates the force-scan algorithm and applies it successfully to preventing edge-node intersections and overlapping edges.