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.
No takes yet. Share an insight, caveat, or question.
Avis et al. (1983) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: