A combinational approach to polygon similarity
David Avis, Hossam A. ElGindy · IEEE Transactions on Information Theory · 1983
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.