Pages that link to "Item:Q750173"
From MaRDI portal
The following pages link to A simple algorithm for computing the smallest enclosing circle (Q750173):
Displaying 10 items.
- A calculation method of plant similarity giving consideration to different plant features (Q304601) (← links)
- Potential theory and geometry of the farthest distance function (Q380030) (← links)
- A recursive algorithm for finding the minimum covering sphere of a polytope and the minimum covering concentric spheres of several polytopes (Q689920) (← links)
- On the all-farthest-segments problem for a planar set of points (Q845846) (← links)
- Calculating a minimal sphere containing a polytope defined by a system of linear inequalities (Q1326513) (← links)
- Minimal ellipsoid circumscribing a polytope defined by a system of linear inequalities (Q2494476) (← 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)
- The Lazy Travelling Salesman Problem in $\mathbb{R}^2$ (Q5428417) (← links)
- A fast solver for the narrow capture and narrow escape problems in the sphere (Q6145389) (← links)
