Median and center hyperplanes in Minkowski spaces -a unified approach

Discrete Mathematics

Volumn 241, Issue 1-3, 2001, Pages 407-426

  Martini, H ^a   Schobel, A ^b  

^a CHEMNITZ UNIVERSITY OF TECHNOLOGY   (Germany)

^b University of Koblenz Landau   (Germany)

Author keywords

Center hyperplane; Continuous location; Distance measure; Facility location; Gauges; Halving hyperplane; Helly's theorem; Linear L approximation; Linear L1 approximation; Linear programming; Median hyperplane; Minkowski space

Indexed keywords

EID: 0035965411     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(01)00126-1     Document Type: Article

References (36)

1. Th. Burger, P. Gritzmann, Finding optimal shadows of polytopes, Discrete Comput. Geom. 24 (2000) 219-239.
2. T.K. Dey, H. Edelsbrunner, Counting triangle crossings and halving planes, Discrete Comput. Geom. 12 (1994) 281-289.
3. N.N. Doroshko, The solution of two mainline problems in the plane. Manuscript, deposited in VINITI USSR, 14.06.1984, Reg.no. 39614, 1984, 15pp.
4. Z. Drezner, On minmax optimization problems, Math. Programming 22 (1982) 227-233.
5. R. Durier, C. Michelot, Geometrical properties of the Fermat-Weber problem, Eur. J. Oper. Res. 20 (1985) 332-343.
6. H. Edelsbrunner, Finding transversals for a set of simple geometric figures, Theoret. Comput. Sci. 35 (1985) 55-69.
7. E. Helly, Über Mengen konvexer Körper mit gemeinschaftlichen Punkten, Jahrbuch der Deutschen Mathematiker-Vereinigung 32 (1923) 175-176.
8. ∞ approximation and applications, Lectures Notes Comput. Sci. 382 (1989) 183-191.
9. ∞ approximation and applications, Discrete Appl. Math. 43 (1993) 217-232.
10. M.E. Houle, G.T. Toussaint, Computing the width of a set, Proceedings of the ACM Symposium on Computer Geometry, 1985, pp. 1-7.
11. N.M. Korneenko, H. Martini, Approximating finite weighted point sets by hyperplanes, Lecture Notes Comput. Sci. 447 (1990) 276-286.
12. N.M. Korneenko, H. Martini, Hyperplane approximation and related topics, in: J. Pach (Ed.), New Trends in Discrete and Computational Geometry, Algorithms and Combinatorics 10, Springer, Berlin, 1993, pp. 135-161.
13. D.T. Lee, Y.F. Wu, Geometric complexity of some location problems, Algorithmica 1 (1986) 193-211.
14. L. Lovász, On the number of halving lines, Ann. Univ. Eötvös Loránd, Sekt. Math. 14 (1971) 107-108.
15. R.F. Love, J.G. Morris, G.O. Wesolowsky, Facilities Location, North-Holland, Amsterdam, 1988 (Chapter 3.3).
16. H. Martini, A. Schöbel, Median hyperplanes in normed spaces - a survey, Discrete Appl. Math. 89 (1998) 181-195.
17. H. Martini, A. Schöbel, Two characterizations of smooth norms, Geom. Dedicata 77 (1999) 173-183.
18. N. Megiddo, Linear programming in linear time when the dimension is fixed, J. ACM 31 (1984) 114-127.
19. H. Minkowski, Gesammelte Abhandlungen, Band 2, Teubner, Leipzig, 1911, pp. 103-121.
20. J.G. Morris, J.P. Norback, A simple approach to linear facility location, Transp. Sci. 14 (1) (1980) 1-8.
21. J.G. Morris, J.P. Norback, Fitting hyperplanes by minimizing orthogonal deviations, Math. Programming 19 (1980) 102-105.
22. J.G. Morris, J.P. Norback, Linear facility location - solving extensions of the basic problem, Eur. J. Oper. Res. 12 (1983) 90-94.
23. S.C. Narula, J.F. Wellington, The minimum sum of absolute errors regression: a state of the art survey, Internat. Statist. Rev. 50 (1982) 317-326.
24. J. Pach, W. Steiger, E. Szemeredi, An upper bound on the number of planar k-sets, Discrete Comput. Geom. 7 (1992) 109-123.
25. W.H. Press, B.P. Flannery, S.A. Teulosky, W.T. Vetterling, Numerical Recipes, Cambridge University Press, Cambridge, New York, 1986.
26. J. Rice, The Approximation of Functions, Vol. 1, The Linear Theory, Addison Wesley, Reading, MA, 1964.
27. P.J. Rousseeuw, A.M. Leroy, Robust Regression and Outlier Detection, Wiley, New York, 1987.
28. A. Schöbel, Locating least-distant lines with block norms, Stud. Locational Anal. 10 (1996) 139-150.
29. A. Schöbel, Locating line segments with vertical distances, Stud. Locational Anal. 11 (1997) 143-158.
30. A. Schöbel, Locating least-distant lines in the plane, Eur. J. Oper. Res. 106 (1998) 152-159.
31. A. Schöbel, Locating Lines and Hyperplanes - Theory and Algorithms. Applied Optimization 25, Kluwer Academic Publishers, Dordrecht, 1999.
32. 1 approximation, Numer. Math. 51 (1987) 531-543.
33. A.C. Thompson, Minkowski Geometry, Cambridge University Press, Cambridge, 1996.
34. 1 linear approximation of points, Proceedings of the Fourth Annual Symposium on Computer Geometry, 1988, pp. 352-361.
35. E. Zemel, An O(n) algorithm for the linear multiple choice knapsack problem and related problems, Inform. Process. Lett. 18 (1984) 123-128.
36. R. Zivaljević, S. Vrećica, The colored Tverberg's problem and complexes of injective functions, J. Combin. Theory Ser. A 61 (1992) 309-318.