CGAL users discussion list

[<>]

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!