CGAL users discussion list

[eduriol <>]

Is there any function to get the largest empty circle directly from a given
set of points?

I found nothing in documentation so maybe I'd have to get the Voronoi
diagram and compute every vertex separately to get the largest empty circle.

Thanks in advance.
-- 
View this message in context: 
http://n4.nabble.com/Get-largest-empty-circle-from-a-given-sets-of-points-tp965915p965915.html
Sent from the cgal-discuss mailing list archive at Nabble.com.