The following pages link to Visibility of a simple polygon (Q3315016):
Displaying 6 items.
- Computing the visibility polygon of an island in a polygonal domain (Q513290) (← links)
- Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees (Q967420) (← links)
- Approximation algorithms for art gallery problems in polygons (Q968202) (← links)
- Corrections to Lee's visibility polygon algorithm (Q1102120) (← links)
- Recognizing polygons, or how to spy (Q1104085) (← links)
- An exact algorithm for minimizing vertex guards on art galleries (Q4910663) (← links)
