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 16 items.
- Computational complexity and approximation for a generalization of the Euclidean problem on the Chebyshev center (Q378186) (← links)
- Discrete Voronoi games and \(\epsilon\)-nets, in two and three dimensions (Q679740) (← links)
- Cause I'm a genial imprecise point: outlier detection for uncertain data (Q831712) (← links)
- Enclosing weighted points with an almost-unit ball (Q990963) (← links)
- Region-restricted clustering for geographic data mining (Q1000925) (← links)
- Smallest \(k\)-enclosing rectangle revisited (Q2046452) (← links)
- Complexity and approximation of the smallest \(k\)-enclosing ball problem (Q2346580) (← links)
- Hausdorff matching and Lipschitz optimization (Q2457916) (← 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)
- Smallest k-enclosing rectangle revisited (Q5088950) (← links)
- FITTING FLATS TO POINTS WITH OUTLIERS (Q5388712) (← links)
- Approximating the smallest \(k\)-enclosing geodesic disc in a simple polygon (Q6179409) (← links)