The following pages link to Computing circular separability (Q1079817):
Displaying 24 items.
- The number of different digital \(N\)-discs (Q333607) (← links)
- Topological relations between separating circles (Q387873) (← links)
- Minimizing the error of linear separators on linearly inseparable data (Q427883) (← links)
- Algorithms for weak and wide separation of sets (Q686422) (← links)
- Measure of circularity for parts of digital boundaries and its fast computation (Q733129) (← links)
- Separating bichromatic point sets by L-shapes (Q904108) (← links)
- Minimum polygonal separation (Q1101685) (← links)
- On the complexity of polyhedral separability (Q1119020) (← links)
- On the ball spanned by balls (Q1264087) (← links)
- Identification of points using disks (Q1618247) (← links)
- Geometric separability using orthogonal objects (Q2122791) (← links)
- Variations of largest rectangle recognition amidst a bichromatic point set (Q2201768) (← links)
- Separability of imprecise points (Q2362104) (← links)
- Dynamic minimum bichromatic separating circle (Q2424884) (← links)
- Digital circles, spheres and hyperspheres: from morphological models to analytical characterizations and topological properties (Q2444559) (← links)
- Locating an obnoxious plane (Q2496077) (← links)
- Separating bichromatic point sets in the plane by restricted orientation convex hulls (Q2694525) (← links)
- FINDING THE LARGEST EMPTY DISK CONTAINING A QUERY POINT (Q2875646) (← links)
- On Three Constrained Versions of the Digital Circular Arc Recognition Problem (Q3648770) (← links)
- Separability and Tight Enclosure of Point Sets (Q4648754) (← links)
- COMPUTING LARGEST CIRCLES SEPARATING TWO SETS OF SEGMENTS (Q4682203) (← links)
- THE LARGEST EMPTY ANNULUS PROBLEM (Q4818587) (← links)
- SOME LOWER BOUNDS ON GEOMETRIC SEPARABILITY PROBLEMS (Q5291404) (← links)
- Separating objects in the plane by wedges and strips (Q5929324) (← links)
