cvoronoi
Computes the best approaching circle of a set of 2D points.
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.
4
28 Jul 2005
cvoronoi
Computes the best approaching circle of a set of 2D points.
Yosha Rizky
It seems quite handy in visualisation.
4
08 Dec 2004
cvoronoi
Computes the best approaching circle of a set of 2D points.
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!
5
04 Sep 2003
cvoronoi
Computes the best approaching circle of a set of 2D 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.
