Pages that link to "Item:Q2330037"
From MaRDI portal
The following pages link to Tight bounds for beacon-based coverage in simple rectilinear polygons (Q2330037):
Displaying 5 items.
- Tight bounds for illuminating and covering of orthotrees with vertex lights and vertex beacons (Q2175794) (← links)
- Gathering by repulsion (Q2206731) (← links)
- Tight Bounds for Beacon-Based Coverage in Simple Rectilinear Polygons (Q2802931) (← links)
- Triangulation and embedding using small sets of beacons (Q3452228) (← links)
- A sub-quadratic time algorithm for computing the beacon kernel of simple polygons (Q6591621) (← links)