cgal/AABB_tree
Camille Wormser 01d0293bc5 Code is now almost up to the specification: Primitive::Id everywhere,
the KD-tree uses decorated points to return the Id too. 

There are just a few boost::optional to add in the traits, where we still
use the old bool intersection(..., Result&) approach, and some modernization 
to do in the distance computation things.

Everything compiles.

I have removed the funtion closest_primitive from the code and documentation, 
since it would not be consistent with the rest of the interface, and would not
be faster than closest_point_and_primitive.

I think we are almost done, not only for the documentation, but for the code too.
2009-05-08 12:59:22 +00:00
..
doc_tex Code is now almost up to the specification: Primitive::Id everywhere, 2009-05-08 12:59:22 +00:00
examples/AABB_tree AABB tree: more on distance queries 2009-05-07 21:22:24 +00:00
include/CGAL Code is now almost up to the specification: Primitive::Id everywhere, 2009-05-08 12:59:22 +00:00
package_info/AABB_tree AABB tree: added (commented) example of projection against a set of segments. 2009-04-26 20:59:43 +00:00
test/AABB_tree AABB tree: intersections now return CGAL::Objects. 2009-05-07 21:03:21 +00:00
dont_submit AABB tree: update doc 2009-05-05 20:25:20 +00:00