Geometric Algorithms for Minimal Enclosing Disks in Strictly Convex Normed Planes

Authors

  • Thomas Jahn Technische Universität Chemnitz

DOI:

https://doi.org/10.11575/cdm.v12i1.62176

Keywords:

minimal enclosing disk, norm-acute triangle, norm-obtuse triangle, strictly convex normed space, Voronoi diagram

Abstract

With the geometric background provided by Alonso, Martini, and Spirova
on the location of circumcenters of triangles in normed planes, we show the validity of the Elzinga--Hearn algorithm and the Shamos--Hoey algorithm for solving the minimal enclosing disk problem in strictly convex normed planes.

References

J. Alonso, H. Martini, and M. Spirova, Minimal enclosing discs, circumcircles, and circumcenters in normed planes (Part I), Comput. Geom. 45 (2012), no. 5-6, pp. 258--274, http://dx.doi.org/10.1016/j.comgeo.2012.01.007

J. Alonso, H. Martini, and M. Spirova, Minimal enclosing discs, circumcircles, and circumcenters in normed planes (Part II), Comput. Geom. 45 (2012), no. 7, pp. 350--369, http://dx.doi.org/10.1016/j.comgeo.2012.02.003

D. Amir and Z. Ziegler, Relative Chebyshev centers in normed linear spaces, Part I, J. Approx. Theory 29 (1980), no. 3, pp. 235--252,

http://dx.doi.org/10.1016/0021-9045(80)90129-X

B. Chazelle and H. Edelsbrunner, An improved algorithm for constructing $k$th-order Voronoi diagrams, IEEE Trans. Comput. C-36 (1987), no. 11, pp 1349--1354, http://dx.doi.org/10.1109/TC.1987.5009474

L. P. Chew and R. L. S. Drysdale, Voronoi diagrams based on convex distance functions, Proceedings of the First Annual Symposium on Computational Geometry (J. O'Rourke, ed.), ACM, 1985, pp. 235--244,

http://dx.doi.org/10.1145/323233.323264

G. Chrystal, On the problem to construct the minimum circle enclosing $n$ given points in a plane, Proc. Edinburgh Math. Soc. 3 (1885), pp. 30--33.

Z. Drezner and S. Shelah, On the complexity of the Elzinga--Hearn algorithm for the $1$-center problem, Math. Oper. Res. 12 (1987), no. 2, pp. 255--261,

http://dx.doi.org/10.1287/moor.12.2.255

J. Elzinga and D. W. Hearn, Geometrical solutions for some minimax location problems, Transportation Sci. 6 (1972), no. 4, pp. 379--394,

http://dx.doi.org/10.1287/trsc.6.4.379

P. Gritzmann and V. Klee, Inner and outer $j$-radii of convex bodies in finite-dimensional normed spaces, Discrete Comput. Geom. 7 (1992), no. 1, pp. 255--280, http://dx.doi.org/10.1007/BF02187841

D. T. Lee, Two-dimensional Voronoi diagrams in the $L_p$-metric}, J. Assoc. Comput. Mach. 27 (1980), no. 4, pp. 604--618,

http://dx.doi.org/10.1145/322217.322219

D. T. Lee, On $k$-nearest neighbor Voronoi diagrams in the plane, IEEE Trans. Comput. 31 (1982), no. 6, pp. 478--487,

http://dx.doi.org/10.1109/TC.1982.1676031

L. Ma, Bisectors and Voronoi Diagrams for Convex Distance Functions, PhD thesis, Fernuniversität Hagen, 2000.

H. Martini, K. Swanepoel, and G. Wei{\ss}, The geometry of Minkowski spaces -- a survey, Part I, Expo. Math. 19 (2001), no. 2, pp. 97--142,

http://dx.doi.org/10.1016/S0723-0869(01)80025-6

N. Megiddo, Linear-time algorithms for linear programming in $\mathds{R}^3$ and related problems, SIAM J. Comput. 12 (1983), no. 4, pp. 759--776,

http://dx.doi.org/10.1137/0212052

H. Rademacher and O. Toeplitz, The Enjoyment of Math, 7th ed., Princeton University Press, Princeton, 1994.

M. I. Shamos and D. Hoey, Closest-point problems, 16th Annual Symposium on Foundations of Computer Science (Berkeley, Calif., 1975), IEEE Comput. Soc., 1975, pp. 151--162, http://dx.doi.org/10.1109/SFCS.1975.8

J. J. Sylvester, A question in the geometry of situation, Q. J. Math. 1 (1857), p. 79.

J. Väisälä, Slopes of bisectors in normed planes, Beitr. Algebra Geom. 54 (2013), no. 1, pp. 225--235, http://dx.doi.org/10.1007/s13366-012-0106-6

E.~Welzl, Smallest enclosing discs (balls and ellipsoids), New Results and New Trends in Computer Science (H.~Maurer, ed.), Lecture Notes in Computer Science, vol. 555, Springer, Berlin, 1991, pp. 359--370,

http://dx.doi.org/10.1007/BFb0038202

Downloads

Published

2017-09-27

Issue

Vol. 12 No. 1 (2017)

Section

Articles

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.