On The Heine-Borel Property and Minimum Enclosing Balls

📅 2024-12-22
🏛️ arXiv.org
📈 Citations: 0
Influential: 0
📄 PDF
🤖 AI Summary
This paper investigates the computational complexity of the Minimum Bounding Sphere (MBS) problem in metric spaces, specifically asking whether the MBS problem is LP-type—i.e., polynomial-time reducible to linear programming—in Heine–Borel weak metric spaces, possibly asymmetric. Method: The authors employ tools from linear programming theory, weak metric geometry, convex analysis, and topology to analyze the MBS problem under Hilbert, Thompson, and Funk weak metrics. Contribution/Results: They establish, for the first time, that the MBS problem is LP-type under all three weak metrics; notably, LP-type structure persists even in asymmetric settings when distance direction is fixed. They further prove rigorously that the Thompson and Hilbert metrics induce identical topologies. A general LP-type characterization framework for MBS is developed, and computable explicit primitives for the Hilbert metric are provided. These results lay a new theoretical foundation for high-dimensional optimization over cones.

Technology Category

Application Category

📝 Abstract
In this paper, we contribute a proof that minimum radius balls over metric spaces with the Heine-Borel property are always LP type. Additionally, we prove that weak metric spaces, those without symmetry, also have this property if we fix the direction in which we take their distances from the centers of the balls. We use this to prove that the minimum radius ball problem is LP type in the Hilbert and Thompson metrics and Funk weak metric. In doing so, we contribute a proof that the topology induced by the Thompson metric coincides with the Hilbert. We provide explicit primitives for computing the minimum radius ball in the Hilbert metric.
Problem

Research questions and friction points this paper is trying to address.

Prove minimum radius balls in Heine-Borel metric spaces are LP type.
Show weak metric spaces with fixed direction distances are LP type.
Establish topology equivalence between Thompson and Hilbert metrics.
Innovation

Methods, ideas, or system contributions that make the work stand out.

Prove minimum radius balls are LP type
Extend proof to weak metric spaces
Provide primitives for Hilbert metric computation
🔎 Similar Papers
No similar papers found.
H
Hridhaan Banerjee
Thomas Jefferson High School for Science and Technology, Virginia, USA
C
Carmen Isabel Day
California State University Channel Islands, California, USA
M
Megan Hunleth
Montgomery Blair High School, Silver Spring, Maryland, USA
S
Sarah Hwang
Department of Computer Science, University of Maryland, College Park, USA
A
Auguste H. Gezalyan
Department of Computer Science, University of Maryland, College Park, USA
O
Olya Golovatskaia
Mount Holyoke College, Massachusetts, USA
Nithin Parepally
Nithin Parepally
University of Maryland
Artificial IntelligenceComputational GeometryCrowd SimulationComputer Vision
L
Lucy Wang
Princeton University, New Jersey, USA
David M. Mount
David M. Mount
Professor of Computer Science, University of Maryland
Computational geometrygeometric data structures