{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:36:46Z","timestamp":1750307806746,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":10,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,6,9]],"date-time":"2008-06-09T00:00:00Z","timestamp":1212969600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2008,6,9]]},"DOI":"10.1145\/1377676.1377740","type":"proceedings-article","created":{"date-parts":[[2008,6,10]],"date-time":"2008-06-10T14:13:22Z","timestamp":1213107202000},"page":"385-391","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Intersecting convex sets by rays"],"prefix":"10.1145","author":[{"given":"Radoslav","family":"Fulek","sequence":"first","affiliation":[{"name":"Simon Fraser University, Burnaby, Canada"}]},{"given":"Andreas F.","family":"Holmsen","sequence":"additional","affiliation":[{"name":"Korea Advanced Institute of Science and Technology, Daejon, South Korea"}]},{"given":"J\u00e1nos","family":"Pach","sequence":"additional","affiliation":[{"name":"City College of New York, New York, NY, USA"}]}],"member":"320","published-online":{"date-parts":[[2008,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02187724"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009502"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1963.11992093"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1969.12000319"},{"key":"e_1_3_2_1_5_1","volume-title":"Proc. 15th ACM-SIAM Sympos. on Discrete Algorithms","author":"Chan T.","year":"2004","unstructured":"T. Chan . An optimal randomized algorithm for maximum Tukey depth . In Proc. 15th ACM-SIAM Sympos. on Discrete Algorithms , 2004 . T. Chan. An optimal randomized algorithm for maximum Tukey depth. In Proc. 15th ACM-SIAM Sympos. on Discrete Algorithms, 2004."},{"key":"e_1_3_2_1_6_1","volume-title":"The complexity of hyperplane depth in the plane. U.S. - Hungarian on Discrete Geometry and Convexity (Budapest","author":"Langerman S.","year":"1999","unstructured":"S. Langerman , W. Steiger . The complexity of hyperplane depth in the plane. U.S. - Hungarian on Discrete Geometry and Convexity (Budapest , 1999 Auburn, AL , 2000). Discrete Comput. Geom . 30 (2003), no. 2, 299--399. S. Langerman, W. Steiger. The complexity of hyperplane depth in the plane. U.S. - Hungarian on Discrete Geometry and Convexity (Budapest, 1999 Auburn, AL, 2000). Discrete Comput. Geom. 30 (2003), no. 2, 299--399."},{"key":"e_1_3_2_1_7_1","volume-title":"Method of building a locating service for a wireless network environment, patent no","author":"Liu Ts.","year":"2035","unstructured":"Ch.- Ts. Liu and T.-Y. Hung . Method of building a locating service for a wireless network environment, patent no . 7 2035 04, April 2007. See www.freepatentsonline.com\/7203504.html Ch.-Ts. Liu and T.-Y. Hung. Method of building a locating service for a wireless network environment, patent no. 7203504, April 2007. See www.freepatentsonline.com\/7203504.html"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0039-7","volume-title":"Lectures on Discrete Geometry. Graduate Texts in Mathematics","author":"Matou\u0161ek J.","year":"2002","unstructured":"J. Matou\u0161ek . Lectures on Discrete Geometry. Graduate Texts in Mathematics . Springer 2002 . J. Matou\u0161ek. Lectures on Discrete Geometry. Graduate Texts in Mathematics. Springer 2002."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009452"},{"key":"e_1_3_2_1_10_1","volume-title":"Guanajuato","author":"Urrutia J.","year":"2007","unstructured":"J. Urrutia , personal communication , Guanajuato , February 2007 . J. Urrutia, personal communication, Guanajuato, February 2007."}],"event":{"name":"SoCG08: 24th Annual Symposium on Computational Geometry","sponsor":["SIGGRAPH ACM Special Interest Group on Computer Graphics and Interactive Techniques","ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"College Park MD USA","acronym":"SoCG08"},"container-title":["Proceedings of the twenty-fourth annual symposium on Computational geometry"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1377676.1377740","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1377676.1377740","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:56:39Z","timestamp":1750254999000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1377676.1377740"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6,9]]},"references-count":10,"alternative-id":["10.1145\/1377676.1377740","10.1145\/1377676"],"URL":"https:\/\/doi.org\/10.1145\/1377676.1377740","relation":{},"subject":[],"published":{"date-parts":[[2008,6,9]]},"assertion":[{"value":"2008-06-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}