A Layout Adjustment Problem for Disjoint Rectangles Preserving Orthogonal Order
For a given set of n rectangles place on a plane, we consider a problem of finding the minimum area layout of the rectangles that avoids intersections of the rectangles and preserves the orthogonal order. Misue et al. proposed an O(n 2)-time heuristic algorithm for the problem. We first show that the corresponding decision problem for this problem is NP-complete. We also present an O(n 2)-time heuristic algorithm for the problem that finds a layout with smaller area than Misue’s.
- 3.P. Eades, W. Lai, K. Misue, and K. Sugiyama, “Preserving the mental map of a diagram,” Proc. of COMPUGRAPHICS’ 91, pp. 34–43, 1991.Google Scholar