{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T12:39:34Z","timestamp":1753879174171,"version":"3.41.2"},"reference-count":15,"publisher":"ASME International","issue":"2","content-domain":{"domain":["asmedigitalcollection.asme.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,6,1]]},"abstract":"<jats:p>The shortest path computation is important in industrial automation, especially for robot and autonomous vehicle navigation. However, most of the computations concentrate on computing the shortest path between two points within a polygon. The common approach for handling a bounded domain with free form boundary is to convert the domain into a polygon by boundary approximation so that the conventional computing algorithms can be used. Such an approximation affects the accuracy of the path. This article presents an approach to compute the shortest path between two given points in a free form boundary domain without any boundary approximation. This is addressed geometrically by imaginably placing a source at one of the points which radiates the shortest paths to various points of the domain. Some shortest paths are deflected by the geometry of the boundary so that they are no longer straight lines. Based on the deflections of the shortest paths, the bounded domain is partitioned into a set of subdomains. A tree is then constructed to show the relationships among these subdomains. The shortest path between two points is obtained from this tree.<\/jats:p>","DOI":"10.1115\/1.4026183","type":"journal-article","created":{"date-parts":[[2013,12,9]],"date-time":"2013-12-09T09:30:43Z","timestamp":1386581443000},"update-policy":"https:\/\/doi.org\/10.1115\/crossmarkpolicy-asme","source":"Crossref","is-referenced-by-count":0,"title":["Computation of the Shortest Path in a Bounded Domain With Free Form Boundary by Domain Partitioning"],"prefix":"10.1115","volume":"14","author":[{"given":"ChiKit","family":"Au","sequence":"first","affiliation":[{"name":"Faculty of Engineering, University of Waikato, Private Bag 3105 Hamilton 3260, New Zealand e-mail:"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Youngsheng","family":"Ma","sequence":"additional","affiliation":[{"name":"Department of Mechanical Engineering, University of Alberta, Edmonton T6G 2G8, Canada e-mail:"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"33","published-online":{"date-parts":[[2014,2,26]]},"reference":[{"issue":"2","key":"2019100601074443600_B1","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0020-0190(86)90045-1","article-title":"Shortest Paths in the Plane With Convex Polygonal Obstacles","volume":"23","year":"1986","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"2019100601074443600_B2","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0167-8655(86)90015-2","article-title":"Shortest Path Solves Edge-to-Edge Visibility in a Polygon","volume":"4","year":"1986","journal-title":"Pattern Recogn. Lett."},{"key":"2019100601074443600_B3","doi-asserted-by":"crossref","unstructured":"Ghosh, S. K., and Mount, D. M., 1987, \u201cAn Output Sensitive Algorithm for Computing Visibility Graphs,\u201d Proceeding SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science, pp. 11\u201319.","DOI":"10.1109\/SFCS.1987.6"},{"issue":"6","key":"2019100601074443600_B4","doi-asserted-by":"crossref","first-page":"2215","DOI":"10.1137\/S0097539795289604","article-title":"An Optimal Algorithm for Euclidean Shortest Paths in the Plane","volume":"28","year":"1999","journal-title":"SIAM J. Sci. Comput."},{"issue":"4","key":"2019100601074443600_B5","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/PL00009323","article-title":"An Efficient Algorithm for Euclidean Shortest Paths Among Polygonal Obstacles in the Plane","volume":"18","year":"1997","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"2019100601074443600_B6","first-page":"289","article-title":"Shape Classification Using the Inner-Distance","volume":"29","year":"2007","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"3","key":"2019100601074443600_B7","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1002\/net.3230140304","article-title":"Euclidean Shortest Paths in the Presence of Rectilinear Barriers","volume":"14","year":"1984","journal-title":"Networks"},{"issue":"4","key":"2019100601074443600_B8","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1137\/0221038","article-title":"Shortest Paths Help Solve Geometric Optimization Problems in Planar Regions","volume":"21","year":"1992","journal-title":"SIAM J. Sci. Comput."},{"issue":"2","key":"2019100601074443600_B9","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0304-3975(93)90019-P","article-title":"Shortest Curves in Planar Regions With Curved Boundary","volume":"112","year":"1993","journal-title":"Theor. Comput. Sci."},{"issue":"9","key":"2019100601074443600_B10","first-page":"75","article-title":"Shortest Arcs in Closed Planar Disks Vary Continuously With the Boundary","volume":"95","year":"1999","journal-title":"Topol. Appl."},{"issue":"8","key":"2019100601074443600_B11","first-page":"923","article-title":"The Shortest Path in a Simply-Connected Domain Having a Curved Boundary","volume":"43","year":"2012","journal-title":"Comput.-Aided Des."},{"first-page":"280","article-title":"Finding the Shortest Path Between Two Points in a Simple Polygon by Applying a Rubberband Algorithm","year":"2006","key":"2019100601074443600_B12"},{"key":"2019100601074443600_B13"},{"key":"2019100601074443600_B14"},{"volume-title":"Effective Computational Geometry for Curves and Surfaces","year":"2006","key":"2019100601074443600_B15"}],"container-title":["Journal of Computing and Information Science in Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/asmedigitalcollection.asme.org\/computingengineering\/article-pdf\/doi\/10.1115\/1.4026183\/6099822\/jcise_014_02_021004.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"http:\/\/asmedigitalcollection.asme.org\/computingengineering\/article-pdf\/doi\/10.1115\/1.4026183\/6099822\/jcise_014_02_021004.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,6]],"date-time":"2019-10-06T01:07:56Z","timestamp":1570324076000},"score":1,"resource":{"primary":{"URL":"https:\/\/asmedigitalcollection.asme.org\/computingengineering\/article\/doi\/10.1115\/1.4026183\/371472\/Computation-of-the-Shortest-Path-in-a-Bounded"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2,26]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,6,1]]}},"URL":"https:\/\/doi.org\/10.1115\/1.4026183","relation":{},"ISSN":["1530-9827","1944-7078"],"issn-type":[{"type":"print","value":"1530-9827"},{"type":"electronic","value":"1944-7078"}],"subject":[],"published":{"date-parts":[[2014,2,26]]},"article-number":"021004"}}