Handles intersection of an multi-dimensional shape in byte space with a block KD-tree previously written with
Used to track all state for a single call to
Recursively builds a block KD-tree to assign all incoming points in N-dim space to smaller and smaller N-dim rectangles (cells) until the number of points in a given rectangle is <=
Copyright © 2000-2016 Apache Software Foundation. All Rights Reserved.