The minimum chord-length rectangular partition problem arise
in VLSI layout design.  An \$O(n log n)\$-time greedy heuristic is
given by utilizing efficient data structures for orthogonal
segments.