Pages that link to "Item:Q5370627"
From MaRDI portal
The following pages link to Efficient computation of query point visibility in polygons with holes (Q5370627):
Displaying 6 items.
- Visibility queries in a polygonal region (Q833709) (← links)
- Randomized approximation algorithms for planar visibility counting problem (Q1685962) (← links)
- Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane (Q2084662) (← links)
- Visibility testing and counting (Q2346552) (← links)
- Dynamic Algorithms for Visibility Polygons in Simple Polygons (Q5149571) (← links)
- Space–Query-Time Tradeoff for Computing the Visibility Polygon (Q5321702) (← links)