If you only have one point, you have to compute the distance to
all vertices.

If you have many query points, you can put the vertices in a
kd-tree

and then perform your queries.

andreas

Given a 3D-Point p = (x, y, z) on a
Surface_mesh in CGAL, how to find the closest vertex to this
point?

--
Andreas Fabri, PhD
Chief Officer, GeometryFactory
Editor, The CGAL Project
phone: +33.492.954.912 skype: andreas.fabri