{"id":"https://openalex.org/W2105003074","doi":"https://doi.org/10.1007/s11590-014-0776-0","title":"Thick non-crossing paths in a polygonal domain","display_name":"Thick non-crossing paths in a polygonal domain","publication_year":2014,"publication_date":"2014-08-04","ids":{"openalex":"https://openalex.org/W2105003074","doi":"https://doi.org/10.1007/s11590-014-0776-0","mag":"2105003074"},"language":"en","primary_location":{"id":"doi:10.1007/s11590-014-0776-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s11590-014-0776-0","pdf_url":null,"source":{"id":"https://openalex.org/S12647387","display_name":"Optimization Letters","issn_l":"1862-4472","issn":["1862-4472","1862-4480"],"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":"Optimization 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/A5005571774","display_name":"Maryam Tahmasbi","orcid":null},"institutions":[{"id":"https://openalex.org/I48379061","display_name":"Shahid Beheshti University","ror":"https://ror.org/0091vmj44","country_code":"IR","type":"education","lineage":["https://openalex.org/I48379061"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Maryam Tahmasbi","raw_affiliation_strings":["Department of Computer Science, Shahid Beheshti University, G.C., Tehran, Iran","Department of Computer Science, Shahid Beheshti University, G.C, Tehran, Iran#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Shahid Beheshti University, G.C., Tehran, Iran","institution_ids":["https://openalex.org/I48379061"]},{"raw_affiliation_string":"Department of Computer Science, Shahid Beheshti University, G.C, Tehran, Iran#TAB#","institution_ids":["https://openalex.org/I48379061"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022146761","display_name":"Narges Mirehi","orcid":null},"institutions":[{"id":"https://openalex.org/I48379061","display_name":"Shahid Beheshti University","ror":"https://ror.org/0091vmj44","country_code":"IR","type":"education","lineage":["https://openalex.org/I48379061"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Narges Mirehi","raw_affiliation_strings":["Department of Computer Science, Shahid Beheshti University, G.C., Tehran, Iran","Department of Computer Science, Shahid Beheshti University, G.C, Tehran, Iran#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Shahid Beheshti University, G.C., Tehran, Iran","institution_ids":["https://openalex.org/I48379061"]},{"raw_affiliation_string":"Department of Computer Science, Shahid Beheshti University, G.C, Tehran, Iran#TAB#","institution_ids":["https://openalex.org/I48379061"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5005571774"],"corresponding_institution_ids":["https://openalex.org/I48379061"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.21423841,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"9","issue":"4","first_page":"743","last_page":"753"},"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.9972000122070312,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9865999817848206,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/polygon","display_name":"Polygon (computer graphics)","score":0.716568112373352},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.5759949684143066},{"id":"https://openalex.org/keywords/boundary","display_name":"Boundary (topology)","score":0.5659049153327942},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5565299987792969},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5490055084228516},{"id":"https://openalex.org/keywords/convex-polygon","display_name":"Convex polygon","score":0.5240036249160767},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5164259076118469},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5012311935424805},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4925132691860199},{"id":"https://openalex.org/keywords/terminal","display_name":"Terminal (telecommunication)","score":0.465537428855896},{"id":"https://openalex.org/keywords/polygonal-chain","display_name":"Polygonal chain","score":0.43220192193984985},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35551023483276367},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.3454599380493164},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.33476442098617554},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.2119179368019104},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.07017406821250916},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.06668922305107117}],"concepts":[{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.716568112373352},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.5759949684143066},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.5659049153327942},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5565299987792969},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5490055084228516},{"id":"https://openalex.org/C2780034980","wikidata":"https://www.wikidata.org/wiki/Q3259505","display_name":"Convex polygon","level":3,"score":0.5240036249160767},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5164259076118469},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5012311935424805},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4925132691860199},{"id":"https://openalex.org/C2779664074","wikidata":"https://www.wikidata.org/wiki/Q3518405","display_name":"Terminal (telecommunication)","level":2,"score":0.465537428855896},{"id":"https://openalex.org/C182860218","wikidata":"https://www.wikidata.org/wiki/Q633674","display_name":"Polygonal chain","level":3,"score":0.43220192193984985},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35551023483276367},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3454599380493164},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.33476442098617554},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.2119179368019104},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.07017406821250916},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.06668922305107117},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"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/s11590-014-0776-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s11590-014-0776-0","pdf_url":null,"source":{"id":"https://openalex.org/S12647387","display_name":"Optimization Letters","issn_l":"1862-4472","issn":["1862-4472","1862-4480"],"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":"Optimization 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":12,"referenced_works":["https://openalex.org/W1555471913","https://openalex.org/W1557803567","https://openalex.org/W1559701472","https://openalex.org/W2000223409","https://openalex.org/W2004711288","https://openalex.org/W2052075839","https://openalex.org/W2072695444","https://openalex.org/W2104671918","https://openalex.org/W2105353235","https://openalex.org/W2115001291","https://openalex.org/W2148435166","https://openalex.org/W4240848777"],"related_works":["https://openalex.org/W2090451920","https://openalex.org/W1993308768","https://openalex.org/W2185857837","https://openalex.org/W2314484939","https://openalex.org/W4313269929","https://openalex.org/W4240339429","https://openalex.org/W2035680816","https://openalex.org/W1980201470","https://openalex.org/W1911472513","https://openalex.org/W2154141401"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}