mirror of https://github.com/CGAL/cgal
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. |
||
|---|---|---|
| .. | ||
| AABB_tree | ||
| AABB_tree_ref | ||