Pages that link to "Item:Q3028356"
From MaRDI portal
The following pages link to Computing the visibility polygon from an edge (Q3028356):
Displaying 15 items.
- Maintaining visibility of a polygon with a moving point of view (Q293260) (← links)
- Computing a visibility polygon using few variables (Q396475) (← links)
- Computing the visibility polygon of an island in a polygonal domain (Q513290) (← links)
- An optimal algorithm for finding the edge visibility polygon under limited visibility (Q673918) (← links)
- Simulation of pedestrian route choice with local view: a potential field approach (Q823338) (← links)
- Visibility between two edges of a simple polygon (Q1096432) (← links)
- Corrections to Lee's visibility polygon algorithm (Q1102120) (← links)
- Visibility with multiple diffuse reflections (Q1392849) (← links)
- Efficient visibility queries in simple polygons (Q1862134) (← links)
- Visibility extension via mirror-edges to cover invisible segments (Q2272374) (← links)
- Incremental Algorithms to Update Visibility Polygons (Q2971649) (← links)
- Determining Weak Visibility of a Polygon from an Edge in Parallel (Q4513212) (← links)
- Graphics in flatland revisited (Q5056094) (← links)
- Dynamic Algorithms for Visibility Polygons in Simple Polygons (Q5149571) (← links)
- Computing the visibility graph of points within a polygon (Q5361651) (← links)