{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreiedyz3goofdgfvtbpg6wuwewj5iyj6ti7zvpp2k5pglnzhqqtr4o4",
    "uri": "at://did:plc:4rgrdigiftglskeax4wvmsev/app.bsky.feed.post/3mh7zikkjw522"
  },
  "coverImage": {
    "$type": "blob",
    "ref": {
      "$link": "bafkreiflo6xt7is6b2iafwghkjahlgggocme5jwjsbeuqqwcywuvjhmszm"
    },
    "mimeType": "image/png",
    "size": 24783
  },
  "path": "/abs/2603.15488v1",
  "publishedAt": "2026-03-17T00:00:00.000Z",
  "site": "https://arxiv.org",
  "tags": [
    "Ariel Goodwin",
    "Adrian S. Lewis"
  ],
  "textContent": "**Authors:** Ariel Goodwin, Adrian S. Lewis\n\nAlgorithms 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"
}