On the family of shortest isothetic paths in a digital object - An algorithm with applications

An algorithm to compute Family of Shortest Isothetic Paths (FSIP) is proposed.We make certain characterization of FSIP, which leads to the algorithm.Algorithm is discussed in detail with demonstration.We also show how FSIP can be used for shape analysis.Experimental results are given to demonstrate the effectiveness of FSIP. The family of shortest isothetic paths (FSIP) between two grid points in a digital object A is defined to be the collection of all possible shortest isothetic paths that connect them. We propose here a fast algorithm to compute the FSIP between two given grid points inside a digital object, which is devoid of any hole. The proposed algorithm works with the object boundary as input and does not resort to analysis of the interior pixels. Given the digital object A with n boundary pixels, it first constructs the inner isothetic cover that tightly inscribes A in O n g log n g time, where g is a positive integer that denotes the unit of the underlying square grid. Then for any two points on the inner cover, it computes the FSIP in O ( n / g ) time, using certain combinatorial rules based on the characteristic properties of FSIP. We report experimental results that show the effectiveness of the algorithm and its further prospects in shape analysis, object decomposition, and in other related applications.

[1]  Marie-Pierre Jolly,et al.  Tracking Deformable Templates Using a Shortest Path Algorithm , 2001, Comput. Vis. Image Underst..

[2]  Partha Bhowmick,et al.  TIPS: On Finding a Tight Isothetic Polygonal Shape Covering a 2D Object , 2005, SCIA.

[3]  Alexander Zelinsky,et al.  Using Path Transforms to Guide the Search for Findpath in 2D , 1994, Int. J. Robotics Res..

[4]  Greg N. Frederickson,et al.  Fast Algorithms for Shortest Paths in Planar Graphs, with Applications , 1987, SIAM J. Comput..

[5]  Esther M. Arkin,et al.  Minimum-link watchman tours , 2003, Inf. Process. Lett..

[6]  Partha Bhowmick,et al.  Construction of isothetic covers of a digital object: A combinatorial approach , 2010, J. Vis. Commun. Image Represent..

[7]  Joachim Gudmundsson,et al.  A Fast Approximation Algorithm for TSP with Neighborhoods , 1999, Nord. J. Comput..

[8]  Mark de Berg,et al.  Finding Shortest Paths in the Presence of Orthogonal Obstacles Using a Combined L1 and Link Metric , 1990, SWAT.

[9]  Reinhard Klette,et al.  Finding the Shortest Path Between Two Points in a Simple Polygon by Applying a Rubberband Algorithm , 2006, PSIVT.

[10]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[11]  Joseph S. B. Mitchell,et al.  Approximation algorithms for TSP with neighborhoods in the plane , 2001, SODA '01.

[12]  Kenneth L. Clarkson,et al.  Rectilinear shortest paths through polygonal obstacles in O(n(logn)2) time , 1987, SCG '87.

[13]  Leonidas J. Guibas,et al.  Linear time algorithms for visibility and shortest path problems inside simple polygons , 2011, SCG '86.

[14]  Victor O. K. Li,et al.  Finding minimum rectilinear distance paths in the presence of barriers , 1981, Networks.

[15]  Tomio Hirata,et al.  Finding shortest safari routes in simple polygons , 2003, Inf. Process. Lett..

[16]  Mark de Berg,et al.  On Rectilinear Link Distance , 1991, Comput. Geom..

[17]  Philip N. Klein,et al.  Faster Shortest-Path Algorithms for Planar Graphs , 1997, J. Comput. Syst. Sci..

[18]  Simeon Ntafos,et al.  Watchman routes under limited visibility , 1992 .

[19]  Simeon C. Ntafos,et al.  The zookeeper route problem , 1992, Inf. Sci..

[20]  Tomás Lozano-Pérez,et al.  An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.

[21]  Azriel Rosenfeld,et al.  Digital geometry - geometric methods for digital picture analysis , 2004 .

[22]  Partha Bhowmick,et al.  A linear-time combinatorial algorithm to find the orthogonal hull of an object on the digital plane , 2012, Inf. Sci..

[23]  Partha Bhowmick,et al.  On Finding Shortest Isothetic Path inside a Digital Object , 2012, IWCIA.

[24]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[25]  Xuehou Tan,et al.  Approximation algorithms for the watchman route and zookeeper's problems , 2001, Discret. Appl. Math..

[26]  Subir Kumar Ghosh,et al.  Visibility Algorithms in the Plane , 2007 .

[27]  Micha Sharir,et al.  On Shortest Paths in Polyhedral Spaces , 1986, SIAM J. Comput..

[28]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.

[29]  Yun Xia,et al.  Skeletonization via the Realization of the Fire Front's Propagation and Extinction in Digital Binary Shapes , 1989, IEEE Trans. Pattern Anal. Mach. Intell..