Pages that link to "Item:Q1328752"

The following pages link to Computing the smallest \(k\)-enclosing circle and related problems (Q1328752):

Displayed 8 items.

• On enclosing k points by a circle (Q674185) ‎ (← 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)
• Computing the Smallest T-Shaped Polygon Containing k Points (Q4780527) ‎ (← links)
• THE LARGEST EMPTY ANNULUS PROBLEM (Q4818587) ‎ (← links)