A simple algorithm for computing the smallest enclosing circle
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- A linear-time algorithm for computing the Voronoi diagram of a convex polygon
- An efficient algorithm for determining the convex hull of a finite planar set
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
Cited in
(15)- A reformulation-linearization based algorithm for the smallest enclosing circle problem
- A fast solver for the narrow capture and narrow escape problems in the sphere
- The Lazy Travelling Salesman Problem in $\mathbb{R}^2$
- An efficient cutting plane algorithm for the smallest enclosing circle problem
- Potential theory and geometry of the farthest distance function
- A fast deterministic smallest enclosing disk approximation algorithm
- Calculating a minimal sphere containing a polytope defined by a system of linear inequalities
- A recursive algorithm for finding the minimum covering sphere of a polytope and the minimum covering concentric spheres of several polytopes
- APPROXIMATING SMALLEST ENCLOSING BALLS WITH APPLICATIONS TO MACHINE LEARNING
- On the all-farthest-segments problem for a planar set of points
- An optimal algorithm for finding minimal enclosing triangles
- Minimal ellipsoid circumscribing a polytope defined by a system of linear inequalities
- A calculation method of plant similarity giving consideration to different plant features
- Quantile approximation for robust statistical estimation and \(k\)-enclosing problems
- Efficient Speed-Up of the Smallest Enclosing Circle Algorithm
This page was built for publication: A simple algorithm for computing the smallest enclosing circle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q750173)
