The following pages link to On enclosing k points by a circle (Q674185):
Displaying 22 items.
- Efficiently approximating color-spanning balls (Q284593) (← links)
- Enclosing \(k\) points in the smallest axis parallel rectangle (Q293194) (← 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)
- Fast algorithms for computing the smallest \(k\)-enclosing circle (Q1763156) (← links)
- On geometric optimization with few violated constraints (Q1906043) (← links)
- The generalized yolk point (Q1975323) (← links)
- On circles enclosing many points (Q2043403) (← links)
- A branch-and-bound method for the minimum \(k\)-enclosing ball problem (Q2157894) (← links)
- On the geometry of the smallest circle enclosing a finite set of points (Q2382759) (← 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)
- Minimum enclosing circle with few extra variables (Q2957525) (← links)
- GEODESIC DISKS AND CLUSTERING IN A SIMPLE POLYGON (Q4650081) (← links)
- Computing the Smallest T-Shaped Polygon Containing k Points (Q4780527) (← links)
- Computing the smallest k-enclosing circle and related problems (Q5060125) (← links)
- The problem of a minimal ball enclosing k points (Q5263806) (← links)
- (Q5874507) (← links)
- A novel approximation algorithm for max-covering circle problem (Q6606184) (← links)
