Details
-
Improvement
-
Status: Closed
-
Trivial
-
Resolution: Fixed
-
None
-
None
-
New
Description
When creating an interval tree for the search intervals, the min values are being "pulled up" to keep internal node bounding boxes consistent. I don't believe this should be necessary though given the intersection/contains algorithms. I stumbled across this when comparing the impl to ComponentTree, which is serving a similar role for specialized 2D cases.
