{"id":"https://openalex.org/W1561670232","doi":"https://doi.org/10.1007/bf02250584","title":"Shortest polygonal paths in space","display_name":"Shortest polygonal paths in space","publication_year":1990,"publication_date":"1990-03-01","ids":{"openalex":"https://openalex.org/W1561670232","doi":"https://doi.org/10.1007/bf02250584","mag":"1561670232"},"language":"en","primary_location":{"id":"doi:10.1007/bf02250584","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02250584","pdf_url":null,"source":{"id":"https://openalex.org/S35593046","display_name":"Computing","issn_l":"0010-485X","issn":["0010-485X","1436-5057"],"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":"Computing","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/A5044307799","display_name":"Rainer E. Burkard","orcid":null},"institutions":[{"id":"https://openalex.org/I4092182","display_name":"Graz University of Technology","ror":"https://ror.org/00d7xrm67","country_code":"AT","type":"education","lineage":["https://openalex.org/I4092182"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"R. E. Burkard","raw_affiliation_strings":["Institut f\u00fcr Mathematik, Technische Universit\u00e4t Graz, Kopernikusgasse 24, A-8010, Graz, Austria","[Institut fur Mathematik, Technische Universitat Graz, Graz, Austria]"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Mathematik, Technische Universit\u00e4t Graz, Kopernikusgasse 24, A-8010, Graz, Austria","institution_ids":["https://openalex.org/I4092182"]},{"raw_affiliation_string":"[Institut fur Mathematik, Technische Universitat Graz, Graz, Austria]","institution_ids":["https://openalex.org/I4092182"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111897488","display_name":"G. Rote","orcid":null},"institutions":[{"id":"https://openalex.org/I4092182","display_name":"Graz University of Technology","ror":"https://ror.org/00d7xrm67","country_code":"AT","type":"education","lineage":["https://openalex.org/I4092182"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"G. Rote","raw_affiliation_strings":["Institut f\u00fcr Mathematik, Technische Universit\u00e4t Graz, Kopernikusgasse 24, A-8010, Graz, Austria","[Institut fur Mathematik, Technische Universitat Graz, Graz, Austria]"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Mathematik, Technische Universit\u00e4t Graz, Kopernikusgasse 24, A-8010, Graz, Austria","institution_ids":["https://openalex.org/I4092182"]},{"raw_affiliation_string":"[Institut fur Mathematik, Technische Universitat Graz, Graz, Austria]","institution_ids":["https://openalex.org/I4092182"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109852840","display_name":"E. Y. Yao","orcid":null},"institutions":[{"id":"https://openalex.org/I76130692","display_name":"Zhejiang University","ror":"https://ror.org/00a2xv884","country_code":"CN","type":"education","lineage":["https://openalex.org/I76130692"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"E. Y. Yao","raw_affiliation_strings":["Mathematical Department, Zhejiang University, Hangzhou, P. R. China"],"affiliations":[{"raw_affiliation_string":"Mathematical Department, Zhejiang University, Hangzhou, P. R. China","institution_ids":["https://openalex.org/I76130692"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051450376","display_name":"Zhanke Yu","orcid":"https://orcid.org/0000-0002-1587-5294"},"institutions":[{"id":"https://openalex.org/I167027274","display_name":"Nanjing Forestry University","ror":"https://ror.org/03m96p165","country_code":"CN","type":"education","lineage":["https://openalex.org/I167027274"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Z. L. Yu","raw_affiliation_strings":["Mathematical Section, Forestry University Nanjing, Nanjing, P.R. China"],"affiliations":[{"raw_affiliation_string":"Mathematical Section, Forestry University Nanjing, Nanjing, P.R. China","institution_ids":["https://openalex.org/I167027274"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5044307799"],"corresponding_institution_ids":["https://openalex.org/I4092182"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":1.1924,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.76094891,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"45","issue":"1","first_page":"51","last_page":"68"},"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.9998999834060669,"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.9998999834060669,"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.9948999881744385,"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/T11106","display_name":"Data Management and Algorithms","score":0.9898999929428101,"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/shortest-path-problem","display_name":"Shortest path problem","score":0.7212849855422974},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6735947728157043},{"id":"https://openalex.org/keywords/convex-polygon","display_name":"Convex polygon","score":0.5718023180961609},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.5655462145805359},{"id":"https://openalex.org/keywords/inscribed-figure","display_name":"Inscribed figure","score":0.5408137440681458},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5148250460624695},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4853731393814087},{"id":"https://openalex.org/keywords/simple-polygon","display_name":"Simple polygon","score":0.4812288284301758},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.45144838094711304},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.44804513454437256},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4402424693107605},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4336608052253723},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2287990152835846},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.1868763267993927},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.10851973295211792}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7212849855422974},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6735947728157043},{"id":"https://openalex.org/C2780034980","wikidata":"https://www.wikidata.org/wiki/Q3259505","display_name":"Convex polygon","level":3,"score":0.5718023180961609},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.5655462145805359},{"id":"https://openalex.org/C44074806","wikidata":"https://www.wikidata.org/wiki/Q1066790","display_name":"Inscribed figure","level":2,"score":0.5408137440681458},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5148250460624695},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4853731393814087},{"id":"https://openalex.org/C197949415","wikidata":"https://www.wikidata.org/wiki/Q782746","display_name":"Simple polygon","level":3,"score":0.4812288284301758},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.45144838094711304},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.44804513454437256},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4402424693107605},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4336608052253723},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2287990152835846},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.1868763267993927},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.10851973295211792},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"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.1007/bf02250584","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02250584","pdf_url":null,"source":{"id":"https://openalex.org/S35593046","display_name":"Computing","issn_l":"0010-485X","issn":["0010-485X","1436-5057"],"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":"Computing","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":19,"referenced_works":["https://openalex.org/W50345141","https://openalex.org/W1503503090","https://openalex.org/W1526377505","https://openalex.org/W1965663795","https://openalex.org/W2002974434","https://openalex.org/W2008416425","https://openalex.org/W2022754388","https://openalex.org/W2023182928","https://openalex.org/W2032159439","https://openalex.org/W2053106191","https://openalex.org/W2053450955","https://openalex.org/W2059078864","https://openalex.org/W2081777693","https://openalex.org/W2087686493","https://openalex.org/W2108567935","https://openalex.org/W2132339863","https://openalex.org/W4205203170","https://openalex.org/W6604620090","https://openalex.org/W6638676024"],"related_works":["https://openalex.org/W2156431668","https://openalex.org/W1579553590","https://openalex.org/W2997571660","https://openalex.org/W4285129093","https://openalex.org/W2153732620","https://openalex.org/W2980991945","https://openalex.org/W4288091041","https://openalex.org/W2133099431","https://openalex.org/W146351743","https://openalex.org/W1992049804"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"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"}