{"id":"https://openalex.org/W1977176150","doi":"https://doi.org/10.1016/0020-0190(79)90021-8","title":"A note on the all nearest-neighbor problem for convex polygons","display_name":"A note on the all nearest-neighbor problem for convex polygons","publication_year":1979,"publication_date":"1979-04-01","ids":{"openalex":"https://openalex.org/W1977176150","doi":"https://doi.org/10.1016/0020-0190(79)90021-8","mag":"1977176150"},"language":"en","primary_location":{"id":"doi:10.1016/0020-0190(79)90021-8","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(79)90021-8","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"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":"Information Processing Letters","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/A5101968975","display_name":"Chao\u2010Chin Yang","orcid":"https://orcid.org/0000-0003-2589-5034"},"institutions":[{"id":"https://openalex.org/I1288214837","display_name":"United States Naval Research Laboratory","ror":"https://ror.org/04d23a975","country_code":"US","type":"facility","lineage":["https://openalex.org/I1288214837","https://openalex.org/I1330347796","https://openalex.org/I175003984","https://openalex.org/I3130687028"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"C.C. Yang","raw_affiliation_strings":["Naval Research Lab., Washington, DC, U.S.A","Naval Research Lab., Washington, DC, U.S.A.#TAB#"],"affiliations":[{"raw_affiliation_string":"Naval Research Lab., Washington, DC, U.S.A","institution_ids":[]},{"raw_affiliation_string":"Naval Research Lab., Washington, DC, U.S.A.#TAB#","institution_ids":["https://openalex.org/I1288214837"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113687731","display_name":"D. T. Lee","orcid":null},"institutions":[{"id":"https://openalex.org/I111979921","display_name":"Northwestern University","ror":"https://ror.org/000e0be47","country_code":"US","type":"education","lineage":["https://openalex.org/I111979921"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"D.T. Lee","raw_affiliation_strings":["Northwestern University, Evanston, IL, U.S.A"],"affiliations":[{"raw_affiliation_string":"Northwestern University, Evanston, IL, U.S.A","institution_ids":["https://openalex.org/I111979921"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101968975"],"corresponding_institution_ids":["https://openalex.org/I1288214837"],"apc_list":{"value":2200,"currency":"USD","value_usd":2200},"apc_paid":null,"fwci":1.2371,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.74083296,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"8","issue":"4","first_page":"193","last_page":"194"},"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.9993000030517578,"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.9993000030517578,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9945999979972839,"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.7790499925613403},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6000979542732239},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5738325715065002},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.549631655216217},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5138025879859924},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4932937026023865},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.4932515025138855},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4706159234046936},{"id":"https://openalex.org/keywords/computational-geometry","display_name":"Computational geometry","score":0.4415152072906494},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.42895743250846863},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.42877429723739624},{"id":"https://openalex.org/keywords/convex-polygon","display_name":"Convex polygon","score":0.42846107482910156},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.42273572087287903},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.42019107937812805},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3731498718261719},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26443660259246826},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2292277216911316},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.18506795167922974}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7790499925613403},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6000979542732239},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5738325715065002},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.549631655216217},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5138025879859924},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4932937026023865},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4932515025138855},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4706159234046936},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.4415152072906494},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.42895743250846863},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.42877429723739624},{"id":"https://openalex.org/C2780034980","wikidata":"https://www.wikidata.org/wiki/Q3259505","display_name":"Convex polygon","level":3,"score":0.42846107482910156},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.42273572087287903},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.42019107937812805},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3731498718261719},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26443660259246826},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2292277216911316},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.18506795167922974},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0020-0190(79)90021-8","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(79)90021-8","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"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":"Information Processing Letters","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":3,"referenced_works":["https://openalex.org/W1977401236","https://openalex.org/W2035300538","https://openalex.org/W2038184042"],"related_works":["https://openalex.org/W2743938404","https://openalex.org/W2099271296","https://openalex.org/W1838063489","https://openalex.org/W2055625272","https://openalex.org/W2036758175","https://openalex.org/W2025220494","https://openalex.org/W1577155814","https://openalex.org/W1545170796","https://openalex.org/W2038796709","https://openalex.org/W1972433940"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}