A simple algorithm for computing the smallest enclosing circle

DOI10.1016/0020-0190(91)90030-LzbMath0713.68097WikidataQ55968889 ScholiaQ55968889MaRDI QIDQ750173

Sven Skyum

Publication date: 1991

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

analysis of algorithmscomputational geometry

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)

Related Items (12)

Calculating a minimal sphere containing a polytope defined by a system of linear inequalities ⋮ Efficient Speed-Up of the Smallest Enclosing Circle Algorithm ⋮ A calculation method of plant similarity giving consideration to different plant features ⋮ On the all-farthest-segments problem for a planar set of points ⋮ Potential theory and geometry of the farthest distance function ⋮ 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 ⋮ QUANTILE APPROXIMATION FOR ROBUST STATISTICAL ESTIMATION AND k-ENCLOSING PROBLEMS ⋮ A recursive algorithm for finding the minimum covering sphere of a polytope and the minimum covering concentric spheres of several polytopes ⋮ The Lazy Travelling Salesman Problem in $\mathbb{R}^2$ ⋮ Minimal ellipsoid circumscribing a polytope defined by a system of linear inequalities ⋮ APPROXIMATING SMALLEST ENCLOSING BALLS WITH APPLICATIONS TO MACHINE LEARNING

Cites Work

• Unnamed Item
• 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

This page was built for publication: A simple algorithm for computing the smallest enclosing circle