2 research outputs found
Fast Node Overlap Removal - Correction
Our recent paper [1] details an algorithm
for removing overlap between rectangles, while attempting to displace the
rectangles by as little as possible. The algorithm is primarily motivated by
the node-overlap removal problem in graph drawing