ALGORITHMS FOR BALL HULLS AND BALL INTERSECTIONS IN NORMED PLANES
From MaRDI portal
Publication:2970416
DOI10.20382/jocg.v6i1a4zbMath1408.52025arXiv1411.7159OpenAlexW1867441699MaRDI QIDQ2970416
Pedro Martín Jiménez, Horst Martini
Publication date: 30 March 2017
Full work available at URL: https://arxiv.org/abs/1411.7159
Analysis of algorithms and problem complexity (68Q25) Computational aspects related to convexity (52B55) Convexity and finite-dimensional Banach spaces (including special norms, zonoids, etc.) (aspects of convex geometry) (52A21)
Related Items (2)
Geometric clustering in normed planes ⋮ New exact algorithms for planar maximum covering location by ellipses problems
This page was built for publication: ALGORITHMS FOR BALL HULLS AND BALL INTERSECTIONS IN NORMED PLANES