Interesting. To all geometry-interested people: The preview of our Geometry Library was scheduled and announced for this week but will be next Tuesday, as we're finishing preliminary documentation and samples. Barend Hervé Brönnimann wrote:
Phil: You might also want to check my MS student's implementation (feel free to finish/polish/improve on it!)
http://photon.poly.edu/~hbr/publi/ilya-thesis/index.html
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@mac.com
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?
_______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
-- ------------------------------------- Barend Gehrels, Geodan Holding b.v., Amsterdam, The Netherlands, www.geodan.nl