{"id":"https://openalex.org/W2765833225","doi":"https://doi.org/10.1007/978-3-319-70004-5_5","title":"An Iterative Algorithm for Computing Shortest Paths Through Line Segments in 3D","display_name":"An Iterative Algorithm for Computing Shortest Paths Through Line Segments in 3D","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2765833225","doi":"https://doi.org/10.1007/978-3-319-70004-5_5","mag":"2765833225"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-70004-5_5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-70004-5_5","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","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/A5071064677","display_name":"Le Hong Trang","orcid":"https://orcid.org/0000-0002-6011-2261"},"institutions":[{"id":"https://openalex.org/I47265099","display_name":"Ho Chi Minh City University of Technology","ror":"https://ror.org/04qva2324","country_code":"VN","type":"education","lineage":["https://openalex.org/I123565023","https://openalex.org/I47265099"]}],"countries":["VN"],"is_corresponding":true,"raw_author_name":"Le Hong Trang","raw_affiliation_strings":["Faculty of Computer Sicence and Engineering, Ho Chi Minh City University of Technology, 268 Ly Thuong Kiet, Distr. 10, Ho Chi Minh City, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Computer Sicence and Engineering, Ho Chi Minh City University of Technology, 268 Ly Thuong Kiet, Distr. 10, Ho Chi Minh City, Vietnam","institution_ids":["https://openalex.org/I47265099"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070741730","display_name":"Quynh Chi Truong","orcid":null},"institutions":[{"id":"https://openalex.org/I47265099","display_name":"Ho Chi Minh City University of Technology","ror":"https://ror.org/04qva2324","country_code":"VN","type":"education","lineage":["https://openalex.org/I123565023","https://openalex.org/I47265099"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Quynh Chi Truong","raw_affiliation_strings":["Faculty of Computer Sicence and Engineering, Ho Chi Minh City University of Technology, 268 Ly Thuong Kiet, Distr. 10, Ho Chi Minh City, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Computer Sicence and Engineering, Ho Chi Minh City University of Technology, 268 Ly Thuong Kiet, Distr. 10, Ho Chi Minh City, Vietnam","institution_ids":["https://openalex.org/I47265099"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029072011","display_name":"Tran Khanh Dang","orcid":"https://orcid.org/0000-0002-7282-3589"},"institutions":[{"id":"https://openalex.org/I47265099","display_name":"Ho Chi Minh City University of Technology","ror":"https://ror.org/04qva2324","country_code":"VN","type":"education","lineage":["https://openalex.org/I123565023","https://openalex.org/I47265099"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Tran Khanh Dang","raw_affiliation_strings":["Faculty of Computer Sicence and Engineering, Ho Chi Minh City University of Technology, 268 Ly Thuong Kiet, Distr. 10, Ho Chi Minh City, Vietnam","HCMC University of Technology, Ho Chi Minh City, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Computer Sicence and Engineering, Ho Chi Minh City University of Technology, 268 Ly Thuong Kiet, Distr. 10, Ho Chi Minh City, Vietnam","institution_ids":["https://openalex.org/I47265099"]},{"raw_affiliation_string":"HCMC University of Technology, Ho Chi Minh City, Vietnam","institution_ids":["https://openalex.org/I47265099"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5071064677"],"corresponding_institution_ids":["https://openalex.org/I47265099"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"73","last_page":"84"},"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.9995999932289124,"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.9995999932289124,"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.996399998664856,"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/T11099","display_name":"Autonomous Vehicle Technology and Safety","score":0.9936000108718872,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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/shortest-path-problem","display_name":"Shortest path problem","score":0.8287553787231445},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6603520512580872},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6327961683273315},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.615767240524292},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5693200826644897},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5492461323738098},{"id":"https://openalex.org/keywords/iterative-closest-point","display_name":"Iterative closest point","score":0.546719491481781},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.5443368554115295},{"id":"https://openalex.org/keywords/line-segment","display_name":"Line segment","score":0.5329186916351318},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.522826075553894},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.4906233847141266},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4903724193572998},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.4795522391796112},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.4396533668041229},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.43508657813072205},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3638353943824768},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2657421827316284},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.21775618195533752},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.19062542915344238},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11696824431419373},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.08267414569854736},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.06296288967132568}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8287553787231445},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6603520512580872},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6327961683273315},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.615767240524292},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5693200826644897},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5492461323738098},{"id":"https://openalex.org/C195958017","wikidata":"https://www.wikidata.org/wiki/Q1675268","display_name":"Iterative closest point","level":3,"score":0.546719491481781},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.5443368554115295},{"id":"https://openalex.org/C182124507","wikidata":"https://www.wikidata.org/wiki/Q166154","display_name":"Line segment","level":2,"score":0.5329186916351318},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.522826075553894},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.4906233847141266},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4903724193572998},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.4795522391796112},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.4396533668041229},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.43508657813072205},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3638353943824768},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2657421827316284},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.21775618195533752},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.19062542915344238},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11696824431419373},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.08267414569854736},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.06296288967132568},{"id":"https://openalex.org/C131979681","wikidata":"https://www.wikidata.org/wiki/Q1899648","display_name":"Point cloud","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/978-3-319-70004-5_5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-70004-5_5","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W240977677","https://openalex.org/W1559701472","https://openalex.org/W1679085596","https://openalex.org/W1974931598","https://openalex.org/W2012669981","https://openalex.org/W2017117017","https://openalex.org/W2020422796","https://openalex.org/W2024693023","https://openalex.org/W2063244634","https://openalex.org/W2080237972","https://openalex.org/W2081777693","https://openalex.org/W2108567935","https://openalex.org/W2114121462","https://openalex.org/W2159549579","https://openalex.org/W2188452531"],"related_works":["https://openalex.org/W2360981904","https://openalex.org/W2156431668","https://openalex.org/W2347245430","https://openalex.org/W2375775343","https://openalex.org/W2112429204","https://openalex.org/W2562562750","https://openalex.org/W2198982833","https://openalex.org/W4293054712","https://openalex.org/W2368964068","https://openalex.org/W2739392875"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}