{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T22:58:34Z","timestamp":1763765914494},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,11,16]],"date-time":"2011-11-16T00:00:00Z","timestamp":1321401600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2012,3]]},"DOI":"10.1007\/s00454-011-9380-6","type":"journal-article","created":{"date-parts":[[2011,11,16]],"date-time":"2011-11-16T07:13:55Z","timestamp":1321427635000},"page":"329-346","source":"Crossref","is-referenced-by-count":3,"title":["The Projection Median of a Set of Points in \u211d d"],"prefix":"10.1007","volume":"47","author":[{"given":"Riddhipratim","family":"Basu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bhaswar B.","family":"Bhattacharya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tanmoy","family":"Talukdar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,11,16]]},"reference":[{"issue":"4","key":"9380_CR1","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF01293483","volume":"13","author":"P.K. Agarwal","year":"1995","unstructured":"Agarwal, P.K., Matou\u0161ek, J.: Dynamic half-space range reporting and its applications. Algorithmica 13(4), 325\u2013345 (1995)","journal-title":"Algorithmica"},{"key":"9380_CR2","volume-title":"Probability and Measure Theory","author":"R.B. Ash","year":"1999","unstructured":"Ash, R.B., Dol\u00e9ans-Dade, C.A.: Probability and Measure Theory, 2nd edn. Academic Press, New\u00a0York (1999)","edition":"2"},{"key":"9380_CR3","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF02187906","volume":"3","author":"C. Bajaj","year":"1988","unstructured":"Bajaj, C.: The algebraic degree of geometric optimization problems. Discrete Comput. Geom. 3, 177\u2013191 (1988)","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"9380_CR4","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s11036-006-4470-z","volume":"11","author":"S. Bereg","year":"2006","unstructured":"Bereg, S., Bhattacharya, B., Kirkpatrick, D., Segal, M.: Competitive algorithms for mobile centers. Mob. Netw. Appl. 11(2), 177\u2013186 (2006)","journal-title":"Mob. Netw. Appl."},{"issue":"1","key":"9380_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/363647.363652","volume":"48","author":"T.M. Chan","year":"2001","unstructured":"Chan, T.M.: Dynamic planar convex hull operations in near-logarithmic amortized time. J. ACM 48(1), 1\u201312 (2001)","journal-title":"J. ACM"},{"key":"9380_CR6","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/PL00009354","volume":"19","author":"T. Dey","year":"1998","unstructured":"Dey, T.: Improved bounds on planar k-sets and related problems. Discrete Comput. Geom. 19, 373\u2013382 (1998)","journal-title":"Discrete Comput. Geom."},{"key":"9380_CR7","first-page":"157","volume-title":"A Festschrift for Erich L. Lehmann","author":"D. Donoho","year":"1983","unstructured":"Donoho, D., Huber, P.: The notion of breakdown point. In: Bickel, P., Doksum, K., Hodges, J. (eds.) A Festschrift for Erich L. Lehmann (Belmont, California), pp. 157\u2013184. Wadsworth International Group, Belmont (1983)"},{"key":"9380_CR8","unstructured":"Durocher, S.: Geometric facility location under continuous motion: Bounded-velocity approximations to the mobile Euclidean k-centre and k-median problems. Ph.D. Thesis, University of British Columbia, Canada (2006)"},{"issue":"5","key":"9380_CR9","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1016\/j.comgeo.2008.06.006","volume":"42","author":"S. Durocher","year":"2009","unstructured":"Durocher, S., Kirkpatrick, D.: The projection median of a set of points. Comput. Geom. 42(5), 364\u2013375 (2009)","journal-title":"Comput. Geom."},{"key":"9380_CR10","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1137\/0215019","volume":"15","author":"H. Edelsbrunner","year":"1986","unstructured":"Edelsbrunner, H., Welzl, E.: Constructing belts in two-dimensional arrangements with applications. SIAM J. Comput. 15, 271\u2013284 (1986)","journal-title":"SIAM J. Comput."},{"key":"9380_CR11","volume-title":"Tables of Integrals, Series, and Products","author":"I.S. Gradshteyn","year":"1980","unstructured":"Gradshteyn, I.S., Ryzhik, I.M.: Tables of Integrals, Series, and Products. Academic Press, Orlando (1980)"},{"key":"9380_CR12","series-title":"Cambridge Mathematical Library","volume-title":"Inequalities","author":"G.H. Hardy","year":"1988","unstructured":"Hardy, G.H., Littlewood, J.E., P\u00f3lya, G.: Inequalities. Cambridge Mathematical Library. Cambridge University Press, Cambridge (1988) (Reprint of the 1952 edition)"},{"key":"9380_CR13","first-page":"47","volume":"8","author":"J. Hayford","year":"1902","unstructured":"Hayford, J.: What is the center of an area, or the center of a population? J. Am. Stat. Assoc. 8, 47\u201358 (1902)","journal-title":"J. Am. Stat. Assoc."},{"issue":"3","key":"9380_CR14","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1093\/imaman\/8.3.215","volume":"8","author":"J. Krarup","year":"1997","unstructured":"Krarup, J., Vajda, S.: On Torricelli\u2019s geometrical solution to a problem of Fermat. IMA J. Manag. Math. 8(3), 215\u2013224 (1997)","journal-title":"IMA J. Manag. Math."},{"key":"9380_CR15","first-page":"55","volume":"6","author":"Y.S. Kupitz","year":"1997","unstructured":"Kupitz, Y.S., Martini, H.: Geometric aspects of the generalized Fermat\u2013Torricelli problem. Intuit. Geom. 6, 55\u2013127 (1997). Bolyai Society Mathematical Studies, Budapest","journal-title":"Intuit. Geom."},{"key":"9380_CR16","series-title":"Twenty Years Later, Contemporary Mathematics","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1090\/conm\/453\/08804","volume-title":"Surveys on Discrete and Computational Geometry","author":"G. Nivasch","year":"2008","unstructured":"Nivasch, G.: An improved, simple construction of many halving edges. In: Goodman, J.E., Pach, J., Pollack, R. (eds.) Surveys on Discrete and Computational Geometry, Twenty Years Later, Contemporary Mathematics, vol.\u00a0453, pp.\u00a0299\u2013305. AMS, Providence (2008). http:\/\/en.wikipedia.org\/wiki\/N-sphere"},{"key":"9380_CR17","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/978-94-009-5438-0_20","volume-title":"Mathematical Statistics and Applications","author":"P. Rousseeuw","year":"1985","unstructured":"Rousseeuw, P.: Multivariate estimation with high breakdown point. In: Grossman, W., Pug, G., Vincze, I., Wertz, W. (eds.) Mathematical Statistics and Applications, vol.\u00a0B, pp. 283\u2013297. Reidel, Dordrecht (1985)"},{"key":"9380_CR18","volume-title":"Real Analysis","author":"H.L. Royden","year":"1988","unstructured":"Royden, H.L.: Real Analysis, 3rd edn. Pearson Education, Upper Saddle River (1988)","edition":"3"},{"issue":"1","key":"9380_CR19","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1017\/S0963548310000143","volume":"20","author":"M. Sharir","year":"2011","unstructured":"Sharir, M.: An improved bound for k-sets in four dimensions. Comb. Probab. Comput. 20(1), 119\u2013129 (2011)","journal-title":"Comb. Probab. Comput."},{"key":"9380_CR20","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/s00454-001-0005-3","volume":"26","author":"M. Sharir","year":"2001","unstructured":"Sharir, M., Smorodinsky, S., Tardos, G.: An improved bound for k-sets in three dimensions. Discrete Comput. Geom. 26, 195\u2013204 (2001)","journal-title":"Discrete Comput. Geom."},{"key":"9380_CR21","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/s004540010022","volume":"26","author":"G. T\u00f3th","year":"2001","unstructured":"T\u00f3th, G.: Point sets with many k-sets. Discrete Comput. Geom. 26, 187\u2013194 (2001)","journal-title":"Discrete Comput. Geom."},{"key":"9380_CR22","unstructured":"Weber, A.: Uber Den Standord Der Industrien. Tubigen (1909). English Translation by C.J. Freidrich, Chicago University Press (1929)"},{"key":"9380_CR23","first-page":"5","volume":"1","author":"G. Wesolowsky","year":"1993","unstructured":"Wesolowsky, G.: The Weber problem: History and perspective. Location Sci. 1, 5\u201323 (1993)","journal-title":"Location Sci."},{"key":"9380_CR24","first-page":"355","volume":"43","author":"E. Weiszfeld","year":"1937","unstructured":"Weiszfeld, E.: Sur le point pour lequel la somme des distances de n points donn\u00e9s est minimum. Tohoku Math. J. 43, 355\u2013386 (1937)","journal-title":"Tohoku Math. J."}],"container-title":["Discrete &amp; Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-011-9380-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-011-9380-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-011-9380-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T19:50:34Z","timestamp":1559073034000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-011-9380-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11,16]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,3]]}},"alternative-id":["9380"],"URL":"https:\/\/doi.org\/10.1007\/s00454-011-9380-6","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,11,16]]}}}