Google OR-Tools v9.11
a fast and portable software suite for combinatorial optimization
|
#include <2d_rectangle_presolve.h>
Given a set of non-overlapping rectangles split in two groups, mandatory and optional, try to build a set of as few non-overlapping rectangles as possible defining a region R that satisfy:
The function updates the set of mandatory_rectangles
with R
and optional_rectangles
with optional_rectangles \setdiff R
. It returns true if the mandatory_rectangles
was updated.