Pages that link to "Item:Q3066439"
From MaRDI portal
The following pages link to Coverage with k-Transmitters in the Presence of Obstacles (Q3066439):
Displaying 6 items.
- On \(k\)-convex polygons (Q427049) (← links)
- Combinatorics and complexity of guarding polygons with edge and point 2-transmitters (Q1699283) (← links)
- Judgement theorems and an approach for solving the constellation-to-ground coverage problem (Q1721028) (← links)
- Watchman routes for lines and line segments (Q2445196) (← links)
- On a coverage process ranging from the Boolean model to the Poisson-Voronoi tessellation with applications to wireless communications (Q2749123) (← links)
- Time-Space Trade-Off for Finding the k-Visibility Region of a Point in a Polygon (Q2980918) (← links)