CGAL users discussion list

[Ophir Setter <>]

Hi,

I once created an application computing the minimum width annulus, but it did not use the fastest tools in CGAL.

The solution consists of:
1) Computing the Voronoi diagram of the set of points - you can do that using Delaunay and and Voronoi adapter.

2) Computing the farthest Voronoi diagram of the set of points - you can use convex hull, but I am not sure whether there is an easy way to convert it to the Voronoi diagram.
3) Convert the Voronoi diagram to an Arrangement_2 and overlay them.

4) Iterate on the vertices of the diagram and check which is the minimum.

On my program, I used Envelope_3 to compute both Voronoi diagrams, and did not have to convert it to Arrangement_2 (as Envelope_diagram_2 is already of "type" Arrangement_2).

HTH,
Ophir

On Sun, Feb 6, 2011 at 12:41 AM, ulund <> wrote:

Wondering if anyone has a reference to a published application of using CGAL
to find the minimum width annulus in 2D. I'm looking for a publication that
has the data and the solution.

Thanks,
UL

--
View this message in context: http://cgal-discuss.949826.n4.nabble.com/2D-Minimum-width-annulus-reference-tp3262422p3262422.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://lists-sop.inria.fr/wws/info/cgal-discuss