论文信息 - A combinational approach to polygon similarity

A combinational approach to polygon similarity

A new approach is presented to the classification problem of planar shapes represented by polygons. A shape is abstracted combinatorially by means of its visibility graph, and two shapes are deemed similar whenever their graphs are cyclically isomorphic. Efficient algorithms are presented for performing these operations.

David Avis | Hossam A. ElGindy | D. Avis | H. ElGindy

[1] Glenn K. Manacher,et al. An Application of Pattern Matching to a Problem in Geometrical Complexity , 1976, Inf. Process. Lett..

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

[3] Robert S. Boyer,et al. A fast string searching algorithm , 1977, CACM.

[4] Donald E. Knuth,et al. Fast Pattern Matching in Strings , 1977, SIAM J. Comput..

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

[6] Selim G. Akl,et al. An Improved Algorithm to Check for Polygon Similarity , 1978, Inf. Process. Lett..

[7] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8] Martin E. Hellman,et al. Hiding information and signatures in trapdoor knapsacks , 1978, IEEE Trans. Inf. Theory.

[9] Robert M. Haralick,et al. Decomposition of Two-Dimensional Shapes by Graph-Theoretic Clustering , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[10] Alex Bykat,et al. On Polygon Similarity , 1979, Inf. Process. Lett..

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

[12] Patrick A. V. Hall,et al. Approximate String Matching , 1994, Encyclopedia of Algorithms.

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