Subject: CGAL users discussion list
List archive
- From: Michael Klatt <>
- To:
- Subject: Re: [cgal-discuss] Which algorithm should I use to find the nearest neighbors?
- Date: Thu, 30 Jun 2016 13:05:38 -0700 (PDT)
- Authentication-results: mail3-smtp-sop.national.inria.fr; spf=None ; spf=Neutral ; spf=None
- Ironport-phdr: 9a23:+qvuuRDkyD2lzZQ/8pP1UyQJP3N1i/DPJgcQr6AfoPdwSP74oMbcNUDSrc9gkEXOFd2CrakV06yP7Ou5BTJIyK3CmUhKSIZLWR4BhJdetC0bK+nBN3fGKuX3ZTcxBsVIWQwt1Xi6NU9IBJS2PAWK8TWM5DIfUi/yKRBybrysXNWD14LuiKvrp8ObSj4LrQL1Wal1IhSyoFeZnegtqqwmFJwMzADUqGBDYeVcyDAgD1uSmxHh+pX4p8Y7oGwD884mosVPWKG/c6UjRqFDFxwnNXo07Yvlr0rtVwyKs14dWWUfnx4AIAzM8A2yCpLwuSvzu+472y2TIdHeQ7kpHzivufQ4ACT0gTsKYmZquFrcjdZ92fpW
Dear Sebastien,
thank you very much for the fast answer and especially for pointing out the
example! That was very helpful.
Can I generalize my program to higher (or two) dimensions by using Point_d?
http://doc.cgal.org/latest/Kernel_d/classCGAL_1_1Point__d.html
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-tp4662013p4662019.html
Sent from the cgal-discuss mailing list archive at Nabble.com.
- [cgal-discuss] Which algorithm should I use to find the nearest neighbors?, Michael Klatt, 06/27/2016
- Re: [cgal-discuss] Which algorithm should I use to find the nearest neighbors?, Sebastien Loriot (GeometryFactory), 06/27/2016
- Re: [cgal-discuss] Which algorithm should I use to find the nearest neighbors?, Michael Klatt, 06/30/2016
- Re: [cgal-discuss] Which algorithm should I use to find the nearest neighbors?, Sebastien Loriot (GeometryFactory), 06/27/2016
Archive powered by MHonArc 2.6.18.