A combinational approach to polygon similarity

Authors:
D. Avis;H. Elgindy
Affiliations:
-;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 3

Guarding curvilinear art galleries with vertex or point guards

Computational Geometry: Theory and Applications
Guarding curvilinear art galleries with edge or mobile guards via 2-dominance of triangulation graphs

Computational Geometry: Theory and Applications
Unsolved problems in visibility graphs of points, segments, and polygons

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	754.84

Visualization

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.