Pages that link to "Item:Q1328752"

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

Displaying 34 items.

• Enclosing \(k\) points in the smallest axis parallel rectangle (Q293194) (← links)
• Minimum-area enclosing triangle with a fixed angle (Q390370) (← links)
• Minimum enclosing circle of a set of fixed points and a mobile point (Q396467) (← 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)
• 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)
• Fast algorithms for computing the smallest \(k\)-enclosing circle (Q1763156) (← links)
• Solution methodologies for the smallest enclosing circle problem (Q1810982) (← links)
• A near-linear algorithm for the planar segment-center problem (Q1816414) (← 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)
• 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)
• A reformulation-linearization based algorithm for the smallest enclosing circle problem (Q2666744) (← links)
• Quantile approximation for robust statistical estimation and \(k\)-enclosing problems (Q2708040) (← links)
• Minimum enclosing circle with few extra variables (Q2957525) (← links)
• An Efficient Geometric Solution to the Minimum Spanning Circle Problem (Q3770262) (← 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)
• Computing the smallest k-enclosing circle and related problems (Q5060125) (← links)
• Offset-polygon annulus placement problems (Q5096954) (← links)
• Geometric Applications of Posets (Q5096956) (← links)
• (Q5874507) (← links)
• Algorithms - ESA 2003 (Q5897253) (← links)
• A novel approximation algorithm for max-covering circle problem (Q6606184) (← links)