Pages that link to "Item:Q1699283"
From MaRDI portal
The following pages link to Combinatorics and complexity of guarding polygons with edge and point 2-transmitters (Q1699283):
Displayed 4 items.
- Guarding orthogonal art galleries with sliding \(k\)-transmitters: hardness and approximation (Q1755780) (← links)
- Computing the \(k\)-visibility region of a point in a polygon (Q2032289) (← links)
- Guarding monotone art galleries with sliding cameras in linear time (Q2363353) (← links)
- \(k\)-Transmitter watchman routes (Q6091164) (← links)