Skip to Content.
Sympa Menu

cgal-discuss - [cgal-discuss] Which algorithm should I use to find the nearest neighbors?

Subject: CGAL users discussion list

List archive

[cgal-discuss] Which algorithm should I use to find the nearest neighbors?


Chronological Thread 
  • From: Michael Klatt <>
  • To:
  • Subject: [cgal-discuss] Which algorithm should I use to find the nearest neighbors?
  • Date: Mon, 27 Jun 2016 06:44:06 -0700 (PDT)
  • Authentication-results: mail3-smtp-sop.national.inria.fr; spf=None ; spf=Neutral ; spf=None
  • Ironport-phdr: 9a23:GtL4ZBX2rlD/1NGZqrV3J9F338bV8LGtZVwlr6E/grcLSJyIuqrYZhGGt8tkgFKBZ4jH8fUM07OQ6PG4HzVZqsjc+Fk5M7V0HycfjssXmwFySOWkMmbcaMDQUiohAc5ZX0Vk9XzoeWJcGcL5ekGA6ibqtW1aJBzzOEJPK/jvHcaK1oLshrj0osSYPVgArQH+SIs6FA+xowTVu5teqqpZAYF19CH0pGBVcf9d32JiKAHbtR/94sCt4MwrqHwI6LoX3pUeAOCjJ+x4FuQATWduD2dg78LisVzPTBCE+2AHemQQiBtBRQbfvz/gWZKklyrxtuNw3GG5OcTqUfhgXDWp765mTFnrjC4bKxY3+XyRhsEm3/ETmw6ouxEqmt2cW4qSLvcrJfuFcA==
Dear all,

I have found your very interesting package "dD Spatial Searching". I want to
use it to find nearest neighbors. However, I am unsure which of the
algorithms that you implemented is the most efficient in my setting. May I
ask for your advice?

Given a fine mesh P of points (with some larger holes in it) and another
(much) sparser set of points Q in d dimensions, I want to find for each
point in P the nearest neighbor in Q as well as the corresponding Euclidean
distance.

Here is a simple example:
<http://cgal-discuss.949826.n4.nabble.com/file/n4662013/point-sets.png>

Can you advise me which algorithm I should use?
To which of your examples in the manual does this correspond?

Thank you very much!
Best regards,

Michael



--
View this message in context:
http://cgal-discuss.949826.n4.nabble.com/Which-algorithm-should-I-use-to-find-the-nearest-neighbors-tp4662013.html
Sent from the cgal-discuss mailing list archive at Nabble.com.

Archive powered by MHonArc 2.6.18.

Top of Page