{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:04:01Z","timestamp":1725570241694},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540401568"},{"type":"electronic","value":"9783540448426"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44842-x_80","type":"book-chapter","created":{"date-parts":[[2010,11,19]],"date-time":"2010-11-19T16:38:01Z","timestamp":1290184681000},"page":"787-796","source":"Crossref","is-referenced-by-count":3,"title":["Computing a Closest Point to a Query Hyperplane in Three and Higher Dimensions"],"prefix":"10.1007","author":[{"given":"Pinaki","family":"Mitra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Asish","family":"Mukhopadhyay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"key":"80_CR1","doi-asserted-by":"crossref","unstructured":"R. Cole and C. Yap, Geometric retrieval problems, Proc. IEEE 24th Symp. on Foundations of Computer Science, pp 112\u2013121, 1983.","DOI":"10.1109\/SFCS.1983.22"},{"key":"80_CR2","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0022-0000(89)90038-X","volume":"38","author":"H. Edelsbrunner","year":"1989","unstructured":"H. Edelsbrunner and L. J. Guibas, Topologically sweeping an arrangement, J. Comput. Syst. Sci., Vol. 38, pp 165\u2013194, 1989.","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"80_CR3","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1137\/0212002","volume":"12","author":"D. G. Kirkpatrick","year":"1983","unstructured":"D. G. Kirkpatrick, Optimal search in planar subdivisions, SIAM J. Comput., Vol. 12(1), pp 28\u201335, 1983.","journal-title":"SIAM J. Comput."},{"key":"80_CR4","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0020-0190(85)90015-8","volume":"21","author":"D. T. Lee","year":"1985","unstructured":"D. T. Lee and Y. T. Ching, The power of geometric duality revisited, IPL, Vol. 21, pp 117\u2013122, 1985.","journal-title":"IPL"},{"key":"80_CR5","doi-asserted-by":"crossref","unstructured":"Asish Mukhopadhyay, Using simplicial partitions to determine the closest point to a query line, in Pattern Recognition Letters, to appear.","DOI":"10.1016\/S0167-8655(03)00018-7"},{"key":"80_CR6","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1006\/inco.1993.1057","volume":"106","author":"S. Meiser","year":"1993","unstructured":"S. Meiser, Point location in arrangements of hyperplanes, Information and Computation, Vol. 106, pp 286\u2013303, 1993.","journal-title":"Information and Computation"},{"key":"80_CR7","unstructured":"P. Mitra, Finding the closest point to a query line, Snapshots in Computational Geometry (Editor G. Toussaint), Vol II, pp 53\u201363, 1992."},{"key":"80_CR8","doi-asserted-by":"publisher","first-page":"1027","DOI":"10.1016\/S0167-8655(98)00080-4","volume":"19","author":"P. Mitra","year":"1998","unstructured":"P. Mitra and B. B. Chaudhuri, Efficiently computing tthe closest point to a query line, Pattern Recognition Letters, Vol 19, pp 1027\u20131035, 1998.","journal-title":"Pattern Recognition Letters"},{"key":"80_CR9","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/BF02293051","volume":"8","author":"J. Matou\u0161ek","year":"1992","unstructured":"J. Matou\u0161ek, Efficient partition trees, Discrete and Computational Geometry, Vol. 8, pp 315\u2013334, 1992.","journal-title":"Discrete and Computational Geometry"},{"key":"80_CR10","doi-asserted-by":"crossref","unstructured":"Mark de Berg, Marc van Kreveld, Mark Overmarks, Otfried Schwarzkopf, Computational Geometry: Algorithms and Applications, Second edition, Springer Verlag, 2001.","DOI":"10.1007\/978-3-662-04245-8"},{"key":"80_CR11","unstructured":"Franco P. Preparata, M. I. Shamos, Computational Geometry: An Introduction, Springer-Verlag, 2nd edition, 1990."}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2014 ICCSA 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44842-X_80","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,13]],"date-time":"2020-06-13T19:28:56Z","timestamp":1592076536000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44842-X_80"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540401568","9783540448426"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-44842-x_80","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}