CGAL users discussion list

[GV <>]

Hi!
I am fairly new to CGAL and I use it to find the minimum distance between a
point and a given object.
I searched among previous posts, but I didn't find anything similar to my
problem, so I post this new message.

At first, I explain my situation.
I have an object, represented with an OFF model; in particular, let's
consider a box. 
So, using OFF rules, this box is represented with 8 vertices and 6
rectangular faces.
I use tree.closest_point() to find the closest point of the box respect of 
a given external point and tree.squared_distance() to find the required
distance.

My question is:
 
is able CGAL to work with not triangular mesh/faces?


In my case, I am able to find correct distance with tree:squared_distance()
only if I represent the box with triangulare faces.

I hope somebody will be able to help me :)

P.s:
If someone is interested and thinks that this message is not enough I can
explain my problem with more details :)

Best regards,

GV





--
View this message in context: 
http://cgal-discuss.949826.n4.nabble.com/Closest-Point-with-NOT-triangular-mesh-tp4660593.html
Sent from the cgal-discuss mailing list archive at Nabble.com.