{"id":"https://openalex.org/W2069500078","doi":"https://doi.org/10.1016/0020-0190(88)90022-1","title":"Time and space efficient algorithms for shortest paths between convex polygons","display_name":"Time and space efficient algorithms for shortest paths between convex polygons","publication_year":1988,"publication_date":"1988-04-01","ids":{"openalex":"https://openalex.org/W2069500078","doi":"https://doi.org/10.1016/0020-0190(88)90022-1","mag":"2069500078"},"language":"en","primary_location":{"id":"doi:10.1016/0020-0190(88)90022-1","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(88)90022-1","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/A5081612107","display_name":"Hans Rohnert","orcid":null},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Hans Rohnert","raw_affiliation_strings":["Department of Applied Mathematics and Computer Science (FB 10), University of Saarlandes, D-6600 Saarbr\u00fccken, Fed. Rep.Germany","University of Saarlandes, Saarbru\u00a8cken, FRG#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics and Computer Science (FB 10), University of Saarlandes, D-6600 Saarbr\u00fccken, Fed. Rep.Germany","institution_ids":["https://openalex.org/I91712215"]},{"raw_affiliation_string":"University of Saarlandes, Saarbru\u00a8cken, FRG#TAB#","institution_ids":["https://openalex.org/I91712215"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5081612107"],"corresponding_institution_ids":["https://openalex.org/I91712215"],"apc_list":{"value":2200,"currency":"USD","value_usd":2200},"apc_paid":null,"fwci":0.5052,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.7137637,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"27","issue":"4","first_page":"175","last_page":"179"},"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9884999990463257,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6679085493087769},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.582639217376709},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.581741452217102},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5500218272209167},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5290143489837646},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5187892317771912},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4749194085597992},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4354265034198761},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3016315996646881},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.06662121415138245},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06110307574272156}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6679085493087769},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.582639217376709},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.581741452217102},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5500218272209167},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5290143489837646},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5187892317771912},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4749194085597992},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4354265034198761},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3016315996646881},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.06662121415138245},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06110307574272156},{"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(88)90022-1","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(88)90022-1","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":10,"referenced_works":["https://openalex.org/W1977856642","https://openalex.org/W1985071642","https://openalex.org/W1986014106","https://openalex.org/W2014320134","https://openalex.org/W2016584965","https://openalex.org/W2084224084","https://openalex.org/W2109868275","https://openalex.org/W2163169902","https://openalex.org/W6644804536","https://openalex.org/W6671329661"],"related_works":["https://openalex.org/W4256429076","https://openalex.org/W1971174658","https://openalex.org/W2099195351","https://openalex.org/W2348092930","https://openalex.org/W2012063272","https://openalex.org/W2138685729","https://openalex.org/W4386395423","https://openalex.org/W4366562581","https://openalex.org/W3153687528","https://openalex.org/W4287212971"],"abstract_inverted_index":null,"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}