{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T12:29:33Z","timestamp":1773145773790,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642237188","type":"print"},{"value":"9783642237195","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23719-5_43","type":"book-chapter","created":{"date-parts":[[2011,8,30]],"date-time":"2011-08-30T13:14:33Z","timestamp":1314710073000},"page":"506-517","source":"Crossref","is-referenced-by-count":1,"title":["Ray-Shooting Depth: Computing Statistical Data Depth of Point Sets in the Plane"],"prefix":"10.1007","author":[{"given":"Nabil H.","family":"Mustafa","sequence":"first","affiliation":[]},{"given":"Saurabh","family":"Ray","sequence":"additional","affiliation":[]},{"given":"Mudassir","family":"Shabbir","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"7","key":"43_CR1","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1016\/j.comgeo.2010.03.002","volume":"43","author":"A. Basit","year":"2010","unstructured":"Basit, A., Mustafa, N.H., Ray, S., Raza, S.: Centerpoints and tverberg\u2019s technique. Computational Geometry: Theory and Applications\u00a043(7), 593\u2013600 (2010)","journal-title":"Computational Geometry: Theory and Applications"},{"issue":"3","key":"43_CR2","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/s00454-010-9263-2","volume":"44","author":"A. Basit","year":"2010","unstructured":"Basit, A., Mustafa, N.H., Ray, S., Raza, S.: Hitting simplices with points in \u211d3. Discrete & Computational Geometry\u00a044(3), 637\u2013644 (2010)","journal-title":"Discrete & Computational Geometry"},{"issue":"1","key":"43_CR3","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/BF00181519","volume":"17","author":"E. Boros","year":"1984","unstructured":"Boros, E., F\u00fcredi, Z.: The number of triangles covering the center of an n-set. Geometriae Dedicata\u00a017(1), 69\u201377 (1984)","journal-title":"Geometriae Dedicata"},{"key":"43_CR4","unstructured":"Chan, T.M.: An optimal randomized algorithm for maximum tukey depth. In: SODA, pp. 430\u2013436 (2004)"},{"key":"43_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511626371","volume-title":"The Discrepancy Method","author":"B. Chazelle","year":"2000","unstructured":"Chazelle, B.: The Discrepancy Method. Cambridge University Press, Cambridge (2000)"},{"issue":"4","key":"43_CR6","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1137\/0218055","volume":"18","author":"R. Cole","year":"1989","unstructured":"Cole, R., Salowe, J.S., Steiger, W.L., Szemer\u00e9di, E.: An optimal-time algorithm for slope selection. SIAM J. Comput.\u00a018(4), 792\u2013810 (1989)","journal-title":"SIAM J. Comput."},{"key":"43_CR7","doi-asserted-by":"crossref","unstructured":"Fox, J., Gromov, M., Lafforgue, V., Naor, A., Pach, J.: Overlap properties of geometric expanders. In: SODA (2011)","DOI":"10.1515\/CRELLE.2011.157"},{"key":"43_CR8","doi-asserted-by":"crossref","unstructured":"Jadhav, S., Mukhopadhyay, A.: Computing a centerpoint of a finite planar set of points in linear time. In: Symposium on Computational Geometry, pp. 83\u201390 (1993)","DOI":"10.1145\/160985.161003"},{"key":"43_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/3-540-36494-3_6","volume-title":"STACS 2003","author":"S. Langerman","year":"2003","unstructured":"Langerman, S., Steiger, W.L.: Optimization in arrangements. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol.\u00a02607, pp. 50\u201361. Springer, Heidelberg (2003)"},{"key":"43_CR10","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1214\/aos\/1176347507","volume":"18","author":"R. Liu","year":"1990","unstructured":"Liu, R.: A notion of data depth based upon random simplices. The Annals of Statistics\u00a018, 405\u2013414 (1990)","journal-title":"The Annals of Statistics"},{"issue":"7","key":"43_CR11","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1016\/j.comgeo.2007.10.004","volume":"42","author":"N.H. Mustafa","year":"2009","unstructured":"Mustafa, N.H., Ray, S.: An optimal extension of the centerpoint theorem. Computational Geometry: Theory and Applications\u00a042(7), 505\u2013510 (2009)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"43_CR12","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/0167-7152(83)90054-8","volume":"1","author":"H. Oja","year":"1983","unstructured":"Oja, H.: Descriptive statistics for multivariate distributions. Statistics and Probability Letters\u00a01, 327\u2013332 (1983)","journal-title":"Statistics and Probability Letters"},{"key":"43_CR13","first-page":"291","volume":"21","author":"R. Rado","year":"1947","unstructured":"Rado, R.: A theorem on general measure. J. London. Math. Soc.\u00a021, 291\u2013300 (1947)","journal-title":"J. London. Math. Soc."},{"key":"43_CR14","first-page":"827","volume":"8","author":"P.J. Rousseeuw","year":"1998","unstructured":"Rousseeuw, P.J., Ruts, I.: Constructing the bivariate tukey median. Statistica Sinica\u00a08, 827\u2013839 (1998)","journal-title":"Statistica Sinica"},{"key":"43_CR15","unstructured":"Tukey, J.: Mathematics and the picturing of data. In: Proc. of the International Congress of Mathematicians, pp. 523\u2013531 (1975)"},{"issue":"4","key":"43_CR16","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1073\/pnas.97.4.1423","volume":"97","author":"Y. Vardi","year":"2000","unstructured":"Vardi, Y., Zhang, C.: The multivariate L1-median and associated data depth. Proceedings of the National Academy of Sciences of the United States of America\u00a097(4), 14\u201323 (2000)","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23719-5_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T16:07:45Z","timestamp":1560528465000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23719-5_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237188","9783642237195"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23719-5_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}