This project aims to provide an OCaml implementation for kd-trees. The main purpose is to have efficient implementation of the most important functions such as insertion and finding the nearest neighbor in the kd-tree.
Use Patent Claims
Include Install Instructions
These details are provided for information only. No information here is legal advice and should not be used as such.