0
Research Papers

# Computation of the Shortest Path in a Bounded Domain With Free Form Boundary by Domain Partitioning

[+] Author and Article Information
ChiKit Au

Faculty of Engineering,
University of Waikato,
Private Bag 3105
Hamilton 3260, New Zealand
e-mail: ckau@waikato.ac.nz

Youngsheng Ma

Department of Mechanical Engineering,
University of Alberta,
e-mail: yongsheng.ma@ualberta.ca

1Corresponding author.

Contributed by the Computers and Information Division of ASME for publication in the JOURNAL OF Computing AND INFORMATION Science IN ENGINEERING. Manuscript received November 25, 2013; final manuscript received November 27, 2013; published online February 26, 2014. Editor: Bahram Ravani.

J. Comput. Inf. Sci. Eng 14(2), 021004 (Feb 26, 2014) (11 pages) Paper No: JCISE-13-1263; doi: 10.1115/1.4026183 History: Received November 25, 2013; Revised November 27, 2013

## Abstract

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.

<>

## References

Rohnert, H., 1986, “Shortest Paths in the Plane With Convex Polygonal Obstacles,” Inf. Process. Lett., 23(2), pp. 71–76.
Toussaint, G. T., 1986, “Shortest Path Solves Edge-to-Edge Visibility in a Polygon,” Pattern Recogn. Lett.4(3), pp. 165–170.
Ghosh, S. K., and Mount, D. M., 1987, “An Output Sensitive Algorithm for Computing Visibility Graphs,” Proceeding SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science, pp. 11–19.
Hershberger, J., and Suri, S., 1999, “An Optimal Algorithm for Euclidean Shortest Paths in the Plane,” SIAM J. Sci. Comput., 28(6), pp. 2215–2256.
Kapoor, S., Maheshwari, S. N., and Mitchell, J. S. B., 1997, “An Efficient Algorithm for Euclidean Shortest Paths Among Polygonal Obstacles in the Plane,” Discrete Comput. Geom., 18(4), pp. 377–383.
Ling, H., and Jacobs, D. W., 2007, “Shape Classification Using the Inner-Distance,” IEEE Trans. Pattern Anal. Mach. Intell., 29(2), pp. 289–299.
Lee, D. T., and Preparata, F. P., 1984, “Euclidean Shortest Paths in the Presence of Rectilinear Barriers,” Networks, 14(3), pp. 393–410.
Melissaratos, E. A., and Souvaine, D. L., 1992, “Shortest Paths Help Solve Geometric Optimization Problems in Planar Regions,” SIAM J. Sci. Comput., 21(4), pp. 601–638.
Bourgin, R. D., and HoweS. E., 1993, “Shortest Curves in Planar Regions With Curved Boundary,” Theor. Comput. Sci., 112(2), pp. 215–53.
Fabel, P., 1999, “Shortest Arcs in Closed Planar Disks Vary Continuously With the Boundary,” Topol. Appl., 95(9), pp. 75–83.
Ram, S. B., and Ramanathan, M., 2012, “The Shortest Path in a Simply-Connected Domain Having a Curved Boundary,” Comput.-Aided Des., 43(8), pp. 923–933.
Li, F., and Klette, R.2006, “Finding the Shortest Path Between Two Points in a Simple Polygon by Applying a Rubberband Algorithm,” The Pacific-Rim Symposium on Image and Video technology, pp. 280–291.
Boissonnat, J. D., and Teillaud, M., 2006, Effective Computational Geometry for Curves and Surfaces, Springer.

## Figures

Fig. 1

The shortest path between two points

Fig. 3

The shortest path between two points in a bounded domain with curved boundary

Fig. 4

The shortest paths from various points in a bounded domain to a point P

Fig. 5

Tangents computations

Fig. 6

The detail views of the curve sources

Fig. 7

Domain partitioning

Fig. 8

A tree structure to show the source relationships

Fig. 9

The shortest path generation

Fig. 10

The shortest path computation between two points in an bounded domain with palm shape

Fig. 11

The shortest path between point P and various positions of point Q

Fig. 12

The shortest path computation between two relocated points P and Q

Fig. 13

The regeneration of the shortest path due to the boundary variation

Fig. 14

The shortest path from point Q to point P

Fig. 15

The different domain partitioning with respect to two points

Fig. 16

Generation of the shortest path for an object with dimension

Fig. 17

Tangent computation in brute force approach

Fig. 18

The worst situation of the algorithm for partitioning a domain with 4 concave segments

Fig. 19

An example generated by the algorithm

## Errata

Some tools below are only available to our subscribers or users with an online account.

### Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related Proceedings Articles
Related eBook Content
Topic Collections