HF RL Explorer

Task: Algorithm for Finding the Fewest Rectangles to Cover a Set of Rectangles

Task: Algorithm for Finding the Fewest Rectangles to Cover a Set of Rectangles: a task in Terminal-Lego-15k (Harbor dataset). Implement an algorithm that takes a set of non-overlapping, axis-aligned rectangles and produces a minimal (or near-minimal) set of non-overlapping rectangles that covers…

The task

Implement an algorithm that takes a set of non-overlapping, axis-aligned rectangles and produces a minimal (or near-minimal) set of non-overlapping rectangles that covers exactly the same area as the original set.

Part of PrimeIntellect/Terminal-Lego-15k.