{"id":"https://openalex.org/W2045347717","doi":"https://doi.org/10.1016/0166-218x(90)90084-p","title":"Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm","display_name":"Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm","publication_year":1990,"publication_date":"1990-11-01","ids":{"openalex":"https://openalex.org/W2045347717","doi":"https://doi.org/10.1016/0166-218x(90)90084-p","mag":"2045347717"},"language":"en","primary_location":{"id":"doi:10.1016/0166-218x(90)90084-p","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0166-218x(90)90084-p","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","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/A5089964489","display_name":"Baruch Schieber","orcid":null},"institutions":[{"id":"https://openalex.org/I4210114115","display_name":"IBM Research - Thomas J. Watson Research Center","ror":"https://ror.org/0265w5591","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210114115"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Baruch Schieber","raw_affiliation_strings":["IBM Research Division, Thomas J. Watson Research Center, Yorktown Heights, NY 10598 USA","IBM Research Division, Thomas J Watson Research Center, Yorktown Heights, NY, 10598, USA"],"affiliations":[{"raw_affiliation_string":"IBM Research Division, Thomas J. Watson Research Center, Yorktown Heights, NY 10598 USA","institution_ids":["https://openalex.org/I4210114115"]},{"raw_affiliation_string":"IBM Research Division, Thomas J Watson Research Center, Yorktown Heights, NY, 10598, USA","institution_ids":["https://openalex.org/I4210114115"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013018127","display_name":"Uzi Vishkin","orcid":"https://orcid.org/0000-0003-0713-2674"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]},{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["IL","US"],"is_corresponding":false,"raw_author_name":"Uzi Vishkin","raw_affiliation_strings":["Department of Computer Science, School of Mathematical Sciences, Tel Aviv University, Israel","Institute for Advanced Computer Studies, University of Maryland, College Park, MD 20742-3251, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, School of Mathematical Sciences, Tel Aviv University, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"Institute for Advanced Computer Studies, University of Maryland, College Park, MD 20742-3251, USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5089964489"],"corresponding_institution_ids":["https://openalex.org/I4210114115"],"apc_list":{"value":2750,"currency":"USD","value_usd":2750},"apc_paid":null,"fwci":3.9555,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.94317877,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":"29","issue":"1","first_page":"97","last_page":"111"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/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/T10374","display_name":"Advanced Graph Theory Research","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/combinatorics","display_name":"Combinatorics","score":0.7758941650390625},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7417271733283997},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5638262033462524},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5413690805435181},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.5152490735054016},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5124076008796692},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5016775131225586},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.47400984168052673},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4460585117340088},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3600670397281647},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3415874242782593},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.17837807536125183}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7758941650390625},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7417271733283997},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5638262033462524},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5413690805435181},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5152490735054016},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5124076008796692},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5016775131225586},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.47400984168052673},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4460585117340088},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3600670397281647},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3415874242782593},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.17837807536125183},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0166-218x(90)90084-p","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0166-218x(90)90084-p","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","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":27,"referenced_works":["https://openalex.org/W36714108","https://openalex.org/W86882862","https://openalex.org/W200390202","https://openalex.org/W1512709563","https://openalex.org/W1836810876","https://openalex.org/W1975510415","https://openalex.org/W1977176150","https://openalex.org/W2005314985","https://openalex.org/W2007470648","https://openalex.org/W2014992380","https://openalex.org/W2025558913","https://openalex.org/W2027679733","https://openalex.org/W2035300538","https://openalex.org/W2042607215","https://openalex.org/W2046946959","https://openalex.org/W2061303458","https://openalex.org/W2069489095","https://openalex.org/W2087489294","https://openalex.org/W2089062581","https://openalex.org/W2099765347","https://openalex.org/W2157766475","https://openalex.org/W3041834803","https://openalex.org/W3048145607","https://openalex.org/W6602222575","https://openalex.org/W6603524441","https://openalex.org/W6608140895","https://openalex.org/W6630635006"],"related_works":["https://openalex.org/W4377371889","https://openalex.org/W4389362338","https://openalex.org/W2113623403","https://openalex.org/W2055932080","https://openalex.org/W1968512104","https://openalex.org/W2565109825","https://openalex.org/W1862126075","https://openalex.org/W2055625272","https://openalex.org/W3153687528","https://openalex.org/W2036758175"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-03-10T14:07:55.174380","created_date":"2025-10-10T00:00:00"}