On geometric optimization with few violated constraints
- First Online:
- Cite this article as:
- Matoušek, J. Discrete & Computational Geometry (1995) 14: 365. doi:10.1007/BF02570713
- 227 Views
We investigate the problem of finding the best solution satisfying all butk of the given constraints, for an abstract class of optimization problems introduced by Sharir and Welzl—the so-calledLP-type problems. We give a general algorithm and discuss its efficient implementations for specific geometric problems. For instance for the problem of computing the smallest circle enclosing all butk of the givenn points in the plane, we obtain anO(n logn+k3nε) algorithm; this improves previous results fork small compared withn but moderately growing. We also establish some results concerning general properties ofLP-type problems.