From : Francois Berenger <berenger AT riken.jp>

: Francois Berenger <berenger AT riken.jp> To : caml-list <caml-list AT inria.fr>

: caml-list <caml-list AT inria.fr> Subject : [Caml-list] existing implementation of data structures for storing points/doing nearest neighbour search in OCaml

: [Caml-list] existing implementation of data structures for storing points/doing nearest neighbour search in OCaml Date: Wed, 05 Sep 2012 11:01:42 +0900

[Caml-list] existing implementation of data structures for storing points/doing nearest neighbour search in OCaml , Francois Berenger, 09/05/2012 Re: [Caml-list] existing implementation of data structures for storing points/doing nearest neighbour search in OCaml , Siraaj Khandkar, 09/05/2012

, Francois Berenger, 09/05/2012

Hello,I was looking for a few data structures to accelerate somegeometric operations on 3D point sets.I was happily surprised. The harvest was gorgeous:kd-tree in OCaml:R-tree in OCaml:Vantage point tree in OCaml:Regards,F.