Maximum Inscribed Circle using Voronoi Diagram

A fast, subpixel accurate largest inner circle detection using Voronoi Diagrams

Description

A sample application and a function for solving the maximum inscribed circle problem.
Unlike my other submission "Maximum Inscribed Circle using Distance Transform" (at http://www.mathworks.com/matlabcentral/fileexchange/30805-maximum-inscribed-circle-using-distance-transform), this algorithm is subpixel accurate. It operates only on the polygon and not the image points. Therefore, if the polygon is given in sub-pixels, the result will be accurate.
I use an O(n log(n)) algorithm as follows:
- Construct the Voronoi Diagram of the polygon.
- For Voronoi nodes which are inside the polygon:
- Find the node with the maximum distance to edges in P. This node is the centre of the maximum inscribed circle.
 
 For more details on the problem itself please checkout my previous submission as mentioned above.
 
 To speed things up, replace "inpolygon" function by Bruno Lunog's faster implementation "2D polygon interior detection" :
 http://www.mathworks.com/matlabcentral/fileexchange/27840-2d-polygon-interior-detection
 
 Copyright (c) 2011, Tolga Birdal <http://www.tbirdal.me>;

Acknowledgements

The author wishes to acknowledge the following in the creation of this submission:
Fast points-in-polygon test

• Required Products: Image Processing Toolbox
• MATLAB release: MATLAB 7.9 (2009b)