A method for detecting structure in polygons

Abstract In order to efficiently represent any data in a computer, it is desirable to have available information about any inherent structure in the data. When the data is visual, the structural information may also be useful in analyzing a scene or object. Here an inductive methodology for finding structure is presented and applied to the problem of shape analysis for polygons. The ‘polygon structure graph’ is introduced as a tool for shape analysis. Based on angles and lengths of sides, it not only aids in finding repeated substructures, but makes it easy to match parts of the polygon with parts of others. An algorithm for computing the polygon structure graph is given and examples are presented.

[1]  Peter Weiner,et al.  Linear Pattern Matching Algorithms , 1973, SWAT.

[2]  Edward M. McCreight,et al.  A Space-Economical Suffix Tree Construction Algorithm , 1976, JACM.

[3]  Herbert Freeman,et al.  On the Encoding of Arbitrary Geometric Configurations , 1961, IRE Trans. Electron. Comput..

[4]  Linda G. Shapiro,et al.  A Structural Model of Shape , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  Richard C. T. Lee,et al.  Storage Reduction Through Minimal Spanning Trees and Spanning Forests , 1977, IEEE Transactions on Computers.

[6]  Larry S. Davis,et al.  Understanding Shape: Angles and Sides , 1977, IEEE Transactions on Computers.

[7]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[8]  Ryszard S. Michalski,et al.  Pattern Recognition as Rule-Guided Inductive Inference , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[9]  Theodosios Pavlidis,et al.  Structural pattern recognition , 1977 .

[10]  Theodosios Pavlidis,et al.  A review of algorithms for shape analysis , 1978 .

[11]  A. Gill.  SWITCHING AND AUTOMATA THEORY. , 1970 .