Pages that link to "Item:Q1328752"
From MaRDI portal
The following pages link to Computing the smallest \(k\)-enclosing circle and related problems (Q1328752):
Displaying 18 items.
- Minimum-area enclosing triangle with a fixed angle (Q390370) (← links)
- On enclosing k points by a circle (Q674185) (← 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)
- Selecting distances in arrangements of hyperplanes spanned by points. (Q878011) (← 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)
- A near-linear algorithm for the planar segment-center problem (Q1816414) (← links)
- On the geometry of the smallest circle enclosing a finite set of points (Q2382759) (← links)
- Covering points with a polygon (Q2477192) (← links)
- Translating a convex polygon to contain a maximum number of points. (Q2482905) (← links)
- Computing the Smallest T-Shaped Polygon Containing k Points (Q4780527) (← links)
- THE LARGEST EMPTY ANNULUS PROBLEM (Q4818587) (← links)
- Efficient Speed-Up of the Smallest Enclosing Circle Algorithm (Q5040739) (← links)
- Offset-polygon annulus placement problems (Q5096954) (← links)
- Geometric Applications of Posets (Q5096956) (← links)
- (Q5874507) (← links)
