Interval Heap vs MinHeap
Fragment of a discussion from User talk:Rednaxela/kD-Tree
← Thread:User talk:Rednaxela/kD-Tree/Interval Heap vs MinHeap/reply (4)
Jump to navigation
Jump to search
← Thread:User talk:Rednaxela/kD-Tree/Interval Heap vs MinHeap/reply (4)
And how about if you just use the IntervalHeap, but don't try any pruning? I'm curious whether the pruning is slow, or the different heap.
Skilgannon (talk)
You do not have permission to edit this page, for the following reasons:
You can view and copy the source of this page.
Return to Thread:User talk:Rednaxela/kD-Tree/Interval Heap vs MinHeap/reply (5).
So the incremental difference from a larger heap is less than the cost of removing the points.
Skilgannon (talk)