Recognizing polygons, or how to spy
From MaRDI portal
Publication:1104085
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
Cites work
- scientific article; zbMATH DE number 3919830 (Why is no real title available?)
- scientific article; zbMATH DE number 3453104 (Why is no real title available?)
- A linear algorithm for computing the visibility polygon from a point
- An Optimal Algorithm for Finding the Kernel of a Polygon
- Decomposing a Polygon into Simpler Components
- Visibility of a simple polygon
Cited in
(10)- On recognizing unions of two convex polygons and related problems
- Recognizing weakly simple polygons
- Time-space trade-off for finding the \(k\)-visibility region of a point in a polygon
- Line-star-shapedness -- a further generalization of star-shapedness
- Rotationally monotone polygons
- Computing the \(k\)-visibility region of a point in a polygon
- A time-space trade-off for computing the \(k\)-visibility region of a point in a polygon
- Combinatorics and complexity of guarding polygons with edge and point 2-transmitters
- Computational geometry algorithms for the systolic screen
- Line-of-sight pursuit in monotone and scallop polygons
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)
