{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T21:00:49Z","timestamp":1761512449660},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2007,7,1]],"date-time":"2007-07-01T00:00:00Z","timestamp":1183248000000},"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":[[2007,7]]},"DOI":"10.1007\/s11390-007-9066-y","type":"journal-article","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T01:24:26Z","timestamp":1189733066000},"page":"532-540","source":"Crossref","is-referenced-by-count":7,"title":["Engineering the Divide-and-Conquer Closest Pair Algorithm"],"prefix":"10.1007","volume":"22","author":[{"given":"Minghui","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joel","family":"Gillespie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,9,13]]},"reference":[{"key":"9066_CR1","doi-asserted-by":"crossref","unstructured":"Franco P Preparata, Michael Ian Shamos. Computational Geometry: An Introduction. Springer, 1985.","DOI":"10.1007\/978-1-4612-1098-6"},{"key":"9066_CR2","doi-asserted-by":"crossref","unstructured":"Michael Ian Shamos. Geometric complexity. In Proc. the 7th Annual ACM Symposium on Theory of Computing (STOC'75), Albuquerque, NM, USA, 1975, pp. 224\u2013233.","DOI":"10.1145\/800116.803772"},{"key":"9066_CR3","doi-asserted-by":"crossref","unstructured":"Michael Ian Shamos, Dan Hoey. Closest-point problems. In Proc. the 16th IEEE Annual Symposium on Foundations of Computer Science (FOCS'75), Los Alamitos, USA, 1975, pp. 151\u2013162.","DOI":"10.1109\/SFCS.1975.8"},{"key":"9066_CR4","doi-asserted-by":"crossref","unstructured":"Michiel Smid. Closest-Point Problems in Computational Geometry. Handbook on Computational Geometry, Sack J R, Urrutia J (eds.), Elsevier Science, 2000.","DOI":"10.1016\/B978-044482537-7\/50021-8"},{"key":"9066_CR5","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1145\/800113.803652","volume-title":"Proc. the 8th Annual ACM Symposium on Theory of Computing (STOC'76)","author":"Jon Louis Bentley","year":"1976","unstructured":"Jon Louis Bentley, Michael Ian Shamos. Divide-and-conquer in multidimensional space. In Proc. the 8th Annual ACM Symposium on Theory of Computing (STOC'76), Hershey, PA, USA, 1976, pp. 220\u2013230."},{"issue":"4","key":"9066_CR6","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1145\/358841.358850","volume":"23","author":"Jon Louis Bentley","year":"1980","unstructured":"Jon Louis Bentley. Multidimensional divide-and-conquer. Communications of the ACM, 1980, 23(4): 214\u2013229.","journal-title":"Communications of the ACM"},{"key":"9066_CR7","doi-asserted-by":"crossref","unstructured":"Michael Ben-Or. Lower bounds for algebraic computation trees. In Proc. the 15th Annual ACM Symposium on Theory of Computing (STOC'83), Boston, MA, USA, 1983, pp. 80\u201386.","DOI":"10.1145\/800061.808735"},{"key":"9066_CR8","unstructured":"Thomas H Cormen, Charles E Leiserson, Ronald L Rivest et al. Introduction to Algorithms. Second Edition, MIT Press, 2001."},{"key":"9066_CR9","doi-asserted-by":"crossref","unstructured":"Gianni Franceschini, Viliam Geffert. An in-place sorting with O(n log n) comparisons and O(n) moves. In Proc. the 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS'03), Cambridge, MA, USA, 2003, pp. 242\u2013250.","DOI":"10.1109\/SFCS.2003.1238198"},{"issue":"10","key":"9066_CR10","first-page":"957","volume":"35","author":"Yulin Zhou","year":"1998","unstructured":"Yulin Zhou, Pengrong Xiong, Hong Zhu. An improved algorithm about the closest pair of points on plane set. Journal of Computer Research and Development, 1998, 35(10): 957\u2013960. (in Chinese)","journal-title":"Journal of Computer Research and Development"},{"issue":"1","key":"9066_CR11","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/s11390-006-0027-7","volume":"21","author":"Qi Ge","year":"2006","unstructured":"Qi Ge, Hai-Tao Wang, Hong Zhu. An improved algorithm for finding the closest pair of points. Journal of Computer Science and Technology, 2006, 21(1): 27\u201331.","journal-title":"Journal of Computer Science and Technology"},{"key":"9066_CR12","doi-asserted-by":"crossref","unstructured":"David S Johnson. A theoretician's guide to the experimental analysis of algorithms. In Proc. Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenges, Michael H Goldwasser, David S Johnson, Catherine C McGeoch (eds.), DIMACS Monographs, Vol. 59, MAA Press, 2002, pp. 215\u2013250.","DOI":"10.1090\/dimacs\/059\/11"},{"key":"9066_CR13","unstructured":"Catherine C McGeoch. A bibliography of algorithm experimentation. In Proc. Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenges, Michael H Goldwasser, David S Johnson, Catherine C McGeoch (eds.), DIMACS Monographs, Vol. 59, MAA Press, 2002."},{"issue":"4","key":"9066_CR14","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1145\/337885.337899","volume":"30","author":"Catherine C McGeoch","year":"1999","unstructured":"Catherine C McGeoch, Bernard M E Moret. How to present a paper on experimental work with algorithms. SIGACT News, 1999, 30(4): 85\u201390.","journal-title":"SIGACT News"},{"key":"9066_CR15","unstructured":"Intel x86 Instruction Set. http:\/\/www.intel.com\/ ."},{"key":"9066_CR16","unstructured":"Erich Friedman. Circles in circles. http:\/\/www.ste-tson.edu\/\u2013efri-edma\/cirincir\/ ."},{"key":"9066_CR17","unstructured":"Eric W Weisstein. Circle packing. MathWorld \u2014 A Wolfram Web Resource, http:\/\/mathworld.wolfram.com\/Circle-Packing.html ."},{"key":"9066_CR18","unstructured":"Robert Sedgewick. Algorithms in C++, Parts 1\u20134: Fundamentals, Data Structure, Sorting, Searching. 3rd Edition, Addison-Wesley, 1998."},{"issue":"11","key":"9066_CR19","first-page":"1249","volume":"23","author":"Jon Louis Bentley","year":"1993","unstructured":"Jon Louis Bentley, M Douglas McIlroy. Engineering a sort function. Software: Practice and Experience, 1993, 23(11): 1249\u20131265.","journal-title":"Software: Practice and Experience"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-007-9066-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11390-007-9066-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-007-9066-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,14]],"date-time":"2023-05-14T04:12:26Z","timestamp":1684037546000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11390-007-9066-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,7]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2007,7]]}},"alternative-id":["9066"],"URL":"https:\/\/doi.org\/10.1007\/s11390-007-9066-y","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,7]]}}}