Subject: CGAL users discussion list
List archive
- From: Cedric Doucet <>
- To:
- Subject: [cgal-discuss] Maximal distance of a set of points to another point
- Date: Wed, 12 Feb 2014 16:56:20 +0100 (CET)
Hello,
I would like to know the fastest way to compute the maximum (squared)
distance of a set of points to another point P in CGAL.
I may iterate on each point Q and compute the (squared) distance between P
and Q but I guess there is a better way to do this.
Points are instances of Point_2< Cartesian<double> >.
My goal is only to check if the maximum distance between P and the set of
nodes is below some threshold.
Thank you very much for you help!
Best regards,
Cédric Doucet
- [cgal-discuss] Nearest neighbor query in a Delaunay triangulation, cdoucet, 02/11/2014
- Re: [cgal-discuss] Nearest neighbor query in a Delaunay triangulation, Andreas Fabri, 02/11/2014
- Re: [cgal-discuss] Nearest neighbor query in a Delaunay triangulation, Andreas Fabri, 02/11/2014
- Re: [cgal-discuss] Nearest neighbor query in a Delaunay triangulation, Sylvain Pion, 02/11/2014
- Re: [cgal-discuss] Nearest neighbor query in a Delaunay triangulation, Cedric Doucet, 02/12/2014
- Re: [cgal-discuss] Nearest neighbor query in a Delaunay triangulation, Sylvain Pion, 02/11/2014
- Re: [cgal-discuss] Nearest neighbor query in a Delaunay triangulation, Andreas Fabri, 02/11/2014
- [cgal-discuss] Maximal distance of a set of points to another point, Cedric Doucet, 02/12/2014
- Re: [cgal-discuss] Nearest neighbor query in a Delaunay triangulation, Andreas Fabri, 02/11/2014
Archive powered by MHonArc 2.6.18.