A combinational approach to polygon similarity

DOI10.1109/TIT.1983.1056600zbMATH Open0498.68056MaRDI QIDQ3964035FDOQ3964035

Authors: David Avis, Hossam ElGindy 

Publication date: 1983

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

zbMATH Keywords

visibility graphclassification problem of planar shapes represented by polygons

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Graph theory (including graph drawing) in computer science (68R10)

Cited In (5)

• Guarding curvilinear art galleries with vertex or point guards
• Guarding curvilinear art galleries with edge or mobile guards via 2-dominance of triangulation graphs
• Visibility between two edges of a simple polygon
• A tight bound for point guards in piecewise convex art galleries
• Characterizing and recognizing weak visibility polygons

This page was built for publication: A combinational approach to polygon similarity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3964035)