[Toss-devel] Fwd: [Caml-list] existing implementation of data structures for storing points/doing nearest neighbour search in OCaml

[Lukasz S. <luk...@gm...>]

Might be useful.


---------- Forwarded message ----------
From: Francois Berenger <ber...@ri...>
Date: Wed, Sep 5, 2012 at 4:01 AM
Subject: [Caml-list] existing implementation of data structures for
storing points/doing nearest neighbour search in OCaml
To: caml-list <cam...@in...>


Hello,

I was looking for a few data structures to accelerate some
geometric operations on 3D point sets.
I was happily surprised. The harvest was gorgeous:

kd-tree in OCaml:
- https://github.com/bpr/kd_tree

R-tree in OCaml:
- https://github.com/mariusaeriksen/ocaml-rtree

Vantage point tree in OCaml:
- http://codepad.org/F1hckj5K

Regards,
F.

--
Caml-list mailing list.  Subscription management and archives:
https://sympa-roc.inria.fr/wws/info/caml-list
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs