|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
Separating Point Sets by Circles, and the Recognition of Digital Disks
April 1986 (vol. 8 no. 4)
pp. 554-556
| ASCII Text | x | ||
| Steve Fisk, "Separating Point Sets by Circles, and the Recognition of Digital Disks," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 8, no. 4, pp. 554-556, April, 1986. | |||
| BibTex | x | ||
| @article{ 10.1109/TPAMI.1986.4767821, author = {Steve Fisk}, title = {Separating Point Sets by Circles, and the Recognition of Digital Disks}, journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {8}, number = {4}, issn = {0162-8828}, year = {1986}, pages = {554-556}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPAMI.1986.4767821}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Pattern Analysis and Machine Intelligence TI - Separating Point Sets by Circles, and the Recognition of Digital Disks IS - 4 SN - 0162-8828 SP554 EP556 EPD - 554-556 A1 - Steve Fisk, PY - 1986 VL - 8 JA - IEEE Transactions on Pattern Analysis and Machine Intelligence ER - | |||
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.
Citation:
Steve Fisk, "Separating Point Sets by Circles, and the Recognition of Digital Disks," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 8, no. 4, pp. 554-556, April 1986, doi:10.1109/TPAMI.1986.4767821
Usage of this product signifies your acceptance of the Terms of Use.