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.

Filename	Size	Update
kdTree-master\README.md	618	2013-06-04
kdTree-master\kdTree.h	11989	2013-06-04
kdTree-master\testKDTree.cpp	1679	2013-06-04
kdTree-master	0	2018-01-01

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．