Recognizing polygons, or how to spy

DOI10.1007/BF01901192zbMath0646.68055OpenAlexW2028695830WikidataQ62037527 ScholiaQ62037527MaRDI QIDQ1104085

James A. Dean, Andrzej Lingas, Jörg-Rüdiger Sack

Publication date: 1988

Published in: The Visual Computer (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01901192

zbMATH Keywords

complexitygeometric algorithmsvisibilitycomputational geometrypolygon recognitionpseudo-star-shaped polygons

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computing methodologies and applications (68U99) Variants of convex sets (star-shaped, ((m, n))-convex, etc.) (52A30)

Related Items (7)

Combinatorics and complexity of guarding polygons with edge and point 2-transmitters ⋮ Time-Space Trade-Off for Finding the k-Visibility Region of a Point in a Polygon ⋮ Computational geometry algorithms for the systolic screen ⋮ Line-of-Sight Pursuit in Monotone and Scallop Polygons ⋮ A time-space trade-off for computing the \(k\)-visibility region of a point in a polygon ⋮ Computing the \(k\)-visibility region of a point in a polygon ⋮ Rotationally monotone polygons

Cites Work

• Visibility of a simple polygon
• Decomposing a Polygon into Simpler Components
• A linear algorithm for computing the visibility polygon from a point
• An Optimal Algorithm for Finding the Kernel of a Polygon
• Unnamed Item
• Unnamed Item

This page was built for publication: Recognizing polygons, or how to spy