Efficient polygon decomposition into singular and regular regions via Voronoi diagrams

Abstract.A new polygon decomposition into regular and singular regions is defined; it is a concept that is useful for skeleton extraction and part analysis of elongated shapes. Polygon regions that are narrow according to the Voronoi diagram of the polygon are extended through the boundary that is adjacent and quasiparallel. Regular regions are the narrow ones surrounded by smooth quasiparallel contour segments, while singular regions are the polygon regions that are not regular. We present an efficient algorithm to calculate the decomposition and make a comparative study with previous algorithms.

[1]  Olaf Kübler,et al.  Hierarchic Voronoi skeletons , 1995, Pattern Recognit..

[2]  V. K. Govindan,et al.  A pattern adaptive thinning algorithm , 1987, Pattern Recognit..

[3]  Angelo Chianese,et al.  Recovering dynamic information from static handwriting , 1993, Pattern Recognit..

[4]  D. T. Lee,et al.  Generalization of Voronoi Diagrams in the Plane , 1981, SIAM J. Comput..

[5]  Laura Hoch.  Computer Analysis of Images and Patterns , 1993, Lecture Notes in Computer Science.

[6]  Xiaobo Li,et al.  Variable-resolution character thinning , 1991, Pattern Recognit. Lett..

[7]  Martin Held,et al.  VRONI: An engineering approach to the reliable and efficient computation of Voronoi diagrams of points and line segments , 2001, Comput. Geom..

[8]  Toshihiro Suzuki,et al.  Structural Description of Line Images by the Cross Section Sequence Graph , 1993, Int. J. Pattern Recognit. Artif. Intell..

[9]  Angelo Marcelli,et al.  Line Representation of Elongated Shapes , 1995, CAIP.

[10]  Kurt Mehlhorn,et al.  How to Compute the Voronoi Diagram of Line Segments: Theoretical and Experimental Results , 1994, ESA.

[11]  T. Pavlidis.  Algorithms for Graphics and Image Processing , 1981, Springer Berlin Heidelberg.

[12]  Joseph S. B. Mitchell,et al.  An Efficient Algorithm for Euclidean Shortest Paths Among Polygonal Obstacles in the Plane , 1997, Discret. Comput. Geom..

[13]  Theo Pavlidis,et al.  Algorithms for Graphics and Imag , 1983 .

[14]  Joseph O'Rourke,et al.  Worst-case optimal algorithms for constructing visibility polygons with holes , 1986, SCG '86.

[15]  David G. Lowe,et al.  Perceptual Organization and Visual Recognition , 2012 .

[16]  Jairo Rocha,et al.  Singularities and Regularities on Line Pictures via Symmetrical Trapezoids , 1998, IEEE Trans. Pattern Anal. Mach. Intell..

[17]  Theodosios Pavlidis,et al.  Feature Analysis Using Line Sweep Thinning Algorithm , 1999, IEEE Trans. Pattern Anal. Mach. Intell..

[18]  Hong Yan,et al.  Skeletonization of ribbon-like shapes based on regularity and singularity analyses , 2001, IEEE Trans. Syst. Man Cybern. Part B.

[19]  George R. Cross,et al.  On representation of a shape's skeleton , 1991, Pattern Recognit. Lett..

[20]  Donald D. Hoffman,et al.  Parts of recognition , 1984, Cognition.

[21]  He Xu,et al.  False stroke detection and elimination for character recognition , 1992, Pattern Recognit. Lett..