By computing the axis-aligned bounding box of each set, we can confirm two sets to be disjoint without having to solve an optimization problem. Given a large graph of convex sets, the computational cost of constructing these bounding boxes may be outweighed by the time savings of solving fewer intersection checks.
cohnt
commented
4 days ago
By computing the axis-aligned bounding box of each set, we can confirm two sets to be disjoint without having to solve an optimization problem. Given a large graph of convex sets, the computational cost of constructing these bounding boxes may be outweighed by the time savings of solving fewer intersection checks.
This change is