An Algorithm for Determining Visibility of a Simple Polygon from an Internal Line Segment
From MaRDI portal
Publication:4033762
Recommendations
- An optimal algorithm for detecting weak visibility of a polygon
- scientific article; zbMATH DE number 4050998
- scientific article; zbMATH DE number 177566
- Dynamic algorithms for visibility polygons in simple polygons
- Optimally computing a shortest weakly visible line segment inside a simple polygon
- An improved algorithm for reconstructing a simple polygon from its visibility angles
- An optimal visibility graph algorithm for triangulated simple polygons
- An optimal parallel algorithm for the visibility of a simple polygon from a point
- COMPUTING A SHORTEST WEAKLY EXTERNALLY VISIBLE LINE SEGMENT FOR A SIMPLE POLYGON
- An improved algorithm for reconstructing a simple polygon from the visibility angles
Cited in
(11)- Computing in linear time a chord from which a simple polygon is weakly internally visible
- Finding all weakly-visible chords of a polygon in linear time
- COMPUTING A SHORTEST WEAKLY EXTERNALLY VISIBLE LINE SEGMENT FOR A SIMPLE POLYGON
- Line segment visibility with sidedness constraints
- scientific article; zbMATH DE number 177566 (Why is no real title available?)
- Optimally computing a shortest weakly visible line segment inside a simple polygon
- An O(n log n) ALGORITHM FOR FINDING A SHORTEST CENTRAL LINK SEGMENT
- Characterizing LR-visibility polygons and related problems
- Guarding in a simple polygon
- Finding the shortest boundary guard of a simple polygon
- LR-visibility in polygons
This page was built for publication: An Algorithm for Determining Visibility of a Simple Polygon from an Internal Line Segment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4033762)
