A combinational approach to polygon similarity
Authors:
- D. AvisDAD. Avis
- H. ElgindyHEH. Elgindy
- 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
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 pointJournal of Algorithms, 1981
- Approximate String MatchingACM Computing Surveys, 1980
- On polygon similarityInformation Processing Letters, 1979
- Decomposition of Two-Dimensional Shapes by Graph-Theoretic ClusteringIEEE Transactions on Pattern Analysis and Machine Intelligence, 1979
- Decomposition of Polygons into Convex SetsIEEE Transactions on Computers, 1978
- An improved algorithm to check for polygon similarityInformation Processing Letters, 1978
- Fast Pattern Matching in StringsSIAM Journal on Computing, 1977
- Structural Pattern Recognition1977
- An application of pattern matching to a problem in geometrical complexityInformation Processing Letters, 1976
- GRAPH THEORY1969