Pages that link to "Item:Q2261573"
From MaRDI portal
The following pages link to Visibility and ray shooting queries in polygonal domains (Q2261573):
Displaying 8 items.
- Computing the visibility polygon of an island in a polygonal domain (Q513290) (← links)
- Maximum-area and maximum-perimeter rectangles in polygons (Q827336) (← links)
- Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane (Q2084662) (← links)
- Routing among convex polygonal obstacles in the plane (Q2149846) (← links)
- Quickest visibility queries in polygonal domains (Q2316797) (← links)
- Incremental Algorithms to Update Visibility Polygons (Q2971649) (← links)
- Dynamic Algorithms for Visibility Polygons in Simple Polygons (Q5149571) (← links)
- How to cut corners and get bounded convex curvature (Q6045790) (← links)
