{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:48:51Z","timestamp":1759063731069},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,7,1]],"date-time":"2012-07-01T00:00:00Z","timestamp":1341100800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. Technol."],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1007\/s11390-012-1272-6","type":"journal-article","created":{"date-parts":[[2012,7,13]],"date-time":"2012-07-13T04:31:36Z","timestamp":1342153896000},"page":"891-896","source":"Crossref","is-referenced-by-count":6,"title":["An Optimized Divide-and-Conquer Algorithm for the Closest-Pair Problem in the Planar Case"],"prefix":"10.1007","volume":"27","author":[{"given":"Jos\u00e9 C.","family":"Pereira","sequence":"first","affiliation":[]},{"given":"Fernando G.","family":"Lobo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,7,12]]},"reference":[{"issue":"4","key":"1272_CR1","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1145\/358841.358850","volume":"23","author":"JL Bentley","year":"1980","unstructured":"Bentley J L. Multidimensional divide-and-conquer. Communications of the ACM, 1980, 23(4): 214\u2013229.","journal-title":"Communications of the ACM"},{"key":"1272_CR2","doi-asserted-by":"crossref","unstructured":"Smid M. Closest-point problems in computational geometry. In Handbook of Computational Geometry, Sack J R, Urutia J (eds.), Amsterdam: Elsevier Science, 2000, pp.877\u2013935.","DOI":"10.1016\/B978-044482537-7\/50021-8"},{"key":"1272_CR3","doi-asserted-by":"crossref","unstructured":"Shamos M I. Geometric complexity. In Proc. the 7th Symp. Theory of Computing, New York, USA, May 1975, pp.224\u2013233.","DOI":"10.1145\/800116.803772"},{"key":"1272_CR4","doi-asserted-by":"crossref","unstructured":"Bentley J\u00a0L, Shamos M I. Divide-and-conquer in multidimensional space. In Proc. the 8th Symp. Theory of Computing, New York, USA, May 1976, pp.220\u2013230.","DOI":"10.1145\/800113.803652"},{"key":"1272_CR5","unstructured":"Kleinberg J, Tardos E. Algorithm Design. Boston, USA: Addison-Wesley, 2005, pp.225\u2013231."},{"key":"1272_CR6","unstructured":"Cormen T\u00a0H, Leiserson C E, Rivest R L, Stein C. Introduction to Algorithms (2nd edition). Cambridge, USA: MIT Press, 2001, pp.957\u2013962."},{"issue":"4","key":"1272_CR7","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1007\/s11390-007-9066-y","volume":"22","author":"M Jiang","year":"2007","unstructured":"Jiang M, Gillespie J. Engineering the divide-and-conquer closest pair algorithm. Journal of Computer Science and Technology, 2007, 22(4): 532\u2013540.","journal-title":"Journal of Computer Science and Technology"},{"issue":"1","key":"1272_CR8","first-page":"27","volume":"21","author":"Q Ge","year":"2006","unstructured":"Ge Q, Wang H, Zhu Hong. An improved algorithm for finding the closest pair of points. Journal of computer Science and Technology, 2006, 21(1): 27\u201331.","journal-title":"An improved algorithm for finding the closest pair of points. Journal of computer Science and Technology"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-012-1272-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11390-012-1272-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-012-1272-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,30]],"date-time":"2019-06-30T17:42:50Z","timestamp":1561916570000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11390-012-1272-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7]]},"references-count":8,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["1272"],"URL":"https:\/\/doi.org\/10.1007\/s11390-012-1272-6","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,7]]}}}