2000 character limit reached
Geometric Algorithms for Minimal Enclosing Discs in Strictly Convex Normed Planes (1410.4725v2)
Published 17 Oct 2014 in math.MG and cs.CG
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.