Computing the Relative Neighbour Decomposition of a Simple Polygon

In computational geometry one may be interested in decomposing a polygon into simpler components, monotone polygons for example, in order to solve the geometric problem at hand more efficiently. However, in pattern recognition , where the motivation is morphological , one is interested in decomposing a polygon into perceptually meaningful parts. Therefore we can relax the strict requirement that the components be of a certain form such as convex or monotone and we can investigate decompositions which are procedure oriented rather than component oriented . In this paper we study the properties of a procedure oriented decomposition, termed the relative neighbour decomposition , and present different algorithms for performing such a decomposition.

[1]  D. Matula,et al.  Properties of Gabriel Graphs Relevant to Geographic Variation Research and the Clustering of Points in the Plane , 2010 .

[2]  Godfried T. Toussaint,et al.  PATTERN RECOGNITION AND GEOMETRICAL COMPLEXITY. , 1980 .

[3]  Theodosios Pavlidis,et al.  Decomposition of Polygons into Simpler Components: Feature Generation for Syntactic Pattern Recognition , 1975, IEEE Transactions on Computers.

[4]  Kenneth J. Supowit,et al.  The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees , 1983, JACM.

[5]  Bernard Chazelle,et al.  Decomposing a polygon into its convex parts , 1979, STOC.

[6]  Franco P. Preparata,et al.  Location of a Point in a Planar Subdivision and Its Applications , 1977, SIAM J. Comput..

[7]  S. Yokoi,et al.  Voronoi and Related Neighbors on Digitized two-Dimensional Space with Applications to Texture Analysis , 1988 .

[8]  D. T. Lee Relative neighborhood graphs in the Li-metric , 1985, Pattern Recognit..

[9]  Jerzy W. Jaromczyk,et al.  A note on relative neighborhood graphs , 1987, SCG '87.

[10]  Godfried T. Toussaint,et al.  An efficient algorithm for decomposing a polygon into star-shaped polygons , 1981, Pattern Recognit..

[11]  J. Sack,et al.  Minimum Decompositions of Polygonal Objects , 1985 .

[12]  D. T. Lee,et al.  Visibility of a simple polygon , 1983, Comput. Vis. Graph. Image Process..

[13]  R. Urquhart Algorithms for computation of relative neighbourhood graph , 1980 .

[14]  Godfried T. Toussaint,et al.  The relative neighbourhood graph of a finite planar set , 1980, Pattern Recognit..

[15]  Joseph O'Rourke Computing the relative neighborhood graph in the L1 and Linfinity metrics , 1982, Pattern Recognit..

[16]  Theodosios Pavlidis,et al.  Representation of figures by labeled graphs , 1972, Pattern Recognit..

[17]  Olli Nevalainen,et al.  Computing relative neighbourhood graphs in the plane , 1986, Pattern Recognit..

[18]  David Avis,et al.  A Linear Algorithm for Computing the Visibility Polygon from a Point , 1981, J. Algorithms.

[19]  Bruce J. Schachter,et al.  Decomposition of Polygons into Convex Sets , 1978, IEEE Transactions on Computers.