An Experimental Comparison of Orthogonal Compaction Algorithms


We present an experimental study in which we compare the state-of-the-art methods for compacting orthogonal graph layouts. Given the shape of a planar orthogonal drawing, the task is to place the vertices and the bends on grid points so that the total area or the total edge length is minimised. We compare four constructive heuristics based on rectangular… (More)


10 Figures and Tables

Slides referencing similar topics