{"id":"https://openalex.org/W4214676705","doi":"https://doi.org/10.3390/a15030079","title":"An Effective Algorithm for Finding Shortest Paths in Tubular Spaces","display_name":"An Effective Algorithm for Finding Shortest Paths in Tubular Spaces","publication_year":2022,"publication_date":"2022-02-25","ids":{"openalex":"https://openalex.org/W4214676705","doi":"https://doi.org/10.3390/a15030079"},"language":"en","primary_location":{"id":"doi:10.3390/a15030079","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a15030079","pdf_url":"https://www.mdpi.com/1999-4893/15/3/79/pdf?version=1646121215","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/15/3/79/pdf?version=1646121215","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5018982635","display_name":"D. V. A. Nguyen","orcid":"https://orcid.org/0000-0002-7988-8457"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I2802759292","display_name":"Franche-Comt\u00e9 \u00c9lectronique M\u00e9canique Thermique et Optique - Sciences et Technologies","ror":"https://ror.org/004fmxv66","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I2802759292","https://openalex.org/I37553959","https://openalex.org/I4210095849","https://openalex.org/I4405256580","https://openalex.org/I53262699"]},{"id":"https://openalex.org/I4210118524","display_name":"Universit\u00e9 Bourgogne Franche-Comt\u00e9","ror":"https://ror.org/02dn7x778","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210118524"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Dang-Viet-Anh Nguyen","raw_affiliation_strings":["FEMTO-ST Institute, University Bourgogne Franche-Comt\u00e9, CNRS, 25000 Besan\u00e7on, France"],"raw_orcid":"https://orcid.org/0000-0002-7988-8457","affiliations":[{"raw_affiliation_string":"FEMTO-ST Institute, University Bourgogne Franche-Comt\u00e9, CNRS, 25000 Besan\u00e7on, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I2802759292","https://openalex.org/I4210118524"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084974660","display_name":"J\u00e9r\u00f4me Szewczyk","orcid":"https://orcid.org/0000-0003-1925-3086"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I154526488","display_name":"Inserm","ror":"https://ror.org/02vjkv261","country_code":"FR","type":"government","lineage":["https://openalex.org/I154526488"]},{"id":"https://openalex.org/I39804081","display_name":"Sorbonne Universit\u00e9","ror":"https://ror.org/02en5vm52","country_code":"FR","type":"education","lineage":["https://openalex.org/I39804081"]},{"id":"https://openalex.org/I4210150358","display_name":"Institut Syst\u00e8mes Intelligents et de Robotique","ror":"https://ror.org/05neq8668","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I154526488","https://openalex.org/I39804081","https://openalex.org/I4210150358","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"J\u00e9r\u00f4me Szewczyk","raw_affiliation_strings":["Institute for Intelligent Systems and Robotics (ISIR), Sorbonne University, CNRS, INSERM, 75005 Paris, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Intelligent Systems and Robotics (ISIR), Sorbonne University, CNRS, INSERM, 75005 Paris, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I154526488","https://openalex.org/I39804081","https://openalex.org/I4210150358"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044471992","display_name":"Kanty Rabenorosoa","orcid":"https://orcid.org/0000-0001-5946-1889"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I2802759292","display_name":"Franche-Comt\u00e9 \u00c9lectronique M\u00e9canique Thermique et Optique - Sciences et Technologies","ror":"https://ror.org/004fmxv66","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I2802759292","https://openalex.org/I37553959","https://openalex.org/I4210095849","https://openalex.org/I4405256580","https://openalex.org/I53262699"]},{"id":"https://openalex.org/I4210118524","display_name":"Universit\u00e9 Bourgogne Franche-Comt\u00e9","ror":"https://ror.org/02dn7x778","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210118524"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Kanty Rabenorosoa","raw_affiliation_strings":["FEMTO-ST Institute, University Bourgogne Franche-Comt\u00e9, CNRS, 25000 Besan\u00e7on, France"],"raw_orcid":"https://orcid.org/0000-0001-5946-1889","affiliations":[{"raw_affiliation_string":"FEMTO-ST Institute, University Bourgogne Franche-Comt\u00e9, CNRS, 25000 Besan\u00e7on, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I2802759292","https://openalex.org/I4210118524"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5018982635"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I2802759292","https://openalex.org/I4210118524"],"apc_list":{"value":1600,"currency":"CHF","value_usd":1782},"apc_paid":{"value":1262,"currency":"EUR","value_usd":1361},"fwci":0.081,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.2938474,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"15","issue":"3","first_page":"79","last_page":"79"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9994000196456909,"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"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9994000196456909,"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.9976000189781189,"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"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9591000080108643,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.7653592824935913},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.7494387030601501},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.7186557054519653},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6952885389328003},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.6912598609924316},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.6590004563331604},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6315556764602661},{"id":"https://openalex.org/keywords/visibility-graph","display_name":"Visibility graph","score":0.6103652119636536},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.551336407661438},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.49090081453323364},{"id":"https://openalex.org/keywords/pathfinding","display_name":"Pathfinding","score":0.48593106865882874},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4659966230392456},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.43932658433914185},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.43425580859184265},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.42867642641067505},{"id":"https://openalex.org/keywords/suurballes-algorithm","display_name":"Suurballe's algorithm","score":0.41348153352737427},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4002460837364197},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.17008516192436218},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.16614031791687012},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.15996918082237244},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1419997215270996},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.10891616344451904},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.10749801993370056}],"concepts":[{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.7653592824935913},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.7494387030601501},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.7186557054519653},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6952885389328003},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.6912598609924316},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.6590004563331604},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6315556764602661},{"id":"https://openalex.org/C173362246","wikidata":"https://www.wikidata.org/wiki/Q8216024","display_name":"Visibility graph","level":3,"score":0.6103652119636536},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.551336407661438},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.49090081453323364},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.48593106865882874},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4659966230392456},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.43932658433914185},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.43425580859184265},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.42867642641067505},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.41348153352737427},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4002460837364197},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.17008516192436218},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.16614031791687012},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.15996918082237244},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1419997215270996},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.10891616344451904},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.10749801993370056},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.3390/a15030079","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a15030079","pdf_url":"https://www.mdpi.com/1999-4893/15/3/79/pdf?version=1646121215","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-04273618v1","is_oa":false,"landing_page_url":"https://hal.science/hal-04273618","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, 2022, 15 (3), ⟨10.3390/a15030079⟩","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:doaj.org/article:932f03233a3048d6a9758887464b60ae","is_oa":false,"landing_page_url":"https://doaj.org/article/932f03233a3048d6a9758887464b60ae","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 15, Iss 3, p 79 (2022)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/15/3/79/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a15030079","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms; Volume 15; Issue 3; Pages: 79","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a15030079","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a15030079","pdf_url":"https://www.mdpi.com/1999-4893/15/3/79/pdf?version=1646121215","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2256839388","display_name":"MicroRobot-assisted Cholesteatoma Surgery","funder_award_id":"ANR-17-CE19-0005","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G6129730045","display_name":"Ing\u00e9nierie et Innovation par les sciences physiques, les savoir-faire technologiques et l'interdisciplinarit\u00e9","funder_award_id":"ANR-17-EURE-0002","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4214676705.pdf"},"referenced_works_count":40,"referenced_works":["https://openalex.org/W12428211","https://openalex.org/W1559701472","https://openalex.org/W1561451935","https://openalex.org/W1851459058","https://openalex.org/W1969483458","https://openalex.org/W2010806162","https://openalex.org/W2053614949","https://openalex.org/W2062558938","https://openalex.org/W2079848878","https://openalex.org/W2111281539","https://openalex.org/W2112724282","https://openalex.org/W2136957179","https://openalex.org/W2140746528","https://openalex.org/W2146617971","https://openalex.org/W2156731407","https://openalex.org/W2164593186","https://openalex.org/W2169528473","https://openalex.org/W2170220350","https://openalex.org/W2179600242","https://openalex.org/W2513622562","https://openalex.org/W2556114933","https://openalex.org/W2561251170","https://openalex.org/W2608018532","https://openalex.org/W2804333790","https://openalex.org/W2899149503","https://openalex.org/W2904519918","https://openalex.org/W2909201774","https://openalex.org/W2916322746","https://openalex.org/W2973711412","https://openalex.org/W3005316764","https://openalex.org/W3080195572","https://openalex.org/W3138807513","https://openalex.org/W3173650372","https://openalex.org/W3214726554","https://openalex.org/W4233514863","https://openalex.org/W4250589301","https://openalex.org/W4252795229","https://openalex.org/W6729930418","https://openalex.org/W6792319920","https://openalex.org/W6903391969"],"related_works":["https://openalex.org/W2161960576","https://openalex.org/W2597144308","https://openalex.org/W2368964068","https://openalex.org/W1617152041","https://openalex.org/W1875225138","https://openalex.org/W4310271105","https://openalex.org/W2369379323","https://openalex.org/W1990009669","https://openalex.org/W2391130892","https://openalex.org/W4352982540"],"abstract_inverted_index":{"We":[0],"propose":[1],"a":[2,13,22,34,138,142],"novel":[3],"algorithm":[4,83,132],"to":[5,17,39,91,114],"determine":[6],"the":[7,30,45,48,52,56,66,77,80,88,94,102,126,130],"Euclidean":[8],"shortest":[9,53,103],"path":[10,54,104],"(ESP)":[11],"from":[12],"given":[14],"point":[15,19],"(source)":[16],"another":[18],"(destination)":[20],"inside":[21,55],"tubular":[23,121],"space.":[24],"The":[25,108],"method":[26,110],"is":[27,111,133],"based":[28],"on":[29,76],"observation":[31],"data":[32],"of":[33,51,79,97,120],"virtual":[35],"particle":[36],"(VP)":[37],"assumed":[38],"move":[40],"along":[41],"this":[42],"path.":[43],"In":[44,123],"first":[46],"step,":[47],"geometric":[49],"properties":[50],"considered":[57],"space":[58],"are":[59],"presented":[60],"and":[61,92,100,136],"proven.":[62],"Utilizing":[63],"these":[64],"properties,":[65],"desired":[67],"ESP":[68],"can":[69],"be":[70,106],"segmented":[71],"into":[72],"three":[73],"partitions":[74],"depending":[75],"visibility":[78],"VP.":[81],"Our":[82],"will":[84,105],"check":[85],"which":[86],"partition":[87],"VP":[89],"belongs":[90],"calculate":[93],"correct":[95],"direction":[96],"its":[98],"movement,":[99],"thus":[101],"traced.":[107],"proposed":[109,131],"then":[112],"compared":[113],"Dijkstra\u2019s":[115,150],"algorithm,":[116],"considering":[117],"different":[118],"types":[119],"spaces.":[122],"all":[124],"cases,":[125],"solution":[127],"provided":[128],"by":[129,149],"smoother,":[134],"shorter,":[135],"has":[137],"higher":[139],"accuracy":[140],"with":[141],"faster":[143],"calculation":[144],"speed":[145],"than":[146],"that":[147],"obtained":[148],"method.":[151]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2022-03-02T00:00:00"}