The following pages link to Guarding polyhedral terrains (Q676572):
Displaying 26 items.
- Polygon guarding with orientation (Q340539) (← links)
- Distance domination, guarding and covering of maximal outerplanar graphs (Q479016) (← links)
- Edge guarding polyhedral terrains (Q676574) (← links)
- Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces (Q1410592) (← links)
- Three-dimensional weak visibility: Complexity and applications (Q1575678) (← links)
- Approximation algorithms for terrain guarding. (Q1603553) (← links)
- Improved bounds for guarding plane graphs with edges (Q1741583) (← links)
- Generating rooted triangulations without repetitions (Q1817003) (← links)
- Acrophobic guard watchtower problem (Q2096366) (← links)
- Parameter analysis for guarding terrains (Q2118384) (← links)
- Optimally guarding 2-reflex orthogonal polyhedra by reflex edge guards (Q2173452) (← links)
- Face-guarding polyhedra (Q2248737) (← links)
- Altitude terrain guarding and guarding uni-monotone polygons (Q2331221) (← links)
- A finite dominating set of cardinality \(O(k)\) and a witness set of cardinality \(O(n)\) for 1.5D terrain guarding problem (Q2400004) (← links)
- Facially-constrained colorings of plane graphs: a survey (Q2401805) (← links)
- On guarding the vertices of rectilinear domains (Q2477198) (← links)
- Universal Guard Problems (Q3177901) (← links)
- GUARDING A POLYGON FROM TWO NEARLY-OPPOSITE DIRECTIONS (Q3575388) (← links)
- A note on the lower bound of edge guards of polyhedral terrains (Q3630029) (← links)
- Improved bounds for guarding plane graphs with edges (Q5116478) (← links)
- Guarding a terrain by two watchtowers (Q5370631) (← links)
- (Q5417732) (← links)
- A note on polychromatic colorings of plane graphs (Q5866030) (← links)
- Polychromatic colorings of plane graphs (Q5896961) (← links)
- Inapproximability of finding maximum hidden sets on polygons and terrains (Q5959557) (← links)
- Guarding precise and imprecise polyhedral terrains with segments (Q6606244) (← links)
