{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:52:06Z","timestamp":1725796326865},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319091280"},{"type":"electronic","value":"9783319091297"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09129-7_28","type":"book-chapter","created":{"date-parts":[[2014,7,3]],"date-time":"2014-07-03T04:21:21Z","timestamp":1404361281000},"page":"368-380","source":"Crossref","is-referenced-by-count":0,"title":["Closest-Point Queries for Complex Objects"],"prefix":"10.1007","author":[{"given":"Eugene","family":"Greene","sequence":"first","affiliation":[]},{"given":"Asish","family":"Mukhopadhyay","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","unstructured":"Boost C++ Libraries, \n                    \n                      http:\/\/www.boost.org"},{"key":"28_CR2","unstructured":"Cgal, Computational Geometry Algorithms Library, \n                    \n                      http:\/\/www.cgal.org"},{"issue":"1","key":"28_CR3","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0020-0190(92)90075-7","volume":"41","author":"M.D. Atkinson","year":"1992","unstructured":"Atkinson, M.D., Sack, J.-R.: Generating binary trees at random. Inf. Process. Lett.\u00a041(1), 21\u201323 (1992)","journal-title":"Inf. Process. Lett."},{"key":"28_CR4","doi-asserted-by":"publisher","first-page":"830","DOI":"10.1137\/0217052","volume":"17","author":"K.L. Clarkson","year":"1988","unstructured":"Clarkson, K.L.: A randomized algorithm for closest-point queries. SIAM J. Comput.\u00a017, 830\u2013847 (1988)","journal-title":"SIAM J. Comput."},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Cole, R., Yap, C.K.: Geometric retrieval problems. In: Proc. 24th Annu. IEEE Sympos. Found. Comput. Sci., pp. 112\u2013121 (1983)","DOI":"10.1109\/SFCS.1983.22"},{"key":"28_CR6","first-page":"227","volume-title":"GIS 2006: Proceedings of the 14th Annual ACM International Symposium on Advances in Geographic Information Systems","author":"V.T. Almeida de","year":"2006","unstructured":"de Almeida, V.T.: Towards optimal continuous nearest neighbor queries in spatial databases. In: GIS 2006: Proceedings of the 14th Annual ACM International Symposium on Advances in Geographic Information Systems, pp. 227\u2013234. ACM, New York (2006)"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Goswami, P.P., Das, S., Nandy, S.C.: Triangle range counting query in 2d and its applications in finding k nearest neighbors of a line segment. Computational Geometry: Theory and Applications, 163\u2013175 (2004)","DOI":"10.1016\/j.comgeo.2004.02.001"},{"key":"28_CR8","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0020-0190(85)90015-8","volume":"21","author":"D.T. Lee","year":"1985","unstructured":"Lee, D.T., Ching, Y.T.: The power of geometric duality revisited. Inform. Process. Lett.\u00a021, 117\u2013122 (1985)","journal-title":"Inform. Process. Lett."},{"key":"28_CR9","unstructured":"Liu, T., Moore, A.W., Gray, A.G., Yang, K.: An investigation of practical approximate nearest neighbor algorithms. In: NIPS (2004)"},{"issue":"3","key":"28_CR10","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/BF02293051","volume":"8","author":"J. Matousek","year":"1992","unstructured":"Matousek, J.: Efficient partition trees. Discrete Comput. Geom.\u00a08(3), 315\u2013334 (1992)","journal-title":"Discrete Comput. Geom."},{"key":"28_CR11","unstructured":"Mitra, P.: Finding the closest point to a query line. In: Toussaint, G. (ed.) Snapshots in Computational Geometry, vol.\u00a0II, pp. 53\u201363 (1992)"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"Mitra, P., Chaudhuri, B.B.: Efficiently computing the closest point to a query line. Pattern Recognition Letters\u00a019, 1027\u20131035 (1998)","DOI":"10.1016\/S0167-8655(98)00080-4"},{"key":"28_CR13","unstructured":"Mitra, P., Mukhopadhyay, A., Rao, S.V.: Computing the closest point to a circle. In: CCCG, pp. 132\u2013135 (2003)"},{"key":"28_CR14","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, 1915\u20131920 (2003)","journal-title":"Pattern Recognition Letters"},{"issue":"1","key":"28_CR15","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/S0304-3975(02)00322-5","volume":"299","author":"S.C. Nandy","year":"2003","unstructured":"Nandy, S.C., Das, S., Goswami, P.P.: An efficient k nearest neighbors searching algorithm for a query line. TCS: Theoretical Computer Science\u00a0299(1), 273\u2013288 (2003)","journal-title":"TCS: Theoretical Computer Science"},{"key":"28_CR16","doi-asserted-by":"crossref","unstructured":"Tao, Y., Papadias, D., Shen, Q.: Continuous nearest neighbor search. In: VLDB 2002: Proceedings of the 28th International Conference on Very Large Data Bases, pp. 287\u2013298. VLDB Endowment (2002)","DOI":"10.1016\/B978-155860869-6\/50033-0"},{"key":"28_CR17","doi-asserted-by":"crossref","unstructured":"Vapnik, V.N., Chervonenkis, A.Y.: On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and its Applications\u00a016(2), 264\u2013280 (1971)","DOI":"10.1137\/1116025"},{"key":"28_CR18","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/73393.73397","volume-title":"SCG 1988: Proceedings of the Fourth Annual Symposium on Computational Geometry","author":"E. Welzl","year":"1988","unstructured":"Welzl, E.: Partition trees for triangle counting and other range searching problems. In: SCG 1988: Proceedings of the Fourth Annual Symposium on Computational Geometry, pp. 23\u201333. ACM Press, New York (1988)"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09129-7_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T01:58:35Z","timestamp":1558922315000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-09129-7_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319091280","9783319091297"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09129-7_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}