A combinational approach to polygon similarity

1 January 1983

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory

Vol. 29 (1) , 148-150
https://doi.org/10.1109/tit.1983.1056600

Abstract

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.

Keywords

This publication has 11 references indexed in Scilit:

A linear algorithm for computing the visibility polygon from a point
Journal of Algorithms, 1981
Approximate String Matching
ACM Computing Surveys, 1980
On polygon similarity
Information Processing Letters, 1979
Decomposition of Two-Dimensional Shapes by Graph-Theoretic Clustering
Published by Institute of Electrical and Electronics Engineers (IEEE) ,1979
Decomposition of Polygons into Convex Sets
IEEE Transactions on Computers, 1978
An improved algorithm to check for polygon similarity
Information Processing Letters, 1978
Fast Pattern Matching in Strings
SIAM Journal on Computing, 1977
Structural Pattern Recognition
Published by Springer Nature ,1977
An application of pattern matching to a problem in geometrical complexity
Information Processing Letters, 1976
GRAPH THEORY
Published by Defense Technical Information Center (DTIC) ,1969