Referenced Items are not available for this document.
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.
Published in:
Pattern Analysis and Machine Intelligence, IEEE Transactions on
(Volume:PAMI-8
,
Issue:
4
)
Date of Publication: July 1986
- Page(s):
- 554 - 556
- ISSN :
- 0162-8828
- Digital Object Identifier :
- 10.1109/TPAMI.1986.4767821
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 27 January 2009
- Issue Date :
- July 1986
- Sponsored by :
- IEEE Computer Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
