Pages that link to "Item:Q1763156"
From MaRDI portal
The following pages link to Fast algorithms for computing the smallest \(k\)-enclosing circle (Q1763156):
Displaying 29 items.
- Computational complexity and approximation for a generalization of the Euclidean problem on the Chebyshev center (Q378186) (← links)
- On enclosing k points by a circle (Q674185) (← links)
- Discrete Voronoi games and \(\epsilon\)-nets, in two and three dimensions (Q679740) (← links)
- A simple algorithm for computing the smallest enclosing circle (Q750173) (← links)
- Cause I'm a genial imprecise point: outlier detection for uncertain data (Q831712) (← links)
- A fast deterministic smallest enclosing disk approximation algorithm (Q835047) (← links)
- Fast computation of smallest enclosing circle with center on a query line segment (Q975487) (← links)
- Enclosing weighted points with an almost-unit ball (Q990963) (← links)
- Region-restricted clustering for geographic data mining (Q1000925) (← links)
- Computing the smallest \(k\)-enclosing circle and related problems (Q1328752) (← links)
- Some variations on constrained minimum enclosing circle problem (Q1944391) (← links)
- Smallest \(k\)-enclosing rectangle revisited (Q2046452) (← links)
- Complexity and approximation of the smallest \(k\)-enclosing ball problem (Q2346580) (← links)
- Fast computation of the circular map (Q2355285) (← links)
- An efficient cutting plane algorithm for the smallest enclosing circle problem (Q2358480) (← links)
- Hausdorff matching and Lipschitz optimization (Q2457916) (← links)
- Quantile approximation for robust statistical estimation and \(k\)-enclosing problems (Q2708040) (← links)
- Approximate Bregman near neighbors in sublinear time: beyond the triangle inequality (Q2875644) (← links)
- An algorithmic framework for solving geometric covering problems -- with applications (Q2929639) (← links)
- Placing Text Boxes on Graphs (Q3611861) (← links)
- GEODESIC DISKS AND CLUSTERING IN A SIMPLE POLYGON (Q4650081) (← links)
- Efficient Speed-Up of the Smallest Enclosing Circle Algorithm (Q5040739) (← links)
- Computing the smallest k-enclosing circle and related problems (Q5060125) (← links)
- Smallest k-enclosing rectangle revisited (Q5088950) (← links)
- FITTING FLATS TO POINTS WITH OUTLIERS (Q5388712) (← links)
- Algorithms - ESA 2003 (Q5897253) (← links)
- Algorithms - ESA 2003 (Q5897282) (← links)
- Computational Science and Its Applications – ICCSA 2004 (Q5901266) (← links)
- A novel approximation algorithm for max-covering circle problem (Q6606184) (← links)
