C ++模板化的KD-Tree实现

这是KD-Tree空间数据结构的仅头部实现。 你只需要提供一个
具有已知编译时间“维度”字段的矢量类型和双重getDimension（size_t维度）方法。

目前支持以下操作：
- 从点矢量创建
- 在一个点中心的立方体中查找点
- 从树中删除点（但不是从点的内部列表）
- 采用任意函数参数的遍历方法

我已经成功地使用它来删除邻居太近的修剪一组点。(C++ templated KD-Tree implementation

This is a header only implementation of a KD-Tree spatial data structure.　You just need to provide a
vector type with a known-at-compile-time "dimension" field, and a double getDimension(size_t dimension) method.

Currently the following operations are supported:
- Create from vector of points
- Find points within cube centered at a point
- Delete Point from tree (but not from the internal list of points)
- A traversal method taking an arbitrary function parameter

I've used it successfully to prune a set of points by removing neighbors that are too close.)