Skip to Main Content
Given two sets A and B of points in the plane, we give a polynomial time algorithm to find the set S of points which are centers of circles that contain all the members of A and none of B. A consequence of the algorithm is that S is polygonal. Another application is an O(N2) time and O(N2) space algorithm for the recognition of digital disks.
Pattern Analysis and Machine Intelligence, IEEE Transactions on (Volume:PAMI-8 , Issue: 4 )
Date of Publication: July 1986