Pages that link to "Item:Q1862134"
From MaRDI portal
The following pages link to Efficient visibility queries in simple polygons (Q1862134):
Displayed 7 items.
- Modelling gateway placement in wireless networks: geometric \(k\)-centres of unit disc graphs (Q543790) (← links)
- Improved approximation for guarding simple galleries from the perimeter (Q635755) (← links)
- Visibility queries in a polygonal region (Q833709) (← links)
- Approximation algorithms for art gallery problems in polygons (Q968202) (← links)
- Query point visibility computation in polygons with holes (Q2462733) (← links)
- Visibility Testing and Counting (Q3004687) (← links)
- An exact algorithm for minimizing vertex guards on art galleries (Q4910663) (← links)