CGAL users discussion list

[vahid <>]

Hi all
I am trying to use the example " AABB_triangle_3_example.cpp
<http://doc.cgal.org/latest/AABB_tree/AABB_tree_2AABB_triangle_3_example_8cpp-example.html>
 
" to find the closest point in the union of all input primitives to a query
point.
I would like to be able to have more information about the obtained closest
point such as which triangle (id number) contains the closest point or if it
lies on an input point, what is the id number of the input point.
I have tried to use:
Point_and_primitive_id pp = tree.closest_point_and_primitive(point_query);
std::cerr << "closest point is: " << pp.first << std::endl;
which gives me the same results, but I cannot manage to get any id from
pp.second (I get errors).
I would appreciate any help on this matter.



--
View this message in context: 
http://cgal-discuss.949826.n4.nabble.com/The-triangle-closest-to-a-query-point-tp4659854.html
Sent from the cgal-discuss mailing list archive at Nabble.com.