Skip to main content
2 votes

Detect if an interval is fully covered by union of previous intervals in sequence

The intersection of a sequence of intervals $I_1, ..., I_p$ is $$\left[ \max_{i \leq p} s(I_i), \min_{i \leq p} f(I_i) \right],$$ where $s$ and $f$ are the start and finish times is an interval. From ...
Pål GD's user avatar
  • 16.7k
1 vote

Detect if an interval is fully covered by union of previous intervals in sequence

I think I have worked out a solution that takes $O(n \log n)$ time. It relies on a regular interval tree which has $O(\log n + m)$ query (for $m$ overlapping intervals) and $O(\log n)$ insertion and ...
MattDs17's user avatar
  • 163

Only top scored, non community-wiki answers of a minimum length are eligible