News for hackers. Stuff that matters.
Re:Ask HN: Fast data structures for disjoint intervals? by ozb on Tuesday July 23, 2024 @11:42PM (#41053420)
Have you tried a 1-d kd tree, that at each subinterval keeps track of the largest gap? Should be fairly simple to keep this updated and effectively match/generalize your "coalescing" logic.

There are no comments on this comment yet.