A simpler complexity analysis for a geodesic minimal-enclosing-ball algorithm improves the convergence rate in nonpositive-curvature spaces and yields the first rate for spaces with curvature bounded above.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Minimal enclosing balls via geodesics
A simpler complexity analysis for a geodesic minimal-enclosing-ball algorithm improves the convergence rate in nonpositive-curvature spaces and yields the first rate for spaces with curvature bounded above.