{"id":"https://openalex.org/W2052512910","doi":"https://doi.org/10.1115/1.4026183","title":"Computation of the Shortest Path in a Bounded Domain With Free Form Boundary by Domain Partitioning","display_name":"Computation of the Shortest Path in a Bounded Domain With Free Form Boundary by Domain Partitioning","publication_year":2013,"publication_date":"2013-12-09","ids":{"openalex":"https://openalex.org/W2052512910","doi":"https://doi.org/10.1115/1.4026183","mag":"2052512910"},"language":"en","primary_location":{"id":"doi:10.1115/1.4026183","is_oa":false,"landing_page_url":"https://doi.org/10.1115/1.4026183","pdf_url":null,"source":{"id":"https://openalex.org/S173178594","display_name":"Journal of Computing and Information Science in Engineering","issn_l":"1530-9827","issn":["1530-9827","1944-7078"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316053","host_organization_name":"ASM International","host_organization_lineage":["https://openalex.org/P4310316053"],"host_organization_lineage_names":["ASM International"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computing and Information Science in Engineering","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/A5109114196","display_name":"ChiKit Au","orcid":null},"institutions":[{"id":"https://openalex.org/I52179390","display_name":"University of Waikato","ror":"https://ror.org/013fsnh78","country_code":"NZ","type":"education","lineage":["https://openalex.org/I52179390"]}],"countries":["NZ"],"is_corresponding":true,"raw_author_name":"ChiKit Au","raw_affiliation_strings":["Faculty of Engineering, University of Waikato, Private Bag 3105 Hamilton 3260, New Zealand e-mail:","Faculty of Engineering,#N#University of Waikato,#N#Private Bag 3105#N#Hamilton 3260, New Zealande-mail:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Engineering, University of Waikato, Private Bag 3105 Hamilton 3260, New Zealand e-mail:","institution_ids":["https://openalex.org/I52179390"]},{"raw_affiliation_string":"Faculty of Engineering,#N#University of Waikato,#N#Private Bag 3105#N#Hamilton 3260, New Zealande-mail:","institution_ids":["https://openalex.org/I52179390"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090840919","display_name":"Yongsheng Ma","orcid":"https://orcid.org/0000-0002-6155-0167"},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Youngsheng Ma","raw_affiliation_strings":["Department of Mechanical Engineering, University of Alberta, Edmonton T6G 2G8, Canada e-mail:","Department of Mechanical Engineering,#N#University of Alberta,#N#Edmonton T6G 2G8, Canadae-mail:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering, University of Alberta, Edmonton T6G 2G8, Canada e-mail:","institution_ids":["https://openalex.org/I154425047"]},{"raw_affiliation_string":"Department of Mechanical Engineering,#N#University of Alberta,#N#Edmonton T6G 2G8, Canadae-mail:","institution_ids":["https://openalex.org/I154425047"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5109114196"],"corresponding_institution_ids":["https://openalex.org/I52179390"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.16038035,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"14","issue":"2","first_page":null,"last_page":null},"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.9993000030517578,"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.9993000030517578,"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.9987999796867371,"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/T11245","display_name":"Advanced Numerical Analysis Techniques","score":0.9678000211715698,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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.7021350860595703},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.667866051197052},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.6147843599319458},{"id":"https://openalex.org/keywords/boundary","display_name":"Boundary (topology)","score":0.5819542407989502},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.5795767903327942},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5353266596794128},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4995884895324707},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.47815951704978943},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4723457098007202},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3714253902435303},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.36962923407554626},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.3653142750263214},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3549659252166748},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.23386147618293762},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.21107026934623718},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.20789265632629395},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2005884349346161},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.05991333723068237}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7021350860595703},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.667866051197052},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.6147843599319458},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.5819542407989502},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.5795767903327942},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5353266596794128},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4995884895324707},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.47815951704978943},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4723457098007202},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3714253902435303},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.36962923407554626},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3653142750263214},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3549659252166748},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.23386147618293762},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.21107026934623718},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.20789265632629395},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2005884349346161},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.05991333723068237},{"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1115/1.4026183","is_oa":false,"landing_page_url":"https://doi.org/10.1115/1.4026183","pdf_url":null,"source":{"id":"https://openalex.org/S173178594","display_name":"Journal of Computing and Information Science in Engineering","issn_l":"1530-9827","issn":["1530-9827","1944-7078"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316053","host_organization_name":"ASM International","host_organization_lineage":["https://openalex.org/P4310316053"],"host_organization_lineage_names":["ASM International"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computing and Information Science in Engineering","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W578994982","https://openalex.org/W1482503584","https://openalex.org/W1519368613","https://openalex.org/W1971771315","https://openalex.org/W1987415148","https://openalex.org/W2016584965","https://openalex.org/W2029668981","https://openalex.org/W2032159439","https://openalex.org/W2050232743","https://openalex.org/W2058510050","https://openalex.org/W2058872551","https://openalex.org/W2063244634","https://openalex.org/W2068536376","https://openalex.org/W2165414070"],"related_works":["https://openalex.org/W2360981904","https://openalex.org/W2562562750","https://openalex.org/W2347245430","https://openalex.org/W2377950158","https://openalex.org/W2112429204","https://openalex.org/W2375775343","https://openalex.org/W4293054712","https://openalex.org/W2365712669","https://openalex.org/W4200172719","https://openalex.org/W2198982833"],"abstract_inverted_index":{"The":[0,33,172],"shortest":[1,25,82,115,124,148,173],"path":[2,26,83,174],"computation":[3],"is":[4,45,99,153,162,178],"important":[5],"in":[6,88],"industrial":[7],"automation,":[8],"especially":[9],"for":[10,36],"robot":[11],"and":[12],"autonomous":[13],"vehicle":[14],"navigation.":[15],"However,":[16],"most":[17],"of":[18,71,109,120,131,146,158],"the":[19,24,48,58,69,72,81,110,114,121,129,132,144,147,150,167],"computations":[20],"concentrate":[21],"on":[22,143],"computing":[23,60],"between":[27,84,175],"two":[28,85,176],"points":[29,87,111,119,177],"within":[30],"a":[31,38,51,89,105,156],"polygon.":[32],"common":[34],"approach":[35,78],"handling":[37],"bounded":[39,151],"domain":[40,49,93,152],"with":[41],"free":[42,90],"form":[43,91],"boundary":[44,54,92,96,133],"to":[46,79,117,165],"convert":[47],"into":[50,155],"polygon":[52],"by":[53,102,128],"approximation":[55,67],"so":[56,134],"that":[57,135],"conventional":[59],"algorithms":[61],"can":[62],"be":[63],"used.":[64],"Such":[65],"an":[66,77],"affects":[68],"accuracy":[70],"path.":[73],"This":[74,98],"article":[75],"presents":[76],"compute":[80],"given":[86],"without":[94],"any":[95],"approximation.":[97],"addressed":[100],"geometrically":[101],"imaginably":[103],"placing":[104],"source":[106],"at":[107],"one":[108],"which":[112],"radiates":[113],"paths":[116,125],"various":[118],"domain.":[122],"Some":[123],"are":[126,137],"deflected":[127],"geometry":[130],"they":[136],"no":[138],"longer":[139],"straight":[140],"lines.":[141],"Based":[142],"deflections":[145],"paths,":[149],"partitioned":[154],"set":[157],"subdomains.":[159,171],"A":[160],"tree":[161],"then":[163],"constructed":[164],"show":[166],"relationships":[168],"among":[169],"these":[170],"obtained":[179],"from":[180],"this":[181],"tree.":[182]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}