Pages that link to "Item:Q1327455"
From MaRDI portal
The following pages link to Iterated nearest neighbors and finding minimal polytopes (Q1327455):
Displayed 17 items.
- Region-restricted clustering for geographic data mining (Q1000925) (← links)
- Optimal placement of convex polygons to maximize point containment (Q1265324) (← links)
- Offset-polygon annulus placement problems (Q1276941) (← links)
- Geometric applications of posets (Q1276942) (← links)
- Dynamic Euclidean minimum spanning trees and extrema of binary functions (Q1346130) (← links)
- On nearest-neighbor graphs (Q1355198) (← links)
- Faster geometric \(k\)-point MST approximation (Q1370933) (← links)
- Compact location problems (Q1391322) (← links)
- Extending range queries and nearest neighbors (Q1841241) (← links)
- Algorithms for proximity problems in higher dimensions (Q1917037) (← links)
- On finding a large number of 3D points with a small diameter (Q2457016) (← links)
- Covering points with a polygon (Q2477192) (← links)
- Translating a convex polygon to contain a maximum number of points. (Q2482905) (← links)
- QUANTILE APPROXIMATION FOR ROBUST STATISTICAL ESTIMATION AND k-ENCLOSING PROBLEMS (Q2708040) (← links)
- EFFICIENT APPROXIMATION ALGORITHMS FOR TWO-LABEL POINT LABELING (Q4682165) (← links)
- Computing the Smallest T-Shaped Polygon Containing k Points (Q4780527) (← links)
- POINT SET LABELING WITH SPECIFIED POSITIONS (Q4818545) (← links)