Computing the visibility polygon from an edge
From MaRDI portal
Recommendations
- Computing the visibility polygon using few variables
- Computing the visibility graph of points within a polygon
- Computing a visibility polygon using few variables
- Computing the \(k\)-visibility region of a point in a polygon
- Determining Weak Visibility of a Polygon from an Edge in Parallel
- The vertex-edge visibility graph of a polygon
- Computing the visibility polygon from a convex set and related problems
- Visibility between two edges of a simple polygon
- scientific article; zbMATH DE number 3883623
- An optimal algorithm for finding the edge visibility polygon under limited visibility
Cited in
(19)- Visibility between two edges of a simple polygon
- Corrections to Lee's visibility polygon algorithm
- Visibility with multiple diffuse reflections
- Efficient visibility queries in simple polygons
- Visibility extension via mirror-edges to cover invisible segments
- Computing the visibility polygon of an island in a polygonal domain
- Maintaining visibility of a polygon with a moving point of view
- Incremental algorithms to update visibility polygons
- How to extend visibility polygons by mirrors to cover invisible segments
- Computing the visibility polygon using few variables
- Visibility of a simple polygon
- Computing a visibility polygon using few variables
- Determining Weak Visibility of a Polygon from an Edge in Parallel
- Graphics in flatland revisited
- Computing the visibility polygon of an island in a polygonal domain
- Dynamic algorithms for visibility polygons in simple polygons
- Computing the visibility graph of points within a polygon
- An optimal algorithm for finding the edge visibility polygon under limited visibility
- Simulation of pedestrian route choice with local view: a potential field approach
This page was built for publication: Computing the visibility polygon from an edge
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3028356)
