Recognizing polygons, or how to spy

DOI10.1007/BF01901192zbMATH Open0646.68055DBLPjournals/vc/DeanLS88OpenAlexW2028695830WikidataQ62037527 ScholiaQ62037527MaRDI QIDQ1104085FDOQ1104085

Authors: 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

Recommendations

• Recognizing weakly convex visible polygons
• Recognizing weakly simple polygons
• Recognizing weakly simple polygons
• Visual distinguishability of polygons
• Polygon Graph Recognition
• On recognizing shapes of polytopes from their shadows
• Polygon recognition and symmetry detection
• Visibility concepts in orthogonal polygon recognition
• Recognizing visibility graphs of spiral polygons
• Detecting weakly simple polygons

zbMATH Keywords

complexitycomputational geometryvisibilitygeometric algorithmspolygon recognitionpseudo-star-shaped polygons

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• An Optimal Algorithm for Finding the Kernel of a Polygon
• A linear algorithm for computing the visibility polygon from a point
• Visibility of a simple polygon
• Title not available (Why is that?)
• Decomposing a Polygon into Simpler Components

Cited In (10)

• A time-space trade-off for computing the \(k\)-visibility region of a point in a polygon
• Recognizing weakly simple polygons
• Computational geometry algorithms for the systolic screen
• Computing the \(k\)-visibility region of a point in a polygon
• Rotationally monotone polygons
• Line-star-shapedness -- a further generalization of star-shapedness
• Line-of-sight pursuit in monotone and scallop polygons
• On recognizing unions of two convex polygons and related problems
• 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

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

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