7 Commits

Author	SHA1	Message	Date
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
Camille Wormser	55021bdb9f	KD-tree forbids copies -> a pointer now.	2009-05-07 09:41:38 +00:00
Camille Wormser	439292a46c	solved the compilation problem for Point_and_primitive ... temporarily disabled the kd-tree construction, not to mix two separate compilation issues. I replug it in a minute.	2009-05-07 09:24:41 +00:00
Pierre Alliez	fd017c5595	AABB tree: first version of boost::optional for any* ... obscure compilation issue for now. more on doc too	2009-05-07 06:44:59 +00:00
Pierre Alliez	b563d29270	AABB tree: the projection does not construct the KD-tree at the first projection query anymore. for efficient projection queries either the user calls for its explicit construction during the AABB construction or calls "construct_search_Tree()". otherwise the first primitive reference point is used as (naive) hint.	2009-04-27 15:36:35 +00:00
Pierre Alliez	a8188eb668	AABB tree: test all intersection types for triangles	2009-04-26 21:29:47 +00:00
Pierre Alliez	9df9f8a9f1	AABB tree: added internal search tree (CGAL K-orth search tree) to accelerate the projection queries. ... substantial complication... may be improved.	2009-04-26 16:22:46 +00:00