Module kdtree 

KD-Tree implementation for efficient nearest neighbor search

A KD-tree is a space-partitioning data structure for organizing points in a k-dimensional space. It enables efficient nearest neighbor searches, which is crucial for many interpolation methods that rely on local information.

This implementation provides:

• Building balanced KD-trees from point data
• Efficient exact nearest neighbor queries
• k-nearest neighbor searches
• Range queries for all points within a specified radius
• Bulk loading optimization for large datasets

Structs

KdTree

KD-Tree for efficient nearest neighbor searches