Block KD-tree, implementing the generic spatial data structure described in this paper.
|Class and Description|
Handles intersection of an multi-dimensional shape in byte space with a block KD-tree previously written with
Used to walk the in-heap index
Used to track all state for a single call to
Utility class to write new points into in-heap arrays.
One pass iterator through all points previously written with a
Appends many points, and then at the end provides a
Copyright © 2000-2017 Apache Software Foundation. All Rights Reserved.