Geometric Algorithms for Minimal Enclosing Discs in Strictly Convex Normed Planes
classification
🧮 math.MG
cs.CG
keywords
normedplanesalgorithmconvexenclosinggeometricminimalstrictly
read the original abstract
With the geometric background provided by Alonso, Martini, and Spirova on the location of circumcenters of triangles in normed planes, we show the validity of the Elzinga--Hearn algorithm and the Shamos--Hoey algorithm for solving the minimal enclosing disk problem in strictly convex normed planes.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.