Saved in:
Bibliographic Details
Main Authors: Goodwin, Ariel, Lewis, Adrian S.
Format: Preprint
Published: 2026
Subjects:
Online Access:https://arxiv.org/abs/2603.15488
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866913008995794944
author Goodwin, Ariel
Lewis, Adrian S.
author_facet Goodwin, Ariel
Lewis, Adrian S.
contents Algorithms for minimal enclosing ball problems are often geometric in nature. To highlight the metric ingredients underlying their efficiency, we focus here on a particularly simple geodesic-based method. A recent subgradient-based study proved a complexity result for this method in the broad setting of geodesic spaces of nonpositive curvature. We present a simpler, intuitive and self-contained complexity analysis in that setting, which also improves the convergence rate. We furthermore derive the first complexity result for the algorithm on geodesic spaces with curvature bounded above.
format Preprint
id arxiv_https___arxiv_org_abs_2603_15488
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Minimal enclosing balls via geodesics
Goodwin, Ariel
Lewis, Adrian S.
Optimization and Control
Computational Geometry
90C48, 65Y20, 51-08, 53C22, 68Q25
G.1.6
Algorithms for minimal enclosing ball problems are often geometric in nature. To highlight the metric ingredients underlying their efficiency, we focus here on a particularly simple geodesic-based method. A recent subgradient-based study proved a complexity result for this method in the broad setting of geodesic spaces of nonpositive curvature. We present a simpler, intuitive and self-contained complexity analysis in that setting, which also improves the convergence rate. We furthermore derive the first complexity result for the algorithm on geodesic spaces with curvature bounded above.
title Minimal enclosing balls via geodesics
topic Optimization and Control
Computational Geometry
90C48, 65Y20, 51-08, 53C22, 68Q25
G.1.6
url https://arxiv.org/abs/2603.15488