From: Hervé Brönnimann (hervebronnimann_at_[hidden])
Date: 2008-01-22 22:30:49
Phil: You might also want to check my MS student's implementation
(feel free to finish/polish/improve on it!)
He's implemented (static and dynamic) kd-trees, in 2D but the paper
(http://photon.poly.edu/~hbr/publi/inplace-ch3d.html) gives all the
details needed for higher-dimensional and related algorithms.
-- Hervé Brönnimann hervebronnimann_at_[hidden] On Jan 15, 2008, at 5:08 PM, Phil Endecott wrote: > There certainly is. My particular interest is in efficient containers > for points (and perhaps lines) with iterators over 2D ranges; have you > done anything like that?
Boost list run by bdawes at acm.org, david.abrahams at rcn.com, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk