{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T05:52:01Z","timestamp":1725688321701},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642311543"},{"type":"electronic","value":"9783642311550"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31155-0_8","type":"book-chapter","created":{"date-parts":[[2012,6,13]],"date-time":"2012-06-13T02:21:27Z","timestamp":1339554087000},"page":"83-94","source":"Crossref","is-referenced-by-count":2,"title":["A Simple Framework for the Generalized Nearest Neighbor Problem"],"prefix":"10.1007","author":[{"given":"Tomas","family":"Hruz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcel","family":"Sch\u00f6ngens","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","unstructured":"Agarwal, P., Sharir, M.: Arrangements and their Applications. Handbook of Computational Geometry, pp. 49\u2013119 (1998)"},{"issue":"1","key":"8_CR2","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/BF02574015","volume":"11","author":"P.K. Agarwal","year":"1994","unstructured":"Agarwal, P.K., Matou\u0161ek, J.: On Range Searching with Semialgebraic Sets. Discrete and Computational Geometry\u00a011(1), 393\u2013418 (1994)","journal-title":"Discrete and Computational Geometry"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Chan, T.M.: Optimal Partition Trees. In: SCG 2010: Proceedings of the 2010 Annual Symposium on Computational Geometry, pp. 1\u201310. ACM (2010)","DOI":"10.1145\/1810959.1810961"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Chazelle, B.: The Discrepancy Method. Cambridge University Press (2000)","DOI":"10.1017\/CBO9780511626371"},{"issue":"1","key":"8_CR5","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/BF02187743","volume":"4","author":"B. Chazelle","year":"1989","unstructured":"Chazelle, B., Welzl, E.: Quasi-optimal range searching in spaces of finite VC-dimension. Discrete and Computational Geometry\u00a04(1), 467\u2013489 (1989)","journal-title":"Discrete and Computational Geometry"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Cole, R., Yap, C.-K.: Geometric Retrieval Problems. In: FOCS 1983: Proceedings of the 24th Annual IEEE Symposium on Foundations of Computer Science, pp. 112\u2013121 (1983)","DOI":"10.1109\/SFCS.1983.22"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry - Algorithms and Applications, 2nd edn. Springer (2000)","DOI":"10.1007\/978-3-662-04245-8"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Haussler, D., Welzl, E.: Epsilon-nets and Simplex Range Queries. In: SCG 1986: Proceedings of the 2nd Annual Symposium on Computational Geometry, p. 71. ACM (1986)","DOI":"10.1145\/10515.10522"},{"key":"8_CR9","unstructured":"Krauthgamer, R., Lee, J.: Navigating Nets: Simple Algorithms for Proximity Search. In: SODA 2004: Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 798\u2013807. ACM (2004)"},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/BF02187804","volume":"5","author":"J. Matou\u0161ek","year":"1990","unstructured":"Matou\u0161ek, J.: Construction of epsilon-Nets. Discrete & Computational Geometry\u00a05, 427\u2013448 (1990)","journal-title":"Discrete & Computational Geometry"},{"issue":"1","key":"8_CR11","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/BF02293051","volume":"8","author":"J. Matou\u0161ek","year":"1992","unstructured":"Matou\u0161ek, J.: Efficient Partition Trees. Discrete and Computational Geometry\u00a08(1), 315\u2013334 (1992)","journal-title":"Discrete and Computational Geometry"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Matou\u0161ek, J.: Geometric Discrepancy. Springer (1999)","DOI":"10.1007\/978-3-642-03942-3"},{"issue":"1","key":"8_CR13","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF02573975","volume":"10","author":"J. Matou\u0161ek","year":"1993","unstructured":"Matou\u0161ek, J., Schwarzkopf, O.: On Ray shooting in Convex Polytopes. Discrete and Computational Geometry\u00a010(1), 215\u2013232 (1993)","journal-title":"Discrete and Computational Geometry"},{"issue":"4","key":"8_CR14","doi-asserted-by":"publisher","first-page":"852","DOI":"10.1145\/2157.322410","volume":"30","author":"N. Megiddo","year":"1983","unstructured":"Megiddo, N.: Applying Parallel Computation Algorithms in the Design of Serial Algorithms. Journal of the ACM\u00a030(4), 852\u2013865 (1983)","journal-title":"Journal of the ACM"},{"issue":"11","key":"8_CR15","doi-asserted-by":"publisher","first-page":"1027","DOI":"10.1016\/S0167-8655(98)00080-4","volume":"19","author":"P. Mitra","year":"1998","unstructured":"Mitra, P., Chaudhuri, B.B.: Efficiently computing the closest point to a query line. Pattern Recognition Letters\u00a019(11), 1027\u20131035 (1998)","journal-title":"Pattern Recognition Letters"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1007\/3-540-44842-X_80","volume-title":"Computational Science and Its Applications - ICCSA 2003","author":"P. Mitra","year":"2003","unstructured":"Mitra, P., Mukhopadhyay, A.: Computing a Closest Point to a Query Hyperplane in Three and Higher Dimensions. In: Kumar, V., Gavrilova, M.L., Tan, C.J.K., L\u2019Ecuyer, P. (eds.) ICCSA 2003. LNCS, vol.\u00a02669, pp. 787\u2013796. Springer, Heidelberg (2003)"},{"key":"8_CR17","unstructured":"Mitra, P., Mukhopadhyay, A., Rao, S.V.: Computing the Closest Point to a Circle. In: CCCG 2003: Proceedings of the 15th Canadian Conference on Computational Geometry, pp. 132\u2013135 (2003)"},{"issue":"12","key":"8_CR18","doi-asserted-by":"publisher","first-page":"1915","DOI":"10.1016\/S0167-8655(03)00018-7","volume":"24","author":"A. Mukhopadhyay","year":"2003","unstructured":"Mukhopadhyay, A.: Using simplicial partitions to determine a closest point to a query line. Pattern Recognition Letters\u00a024(12), 1915\u20131920 (2003)","journal-title":"Pattern Recognition Letters"},{"key":"8_CR19","unstructured":"Sch\u00f6ngens, M., Hruz, T.: A Simple Framework for the Generalized Nearest Neighbor Problem. Technical Report 758, Theoretical Computer Science, ETH Zurich (2012)"},{"key":"8_CR20","unstructured":"Sharir, M., Shaul, H.: Ray Shooting Amid Balls, Farthest Point from a Line, and Range Emptiness Searching. In: SODA 2005: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 525\u2013534 (2005)"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2013 SWAT 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31155-0_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:48:42Z","timestamp":1620128922000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31155-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642311543","9783642311550"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31155-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}