Fast algorithms for computing the smallest \(k\)-enclosing circle

DOI10.1007/s00453-004-1123-0zbMath1069.68117OpenAlexW2024517791MaRDI QIDQ1763156

Soham Mazumdar, Sariel Har-Peled

Publication date: 21 February 2005

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-004-1123-0

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Randomized algorithms (68W20)

Related Items

Efficient Speed-Up of the Smallest Enclosing Circle Algorithm, Cause I'm a genial imprecise point: outlier detection for uncertain data, AN ALGORITHMIC FRAMEWORK FOR SOLVING GEOMETRIC COVERING PROBLEMS — WITH APPLICATIONS, Computational complexity and approximation for a generalization of the Euclidean problem on the Chebyshev center, Approximating the smallest \(k\)-enclosing geodesic disc in a simple polygon, FITTING FLATS TO POINTS WITH OUTLIERS, Hausdorff matching and Lipschitz optimization, Discrete Voronoi games and \(\epsilon\)-nets, in two and three dimensions, GEODESIC DISKS AND CLUSTERING IN A SIMPLE POLYGON, Enclosing weighted points with an almost-unit ball, Placing Text Boxes on Graphs, Region-restricted clustering for geographic data mining, Smallest \(k\)-enclosing rectangle revisited, Smallest k-enclosing rectangle revisited, Complexity and approximation of the smallest \(k\)-enclosing ball problem, APPROXIMATE BREGMAN NEAR NEIGHBORS IN SUBLINEAR TIME: BEYOND THE TRIANGLE INEQUALITY