Skip to Content.
Sympa Menu

cgal-discuss - [cgal-discuss] Nearest Neighbor Search

Subject: CGAL users discussion list

List archive

[cgal-discuss] Nearest Neighbor Search


Chronological Thread 
  • From: Panagiotis Foteinos <>
  • To:
  • Subject: [cgal-discuss] Nearest Neighbor Search
  • Date: Tue, 18 May 2010 19:16:32 -0400
  • Domainkey-signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=mime-version:date:message-id:subject:from:to:content-type; b=G4uyI7hTjv3FE0yuOoXLSIr5EwYbBu3rifPhcZzxO61/LxsoF30HwG7AgOPZAIK7VE p8lr4unEs1eQ2ZWM4HxmYLPo31cMZj1pBkDsigkS+BRqvaytR5ptgqwlzbll+8kACsCO Wq9C3EjrEYe9hccuidkbmh8xt8RKLsRnC8Szo=

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).

Each point set is expected to contain no more than 100,000 points.

Has anyone benchmarked the K nearest neighbor package? Is it reasonably fast? Any comments would be appreciated.


Best Regards,
Panagiotis Foteinos



Archive powered by MHonArc 2.6.16.

Top of Page