CGAL users discussion list

[Pierre Alliez <>]

hi Matthias,

we are working on a CGAL component to compute such distances. hopefully 
it will make it in the next release.
I will send you the current code so that you can test it.

Pierre Alliez
INRIA Sophia Antipolis - Mediterranee 
Project-team GEOMETRICA 
http://www-sop.inria.fr/members/Pierre.Alliez/
Tel: +33 4 92 38 76 77
Fax: +33 4 97 15 53 95




 a écrit :
> Hello,
>
> I have two questions:
>
> 1. Is there a way to calculate the euclidean (minimal) distance between a 3d
> Point and an triangle (from three 3d points)?
>
> 2. Is there an efficient way to locate the triangle with the minimum distance
> to a certain point directly if I have an Triangulation with many triangles?
>
> Thanks for any help!
>