Algorithm for finding all minimum circles from single line drawings
Jun Zhao, Mantun Gao, Sanmin Wang · Computer Engineering and Applications Journal · 2010
This paper presents concept of minimum circle and an efficient algorithm for finding the minimum circle from single line drawings.Firstly,the edges which have a common vertex are arranged into a set in counterclockwise.Then each vertex on boundary serves as the starting point to search the minimum circle in counterclockwise,and the edge of circle is selected under the rule of turning minimum angle in clockwise.When coming back to the starting point,a minimum circle will be created.The certain line that is the starting edge of minimum circle and is included in two minimum circles is deleted from line drawing.Finally,all lines are deleted and all minimum circles are found.Test results show high efficiency and stability of this algorithm.