cvoronoi

Computes the best approaching circle of a set of 2D points.

Description

cvoronoi computes the smallest circumscribed, the greatest inscribed and the best approaching circles of a set of 2D points. The method is based on the Voronoi diagram properties. Data can be generated randomly or by mouse click or by reading a data file.

cvoronoi requires the Qhull suite to run (www.geom.umn.edu/software/qhull). It should run both on unix and windows. Modify line 75 to set the path to Qhull suite.

• Acknowledgements: This submission has inspired the following:; Maximum Inscribed Circle using Distance Transform
• MATLAB release: MATLAB 6.0 (R12)
• Other requirements: Can be slow with a great number of points ...

[Brent Ware]

Needs qhull, which seems to be weakly supported at www.thesa.com. It also seems to want an older version of qhull, though it doesn't say which, as the options passed are no longer valid in the newest version of qhull.

[C Steele]

Had really good luck with software and processing files. Found qhull software easily enough, and worked fine. Makes difficult programming problems with computational metrology accessible to the rest of us. Cheers!

[Yosha Rizky]

It seems quite handy in visualisation.

[Andre Claudet]

I think there is some problem with it's determination of the maximum inscribed circle. Specifically, when it's finding which voronoi vertex is the center it may pick a vertex outside of the convex hull of the input point set. I had to add an additional condition to the if statement on line 481 to make sure that xnvv(i),ynvv(i) is in the convex hull of the input point set. Also, I don't think the ";" at the end of line 478 should be there.

[us,a]

f9 can be done better