Dies ist eine Übersichtsseite mit Metadaten zu dieser wissenschaftlichen Arbeit. Der vollständige Artikel ist beim Verlag verfügbar.
Separating Point Sets by Circles, and the Recognition of Digital Disks
61
Zitationen
1
Autoren
1986
Jahr
Abstract
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.
Ähnliche Arbeiten
Use of the Hough transformation to detect lines and curves in pictures
1972 · 6.521 Zit.
Efficient Graph-Based Image Segmentation
2004 · 6.190 Zit.
Statistical and structural approaches to texture
1979 · 5.739 Zit.
Watersheds in digital spaces: an efficient algorithm based on immersion simulations
1991 · 5.564 Zit.
The quickhull algorithm for convex hulls
1996 · 5.316 Zit.