Appends many points, and then at the end provides a
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 <=
Utility class to read buffered points from in-heap arrays.
Utility class to write new points into in-heap arrays.
Utility APIs for sorting and partitioning buffered points.
Reads points from disk in a fixed-with format, previously written with
Writes points to disk in a fixed-with format.
One pass iterator through all points previously written with a