CGAL users discussion list

[Sophie Che <>]

Hello,

On Tue, May 18, 2010 at 7:16 PM, Panagiotis Foteinos <> wrote:

Hello yall.

I would like to compute the Hausdorff distance of two 3D point sets. I am thinking of using the K nearest neighbor algorithm of CGAL with K equal to 1 for each point on the first set and for each point on the second set (two-sided Hausdorff distance).

The problem sounds interesting. But, instead of finding nearest neighbor for each point, some pre-process might be more efficient. For example, construct convex hulls for both sets and test whether they are intersected. If not, we only need to consider boundary vertex; if yes, points in the intersection parts would be primary and voronoi diagram might be helpful.

Just a quick thought... You might already have a better idea. =]

Best,
~Sophie
-----------------
Don't dream it, Do it!