Subject: CGAL users discussion list
List archive
- From: "Al Hasan" <>
- To:
- Subject: Re: [cgal-discuss] farthest point query
- Date: Wed, 16 Jan 2008 09:55:57 -0500
- Domainkey-signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=message-id:date:from:to:subject:in-reply-to:mime-version:content-type:content-transfer-encoding:content-disposition:references; b=GNM7/bglQ40R81Rnjpb/vbd0+CMxX+KJ8N/Gk74NiQI4w1/BrFMMvzBFIfoEPky+FXg3Q252rH0rBnYoYlAl3sE5QJnADRhsU7DeHLuj1Uf4y6UjGO3K0MF+83SmKeXPPmnKtcGagFnY7tH/lTN5E2SFLFfGbUuWrXCIdTdVWlg=
Thank you, Johannes !
-Mohammad
On 1/16/08, Johannes Otepka
<>
wrote:
> Mohammad,
>
> With the CGAL::Orthogonal_k_neighbor_search class you can do both
> nearest and furthest neighbor searching within D-dimensions.
> http://www.cgal.org/Manual/3.3/doc_html/cgal_manual/Spatial_searching/Chapter_main.html#Subsection_45.3.3
>
> Neighbor_search N1(tree, query, K, 0.0, true); //nearest query
> Neighbor_search N1(tree, query, K, 0.0, false); //furthest query
>
> cheers,
> johannes
>
>
>
> > Hello,
> >
> > Does anyone know whether CGAL has a faster implementation to obtain
> > the farthest point from a given set of points in D-dimension. Please
> > let me know,
> >
> > Thank you!
> >
> > Mohammad
> >
> >
>
> --
> You are currently subscribed to cgal-discuss.
> To unsubscribe or access the archives, go to
> https://lists-sop.inria.fr/wws/info/cgal-discuss
>
--
--------------------------------
Mohammad Al Hasan
2257 Burdett Ave,
Troy NY 12180
- farthest point query, mohammad . alhasan, 01/15/2008
- Re: [cgal-discuss] farthest point query, Johannes Otepka, 01/16/2008
- Re: [cgal-discuss] farthest point query, Al Hasan, 01/16/2008
- Re: [cgal-discuss] farthest point query, Johannes Otepka, 01/16/2008
Archive powered by MHonArc 2.6.16.