Geometric Algorithms for Minimal Enclosing Discs in Strictly Convex Normed Planes
Metric Geometry
2015-04-29 v2 Computational Geometry
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.
Keywords
Cite
@article{arxiv.1410.4725,
title = {Geometric Algorithms for Minimal Enclosing Discs in Strictly Convex Normed Planes},
author = {Thomas Jahn},
journal= {arXiv preprint arXiv:1410.4725},
year = {2015}
}
Comments
submitted to "Contributions to Discrete Mathematics"