The following pages link to On enclosing k points by a circle (Q674185):
Displaying 13 items.
- Efficiently approximating color-spanning balls (Q284593) (← links)
- The approximation algorithms for a class of multiple-choice problem (Q344788) (← links)
- Minimum-area enclosing triangle with a fixed angle (Q390370) (← links)
- Region-restricted clustering for geographic data mining (Q1000925) (← links)
- Computing the smallest \(k\)-enclosing circle and related problems (Q1328752) (← links)
- Optimal consensus set for digital flake hyperspheres in \(n\)D (Q1747509) (← links)
- On geometric optimization with few violated constraints (Q1906043) (← links)
- A branch-and-bound method for the minimum \(k\)-enclosing ball problem (Q2157894) (← links)
- Simple algorithms for partial point set pattern matching under rigid motion (Q2498655) (← links)
- QUANTILE APPROXIMATION FOR ROBUST STATISTICAL ESTIMATION AND k-ENCLOSING PROBLEMS (Q2708040) (← links)
- GEODESIC DISKS AND CLUSTERING IN A SIMPLE POLYGON (Q4650081) (← links)
- Computing the Smallest T-Shaped Polygon Containing k Points (Q4780527) (← links)
- (Q5874507) (← links)
