Abstract
A line is sought in the plane which minimizes the sum of the k largest (Euclidean) weighted distances from n given points. This problem generalizes the known straight-line center and median problems and, as far as the authors are aware, has not been tackled up to now. By way of geometric duality it is shown that such a line may always be found which either passes through two of the given points or lying at equal weighted distance from three of these. This allows construction of an algorithm to find all t-centrum lines for 1 ≤ t ≤ k in O((k + logn)n 3). Finally it is shown that both, the characterization of an optimal line and the algorithm, can be extended to any smooth norm.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Agarwal, P.K., Aronov, B., Sharir, M.: Computing envelopes in four dimensions with applications. SIAM J. Comput. 26, 1714–1732 (1997)
Chan, T.: Output-sensitive results on convex hulls, extreme points, and related problems. In: Proceedings of the 11th Annual Symposium on Computational Geometry, pp. 10–19 (1995)
Chazelle, B., Edelsbrunner, H.: An improved algorithm for constructing kth-order Voronoi diagrams. Trans. Comput. C-36, 1349–1354 (1987)
De Berg, M., Van Krevel, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications. Springer, New York (2000)
Díaz-Báñez, J.M., Mesa, J.A., Schöbel, A.: Continuous location of dimensional structures. Eur. J. Oper. Res. 152, 22–44 (2004)
Edelsbrunner, H.: Finding traversals for sets of simple geometric figures. Theor. Comp. Sci. 35, 55–69 (1985)
Houle, M.E., Imai, H., Imai, K., Robert, J.-M., Yamamoto, P.: Orthogonal weighted linear L 1 and L ∞ approximations and applications. Discrete Appl. Math. 43, 217–232 (1993)
Korneenko, N.M., Martini, H.: Hyperplane approximation and related topics. In: Pasch, J. (ed.) New Trends in Discrete and Computational Geometry, pp. 135–161. Springer, New York (1993)
Lee, D.T., Ching, Y.T.: The power of geometric duality revisited. Inf. Process. Lett. 21, 117–122 (1985)
Lozano, A.J., Mesa, J.A., Plastria, F.: Improved results for the k-centrum straight-line location problem. In: Proceedings of the 20th European Workshop on Computational Geometry, pp. 217–219 (2004)
MacKinnon, R., Barber, G.M.: A new approach to network generation and map representation: the linear case of the location-allocation problem. Geogr. Anal. 4, 156–168 (1972)
Martos, B.: Nonlinear Programming: Theory and Methods. North-Holland, Amsterdam (1975)
Morris, J.G., Norback, J.P.: Linear facility location-solving extensions on the basic problems. Eur. J. Oper. Res. 12, 90–94 (1983)
Nandy, S.C., Das, S., Goswami, P.P.: An efficient k nearest neighbors searching algorithm for a query line. Theor. Comp. Sci. 299, 273–288 (2003)
Plastria, F., Carrizosa, E.: Gauge-distances and median hyperplanes. J. Optim. Theory Appl. 110(1), 173–182 (2001)
Romeijn, H.E., Ahuja, R.K., Dempsey, J.F., Kumar, A.: A new linear programming approach to radiation therapy treatment planning problems. Oper. Res. 54, 201–216 (2006)
Schöbel, A.: Locating Lines and Hyperplanes-Theory and Algorithms. Kluwer Academic, Dordrecht (1999)
Sharir, M., Smorodinsky, S., Tardos, G.: An improved bound for k-sets in three dimensions. Discrete Comput. Geom. 26, 195–204 (2001)
Tamir, A.: The k-centrum multi-facility location problem. Discrete Appl. Math. 109, 293–307 (2001)
Wesolowsky, G.O.: Location of the median line for weighted points. Environ. Plann. A 7, 163–170 (1975)
Author information
Authors and Affiliations
Corresponding author
Additional information
A. J. Lozano and J. A. Mesa were partially supported by Project MCyT BFM2003-04062/MATE.
Rights and permissions
About this article
Cite this article
Lozano, A.J., Mesa, J.A. & Plastria, F. The k-Centrum Straight-line Location Problem. J Math Model Algor 9, 1–17 (2010). https://doi.org/10.1007/s10852-009-9119-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10852-009-9119-z