Y
Hacker News
new
|
ask
|
show
|
jobs
by
ozb
699 days ago
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.