{"id":"https://openalex.org/W2141074036","doi":"https://doi.org/10.1007/s11390-007-9066-y","title":"Engineering the Divide-and-Conquer Closest Pair Algorithm","display_name":"Engineering the Divide-and-Conquer Closest Pair Algorithm","publication_year":2007,"publication_date":"2007-07-01","ids":{"openalex":"https://openalex.org/W2141074036","doi":"https://doi.org/10.1007/s11390-007-9066-y","mag":"2141074036"},"language":"en","primary_location":{"id":"doi:10.1007/s11390-007-9066-y","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s11390-007-9066-y","pdf_url":null,"source":{"id":"https://openalex.org/S161516442","display_name":"Journal of Computer Science and Technology","issn_l":"1000-9000","issn":["1000-9000","1860-4749"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computer Science and Technology","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5080563649","display_name":"Minghui Jiang","orcid":"https://orcid.org/0000-0003-1843-9292"},"institutions":[{"id":"https://openalex.org/I121980950","display_name":"Utah State University","ror":"https://ror.org/00h6set76","country_code":"US","type":"education","lineage":["https://openalex.org/I121980950"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Minghui Jiang","raw_affiliation_strings":["Department of Computer Science, Utah State University, Logan, U.S.A","Department of Computer Science, Utah State University, Logan, Utah, 84322-4205, U.S.A","Department of Computer Science, Utah State University, Logan Utah"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Utah State University, Logan, U.S.A","institution_ids":["https://openalex.org/I121980950"]},{"raw_affiliation_string":"Department of Computer Science, Utah State University, Logan, Utah, 84322-4205, U.S.A","institution_ids":["https://openalex.org/I121980950"]},{"raw_affiliation_string":"Department of Computer Science, Utah State University, Logan Utah","institution_ids":["https://openalex.org/I121980950"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053130995","display_name":"J. R. Gillespie","orcid":"https://orcid.org/0000-0002-5075-1609"},"institutions":[{"id":"https://openalex.org/I121980950","display_name":"Utah State University","ror":"https://ror.org/00h6set76","country_code":"US","type":"education","lineage":["https://openalex.org/I121980950"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Joel Gillespie","raw_affiliation_strings":["Department of Computer Science, Utah State University, Logan, U.S.A","Department of Computer Science, Utah State University, Logan, Utah, 84322-4205, U.S.A","Department of Computer Science, Utah State University, Logan Utah"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Utah State University, Logan, U.S.A","institution_ids":["https://openalex.org/I121980950"]},{"raw_affiliation_string":"Department of Computer Science, Utah State University, Logan, Utah, 84322-4205, U.S.A","institution_ids":["https://openalex.org/I121980950"]},{"raw_affiliation_string":"Department of Computer Science, Utah State University, Logan Utah","institution_ids":["https://openalex.org/I121980950"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5053130995","https://openalex.org/A5080563649"],"corresponding_institution_ids":["https://openalex.org/I121980950"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.5372,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.79725291,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"22","issue":"4","first_page":"532","last_page":"540"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9966999888420105,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.9115108251571655},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6345957517623901},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6299793720245361},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.6218178868293762},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5576683878898621},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5043467283248901},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5019223690032959},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.4264788031578064},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3247891664505005},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12388035655021667},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07726621627807617}],"concepts":[{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.9115108251571655},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6345957517623901},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6299793720245361},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.6218178868293762},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5576683878898621},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5043467283248901},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5019223690032959},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.4264788031578064},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3247891664505005},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12388035655021667},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07726621627807617},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s11390-007-9066-y","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s11390-007-9066-y","pdf_url":null,"source":{"id":"https://openalex.org/S161516442","display_name":"Journal of Computer Science and Technology","issn_l":"1000-9000","issn":["1000-9000","1860-4749"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computer Science and Technology","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W21424260","https://openalex.org/W156347556","https://openalex.org/W1543889792","https://openalex.org/W1555007779","https://openalex.org/W1982570261","https://openalex.org/W2007610503","https://openalex.org/W2059985428","https://openalex.org/W2083391401","https://openalex.org/W2119602492","https://openalex.org/W2128703518","https://openalex.org/W2149468555","https://openalex.org/W2150518053","https://openalex.org/W2294603245","https://openalex.org/W2911302472","https://openalex.org/W3004540582","https://openalex.org/W3041834803","https://openalex.org/W4238014149","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W1581060459","https://openalex.org/W2010013697","https://openalex.org/W2340622231","https://openalex.org/W1588622438","https://openalex.org/W2024915064","https://openalex.org/W2552783079","https://openalex.org/W2083393265","https://openalex.org/W2364679747","https://openalex.org/W2145670890","https://openalex.org/W2171535967"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-19T15:47:20.252518","created_date":"2025-10-10T00:00:00"}