Applications of random sampling in computational geometry, II
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
The linear time recognition of digital arcs
Pattern Recognition Letters
Digital disks and a digital compactness measure
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
An elementary algorithm for digital arc segmentation
Discrete Applied Mathematics - The 2001 international workshop on combinatorial image analysis (IWCIA 2001)
On three constrained versions of the digital circular arc recognition problem
DGCI'09 Proceedings of the 15th IAPR international conference on Discrete geometry for computer imagery
Topological relations between separating circles
Discrete Applied Mathematics
| Hi-index | 0.00 |
The family of separating circles of two finite sets S1 and S2 in the plane consists of all the circles that enclose S1 but exclude S2. We prove that the maximum and minimum distance between a point p and any separating circle in this family can be found by examining only a finite subset of circles, although the family itself is infinite. In addition, we introduce the concept of elementary circular separations to clarify some of the properties of separating circles.