Block KD-tree, implementing the generic spatial data structure described in this paper.
|Class and Description|
Basic parameters for indexing points on the BKD tree.
Sliced reference to points in an PointWriter.
Handles intersection of an multi-dimensional shape in byte space with a block KD-tree previously written with
Used to walk the off-heap index.
Used to track all state for a single call to
Utility class to write new points into in-heap arrays.
Reads points from disk in a fixed-with format, previously written with
One pass iterator through all points previously written with a
Represents a dimensional point value written in the BKD tree.
Appends many points, and then at the end provides a
Copyright © 2000-2021 Apache Software Foundation. All Rights Reserved.