CGAL users discussion list

["Hoffmann Michael" <>]

If I understand you correctly, you can get this via convex hull and 
CGAL::maximum_perimeter_inscribed_k_gon_2, with k=2, in O(n log n) time.

Best, Michael

> On 22 Oct 2015, at 11:53, Michael Klatt 
> <>
>  wrote:
> 
> Hello,
> 
> I very much appreciate your nice code to calculate the bounding volumes. I
> use it to calculate the radius of the best circumscribing circle for a set
> of points, and it is very helpful to me. Is it possible to directly (or very
> efficiently) extract from this calculation also the maximum Euclidean
> distance among all pairs of points, i.e.,
> max_{1<=i<j<=n} || X_i - X_j || (given n points at positions X_1, ... X_n)?
> 
> Thank you very much!
> 
> Best regards,
> 
> Michael
> 
> 
> 
> 
> --
> View this message in context: 
> http://cgal-discuss.949826.n4.nabble.com/Maximum-Distance-from-Bounding-Volume-Calculation-tp4661269.html
> Sent from the cgal-discuss mailing list archive at Nabble.com.
> 
> -- 
> You are currently subscribed to cgal-discuss.
> To unsubscribe or access the archives, go to
> https://sympa.inria.fr/sympa/info/cgal-discuss
> 
>