Ball hulls, ball intersections, and 2-center problems for gauges
DOI:
https://doi.org/10.11575/cdm.v12i2.62481Keywords:
(asymmetric) convex distance function, ball hull, ball intersection, closed convex curves, Davenport-Schinzel sequences, gauge, normed space, 2-center problemAbstract
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.
References
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.
Downloads
Published
Issue
Section
License
This copyright statement was adapted from the statement for the University of Calgary Repository and from the statement for the Electronic Journal of Combinatorics (with permission).
The copyright policy for Contributions to Discrete Mathematics (CDM) is changed for all articles appearing in issues of the journal starting from Volume 15 Number 3.
Author(s) retain copyright over submissions published starting from Volume 15 number 3. When the author(s) indicate approval of the finalized version of the article provided by the technical editors of the journal and indicate approval, they grant to Contributions to Discrete Mathematics (CDM) a world-wide, irrevocable, royalty free, non-exclusive license as described below:
The author(s) grant to CDM the right to reproduce, translate (as defined below), and/or distribute the material, including the abstract, in print and electronic format, including but not limited to audio or video.
The author(s) agree that the journal may translate, without changing the content the material, to any medium or format for the purposes of preservation.
The author(s) also agree that the journal may keep more than one copy of the article for the purposes of security, back-up, and preservation.
In granting the journal this license the author(s) warrant that the work is their original work and that they have the right to grant the rights contained in this license.
The authors represent that the work does not, to the best of their knowledge, infringe upon anyone’s copyright.
If the work contains material for which the author(s) do not hold copyright, the author(s) represent that the unrestricted permission of the copyright holder(s) to grant CDM the rights required by this license has been obtained, and that such third-party owned material is clearly identified and acknowledged within the text or content of the work.
The author(s) agree to ensure, to the extent reasonably possible, that further publication of the Work, with the same or substantially the same content, will acknowledge prior publication in CDM.
The journal highly recommends that the work be published with a Creative Commons license. Unless otherwise arranged at the time the finalized version is approved and the licence granted with CDM, the work will appear with the CC-BY-ND logo. Here is the site to get more detail, and an excerpt from the site about the CC-BY-ND. https://creativecommons.org/licenses/
Attribution-NoDerivs
CC BY-ND
This license lets others reuse the work for any purpose, including commercially; however, it cannot be shared with others in adapted form, and credit must be provided to you.