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

Subject: CGAL users discussion list

List archive

[cgal-discuss] Nearest Neighbor Search

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

[cgal-discuss] Nearest Neighbor Search, Panagiotis Foteinos, 05/19/2010
- Re: [cgal-discuss] Nearest Neighbor Search, Sophie Che, 05/19/2010
- Re: [cgal-discuss] Nearest Neighbor Search, 杨成林, 05/19/2010
  - Re: [cgal-discuss] Nearest Neighbor Search, Panagiotis Foteinos, 05/19/2010
    - Re: [cgal-discuss] Nearest Neighbor Search, 杨成林, 05/20/2010
      - Re: [cgal-discuss] Nearest Neighbor Search, Panagiotis Foteinos, 05/20/2010
        
        Re: [cgal-discuss] Nearest Neighbor Search, Fei (Sophie) Che, 05/20/2010

List archive

[cgal-discuss] Nearest Neighbor Search