A Layout algoritm for hierarchical graphs with constraints

Michael Slade

Note: imported from RIT’s Digital Media Library running on DSpace to RIT Scholar Works. Physical copy available through RIT's The Wallace Library at: QA166.S52 1994


A new method is developed for reducing edge crossings in the layout of directed graphs for display. The method will reduce edge crossings in graphs which have constraints on the location or movement of some of the nodes. This has not been available in previously published methods. An analysis of the strategies used to choose rank pairs for edge crossing reduction shows that this choice will dramatically affect the amount of crossings eliminated. This method is directly applicable to the reduction of edge crossings in the general graph.