### Ball hulls, ball intersections, and 2-center problems for gauges

#### Abstract

The notions of ball hull and ball intersection of nite sets, important in Banach space theory, are extended from normed planes to generalized normed planes, i.e., to (asymmetric) convex distance functions which are also called gauges. In this more general setting we derive various new results about these notions and their relations to each other. Further on, we extend the known 2-center problem and a modified version of it from the Euclidean situation to norms and gauges or, in other words, from Euclidean circles to arbitrary closed convex curves. We derive algorithmical results on the construction of ball hulls and ball intersections, and computational approaches to the 2-center problem with constrained circles and, in case of strictly convex norms and gauges, for the fixed 2-center problem are also given.

#### Keywords

#### Full Text:

PDF#### References

P. K. Agarwal and M. Sharir, Planar geometric location problems, Algorithmica 11 (1994), 185-195.

P. K. Agarwal, M. Sharir, and P. Shor, Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences, Journal of Combinatorial Theory, Series A 52 (1989), 228-274.

P. K. Agarwal, M. Sharir, and E. Welzl, The discrete 2-center problem, Discrete Comput. Geom. 20 (1998), 287-305.

J. Alonso, H. Martini, and M. Spirova, Minimal enclosing discs, circumcircles, and circumcenters in normed planes (Part I), Comput. Geom. 45 (2012), 258-274.

S. Bespamyatnikh and D. Kirkpatrick, Rectilinear 2-center problems, in Proc. 11th Canadian Conference on Computational Geometry (CCCG'99), 1999, pp. 68-71.

K. Bezdek, From the Kneser-Poulsen conjecture to ball-polyhedra, European J. Combin. 29 (2008), 1820-1830.

K. Bezdek, Classical topics in discrete geometry, CMS Books in Mathematics, Springer, New York, 2010.

K. Bezdek, Lectures on sphere arrangements - the discrete geometric side, Fields Institute Monographs, vol. 32, Springer, New York, 2013.

K. Bezdek, Z. Langi, M. Naszodi, and P. Papez, Ball-polyhedra, Discrete Comput. Geom. 38 (2007), 201-230.

T. Chan, More planar two-center algorithms, Comput. Geom. 13 (1999), 189-198.

D. Eppstein, Faster construction of planar two-centers, in Proc. 8th ACM-SIAM Sympos. Discrete Algorithms, 1997, pp. 131-138.

E. Fogel, D. Halperin, L. Kettner, M. Teillaud, R. Wein, and N. Wolpert, Elective computational geometry for curves and surfaces, Mathematics and Visualization, ch. Arrangements, pp. 1-66, Springer-Verlag, 2006.

P. Gritzmann and V. L. Klee, On the complexity of some basic problems in computational convexity: I. Containment problems, Discrete Math. 136 (1994), 129-174.

J. Hershberger, A faster algorithm for the two-center decision problem, Inform. Process. Lett. 47 (1993), 23-29.

J. Hershberger and S. Suri, Finding tailored partitions, J. Algorithms 12 (1991), 431-463.

M. J. Katz, K. Kedem, and M. Segal, Discrete rectilinear 2-center problem, Comput. Geom. 15 (2000), 203-214.

M. T. Ko and Y. T. Ching, Linear time algorithms for the weighted tailored 2-partition and the weighted 2-center problem under l1-distance, Discrete Appl. Math. 40 (1992), 397-410.

Y. S. Kupitz, H. Martini, and M. A. Perles, Ball polytopes and the Vazsonyi problem, Acta Math. Hungar. 126 (2010), 99-163.

P. Martin and H. Martini, Algorithms for ball hulls and ball intersections in normed planes, Journal of Computational Geometry 6 (2015), 99{107.

P. Martin, H. Martini, and M. Spirova, Chebyshev sets and ball operators, J. Convex Anal. 21 (2014), 601-618.

H. Martini, P. L. Papini, and M. Spirova, Complete sets and completion of sets in Banach spaces, Monatsh. Math. 174 (2014), 587-597.

H. Martini, C. Richter, and M. Spirova, Intersections of balls and sets of constant width in nite-dimensional normed spaces, Mathematika 59 (2013), 477-492.

H. Martini, K. J. Swanepoel, and G. Weiss, Expositiones math., The geometry of Minkowski spaces - a survey, Part I 19 (2001), 97-142.

J. Matousek, Lectures on discrete geometry, Graduate Texts in Mathematics, vol. 212, Springer, New York, 2002.

M. Sharir, A near-linear algorithm for the planar 2-center problem, Discrete Comput. Geom. 18 (1997), 125-134.

**PID: http://hdl.handle.net/10515/sy5v98086**