Crossing reduction by windows optimization

Abstract

The number of edge crossings is a commonly accepted measure to judge the "readability" of graph drawings. In this paper we present a new algorithm for high quality multi-layer straight-line crossing minimization. The proposed method uses a local optimization technique where subsets of nodes and edges are processed exactly. The algorithm uses optimization on a window applied in a manner, similar to those used in the area of formal verification of logic circuits. In contrast to most existing heuristics, more than two layers are considered simultaneously. The algorithm tries to reduce the total number of crossings based on an initial placement of the nodes and can thus also be used in a postprocessing step. Experiments are given to demonstrate the efficacy of the proposed technique on benchmarks from the area of circuit design. © Springer-Verlag Berlin Heidelberg 2002.