{"id":"https://openalex.org/W3113308927","doi":"https://doi.org/10.1080/23799927.2020.1862302","title":"A progressive algorithm for the closest pair problem","display_name":"A progressive algorithm for the closest pair problem","publication_year":2020,"publication_date":"2020-12-10","ids":{"openalex":"https://openalex.org/W3113308927","doi":"https://doi.org/10.1080/23799927.2020.1862302","mag":"3113308927"},"language":"en","primary_location":{"id":"doi:10.1080/23799927.2020.1862302","is_oa":false,"landing_page_url":"https://doi.org/10.1080/23799927.2020.1862302","pdf_url":null,"source":{"id":"https://openalex.org/S4210234901","display_name":"International Journal of Computer Mathematics Computer Systems Theory","issn_l":"2379-9927","issn":["2379-9927","2379-9935"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics: Computer Systems Theory","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/A5012793042","display_name":"Amir Mesrikhani","orcid":null},"institutions":[{"id":"https://openalex.org/I112536369","display_name":"Yazd University","ror":"https://ror.org/02x99ac45","country_code":"IR","type":"education","lineage":["https://openalex.org/I112536369"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Amir Mesrikhani","raw_affiliation_strings":["Combinatorial and Geometric Algorithms Lab., Department of Computer Science, Yazd University, Yazd, Iran"],"affiliations":[{"raw_affiliation_string":"Combinatorial and Geometric Algorithms Lab., Department of Computer Science, Yazd University, Yazd, Iran","institution_ids":["https://openalex.org/I112536369"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048590083","display_name":"Mohammad Farshi","orcid":"https://orcid.org/0000-0002-1986-2722"},"institutions":[{"id":"https://openalex.org/I112536369","display_name":"Yazd University","ror":"https://ror.org/02x99ac45","country_code":"IR","type":"education","lineage":["https://openalex.org/I112536369"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Mohammad Farshi","raw_affiliation_strings":["Combinatorial and Geometric Algorithms Lab., Department of Computer Science, Yazd University, Yazd, Iran"],"affiliations":[{"raw_affiliation_string":"Combinatorial and Geometric Algorithms Lab., Department of Computer Science, Yazd University, Yazd, Iran","institution_ids":["https://openalex.org/I112536369"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021077741","display_name":"Behnam Iranfar","orcid":null},"institutions":[{"id":"https://openalex.org/I112536369","display_name":"Yazd University","ror":"https://ror.org/02x99ac45","country_code":"IR","type":"education","lineage":["https://openalex.org/I112536369"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Behnam Iranfar","raw_affiliation_strings":["Combinatorial and Geometric Algorithms Lab., Department of Computer Science, Yazd University, Yazd, Iran"],"affiliations":[{"raw_affiliation_string":"Combinatorial and Geometric Algorithms Lab., Department of Computer Science, Yazd University, Yazd, Iran","institution_ids":["https://openalex.org/I112536369"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5012793042"],"corresponding_institution_ids":["https://openalex.org/I112536369"],"apc_list":null,"apc_paid":null,"fwci":0.6245,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.79585509,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"6","issue":"2","first_page":"130","last_page":"136"},"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.9998000264167786,"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.9998000264167786,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9991999864578247,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5843462347984314},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5272597074508667}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5843462347984314},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5272597074508667}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/23799927.2020.1862302","is_oa":false,"landing_page_url":"https://doi.org/10.1080/23799927.2020.1862302","pdf_url":null,"source":{"id":"https://openalex.org/S4210234901","display_name":"International Journal of Computer Mathematics Computer Systems Theory","issn_l":"2379-9927","issn":["2379-9927","2379-9935"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics: Computer Systems Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W596522316","https://openalex.org/W1965369904","https://openalex.org/W1971238646","https://openalex.org/W2007643787","https://openalex.org/W2054011861","https://openalex.org/W2054788982","https://openalex.org/W2059985428","https://openalex.org/W2084300309","https://openalex.org/W2108741984","https://openalex.org/W2128703518","https://openalex.org/W2294603245","https://openalex.org/W2408238519"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2478288626","https://openalex.org/W4391913857"],"abstract_inverted_index":{"Developing":[0],"algorithms":[1,20],"that":[2],"produce":[3],"approximate":[4],"solutions":[5],"is":[6,51,74,102,108],"always":[7],"interesting":[8],"when":[9],"we":[10,61],"are":[11],"generating":[12],"the":[13,26,30,38,42,45,48,56,63,68,77,96,99,109,112,117],"final":[14,31],"solution":[15,24,32,50,101],"for":[16,76],"a":[17,22],"problem.":[18],"Progressive":[19],"report":[21],"partial":[23,49,100],"to":[25],"user":[27,39],"which":[28,81],"approximates":[29],"in":[33,53,90],"some":[34],"specific":[35],"steps.":[36],"Thus,":[37],"can":[40],"stop":[41],"algorithm":[43,73],"if":[44],"error":[46,97],"of":[47,55,83,98,111,121],"tolerable":[52],"terms":[54],"application.":[57],"In":[58,93],"this":[59],"paper,":[60],"study":[62],"closest":[64,78],"pair":[65,79],"problem":[66],"under":[67],"Euclidean":[69],"metric.":[70],"A":[71],"progressive":[72],"designed":[75],"problem,":[80],"consists":[82],"O(log\u2061n)":[84],"steps":[85],"and":[86,116],"spends":[87],"O(n)":[88],"time":[89],"each":[91],"step.":[92],"step":[94],"r,":[95],"bounded":[103],"by":[104],"O(\u03b12r),":[105],"where":[106],"\u03b1":[107],"ratio":[110],"maximum":[113],"pairwise":[114,119],"distance":[115,120],"minimum":[118],"points.":[122]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}