{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T05:34:35Z","timestamp":1772516075191,"version":"3.50.1"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,4,15]],"date-time":"2009-04-15T00:00:00Z","timestamp":1239753600000},"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":[[2009,10]]},"DOI":"10.1007\/s00454-009-9163-5","type":"journal-article","created":{"date-parts":[[2009,4,14]],"date-time":"2009-04-14T13:33:56Z","timestamp":1239716036000},"page":"343-358","source":"Crossref","is-referenced-by-count":6,"title":["Intersecting Convex Sets by Rays"],"prefix":"10.1007","volume":"42","author":[{"given":"Radoslav","family":"Fulek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas F.","family":"Holmsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00e1nos","family":"Pach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,4,15]]},"reference":[{"key":"9163_CR1","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BF02187724","volume":"4","author":"N. Alon","year":"1989","unstructured":"Alon, N., Katchalski, M., Pulleyblank, W.R.: Cutting disjoint disks by straight lines. Discrete Comput. Geom. 4, 239\u2013243 (1989)","journal-title":"Discrete Comput. Geom."},{"key":"9163_CR2","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/PL00009502","volume":"23","author":"N. Amenta","year":"2000","unstructured":"Amenta, N., Bern, M., Eppstein, D., Teng, S.-H.: Regression depth and center points. Discrete Comput. Geom. 23, 305\u2013323 (2000)","journal-title":"Discrete Comput. Geom."},{"key":"9163_CR3","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1080\/00029890.1963.11992093","volume":"70","author":"A.S. Besicovitch","year":"1963","unstructured":"Besicovitch, A.S.: The Kakeya problem. Am. Math. Mon. 70, 697\u2013706 (1963)","journal-title":"Am. Math. Mon."},{"key":"9163_CR4","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1080\/00029890.1969.12000319","volume":"76","author":"G.D. Chakerian","year":"1969","unstructured":"Chakerian, G.D.: Intersection and covering properties of convex sets. Am. Math. Mon. 76, 753\u2013766 (1969)","journal-title":"Am. Math. Mon."},{"key":"9163_CR5","doi-asserted-by":"crossref","unstructured":"Fulek, R.: Intersecting convex sets by rays. Master\u2019s thesis. School of Computing Science, Simon Fraser University (2008)","DOI":"10.1145\/1377676.1377740"},{"issue":"1","key":"9163_CR6","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/BF02574382","volume":"12","author":"S. Jadhav","year":"1994","unstructured":"Jadhav, S., Mukhopadhyay, A.: Computing a centerpoint of a finite planar set of points in linear time. Discrete Comput. Geom. 12(1), 291\u2013312 (1994)","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"9163_CR7","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/s00454-003-0011-x","volume":"30","author":"S. Langerman","year":"2003","unstructured":"Langerman, S., Steiger, W.: The complexity of hyperplane depth in the plane. Discrete Comput. Geom. 30(2), 299\u2013399 (2003)","journal-title":"Discrete Comput. Geom."},{"key":"9163_CR8","unstructured":"Liu, Ch.-Ts., Hung, T.-Y.: Method of building a locating service for a wireless network environment, patent no. 7203504, April 2007. See www.freepatentsonline.com\/7203504.html"},{"key":"9163_CR9","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0039-7","volume-title":"Lectures on Discrete Geometry","author":"J. Matou\u0161ek","year":"2002","unstructured":"Matou\u0161ek, J.: Lectures on Discrete Geometry. Graduate Texts in Mathematics, vol.\u00a0212. Springer, Berlin (2002)"},{"key":"9163_CR10","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/PL00009452","volume":"22","author":"P.J. Rousseeuw","year":"1999","unstructured":"Rousseeuw, P.J., Hubert, M.: Depth in an arrangement of hyperplanes. Discrete Comput. Geom. 22, 167\u2013176 (1999)","journal-title":"Discrete Comput. Geom."},{"key":"9163_CR11","unstructured":"Urrutia, J.: Personal communication, Guanajuato, February 2007"}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-009-9163-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-009-9163-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-009-9163-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T19:47:37Z","timestamp":1559072857000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-009-9163-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,4,15]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,10]]}},"alternative-id":["9163"],"URL":"https:\/\/doi.org\/10.1007\/s00454-009-9163-5","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,4,15]]}}}