Separating Point Sets by Circles, and the Recognition of Digital Disks

Authors:
Steve Fisk
Affiliations:
Department of Mathematics, Bowdoin College, Brunswick, ME 04011.
Venue:
IEEE Transactions on Pattern Analysis and Machine Intelligence
Year:
1986

Citing 0
Cited 5

Measure of circularity for parts of digital boundaries and its fast computation

Pattern Recognition
Localized geometric query problems

Computational Geometry: Theory and Applications
Topological relations between separating circles

Discrete Applied Mathematics
Digital circles, spheres and hyperspheres: From morphological models to analytical characterizations and topological properties

Discrete Applied Mathematics
Fast Circular Arc Segmentation Based on Approximate Circularity and Cuboid Graph

Journal of Mathematical Imaging and Vision

Quantified Score

Hi-index	0.14

Visualization

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.