scientific article; zbMATH DE number 1424310
From MaRDI portal
Publication:4945523
Recommendations
Cited in
(only showing first 100 items - show all)- Model-based view planning
- Approximating maximum edge 2-coloring in simple graphs via local improvement
- Finding the \(\Theta \)-guarded region
- Illuminating a convex polygon with vertex lights
- Edge guards in rectilinear polygons
- On galleries with no bad points
- Note on an art gallery problem
- Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces
- Art gallery theorems for guarded guards.
- Spanning trees crossing few barriers
- Illuminating labyrinths.
- Illuminating disjoint line segments in the plane
- Art gallery problem with guards whose range of vision is \(180^{\circ}\)
- Approximation algorithms for terrain guarding.
- Tight bounds for conflict-free chromatic guarding of orthogonal art galleries
- Modem illumination of monotone polygons
- Minimizing the solid angle sum of orthogonal polyhedra
- Guarding orthogonal art galleries with sliding k-transmitters: hardness and approximation
- A Zen master, a Zen monk, a Zen mathematician
- An O\((n\log n)\) algorithm for the zoo-keeper's problem
- Guarding disjoint triangles and claws in the plane
- Coverage with k-transmitters in the presence of obstacles
- Bamboo garden trimming problem: priority schedulings
- New bounds on guarding problems for orthogonal polygons in the plane using vertex guards with halfplane vision
- Generalised outerplanar Turán numbers and maximum number of \(k\)-vertex subtrees
- Optimal placement of base stations in border surveillance using limited capacity drones
- Edge guards for polyhedra in three-space
- Line segment visibility with sidedness constraints
- Optimally guarding 2-reflex orthogonal polyhedra by reflex edge guards
- Tight bounds for illuminating and covering of orthotrees with vertex lights and vertex beacons
- On optimal coverage of a tree with multiple robots
- Finding minimum witness sets in orthogonal polygons
- Clearing an orthogonal polygon to find the evaders
- Starshaped sets
- Face-guarding polyhedra
- Information-seeking control under visibility-based uncertainty
- Twenty years of progress of \(\mathrm{JCDCG}^3\)
- Covering orthogonal polygons with sliding \(k\)-transmitters
- Tight bounds for beacon-based coverage in simple rectilinear polygons
- Partially walking a polygon
- An \(O(\lg \lg {\mathrm {OPT}})\)-approximation algorithm for multi-guarding galleries
- Solving the natural wireless localization problem to optimality efficiently
- Reprint of: Face-guarding polyhedra
- Spindle starshaped sets
- The searchlight problem for road networks
- Guarding monotone art galleries with sliding cameras in linear time
- On boundaries of highly visible spaces and applications
- Note on covering monotone orthogonal polygons with star-shaped polygons
- A note on optimal floodlight illumination of stages
- Maximizing the guarded boundary of an Art Gallery is APX-complete
- A tight bound for point guards in piecewise convex art galleries
- Algorithms for art gallery illumination
- Guarding orthogonal art galleries with sliding cameras
- Compatible spanning trees
- Watchman routes for lines and line segments
- Diffuse reflection diameter and radius for convex-quadrilateralizable polygons
- Packing \([1, \Delta ]\)-factors in graphs of small degree
- On guarding the vertices of rectilinear domains
- Finding minimum hidden guard sets in polygons --- tight approximability results
- Orthogonal art galleries with interior walls
- Art gallery problem with rook and queen vision
- Bamboo garden trimming problem (perpetual maintenance of machines with different attendance urgency factors)
- Graphs with large obstacle numbers
- New Results on Visibility in Simple Polygons
- Guarding polyominoes, polycubes and polyhypercubes
- Traditional Galleries Require Fewer Watchmen
- scientific article; zbMATH DE number 4202280 (Why is no real title available?)
- Polygon guarding with orientation
- On Some City Guarding Problems
- Approximating Maximum Edge 2-Coloring in Simple Graphs Via Local Improvement
- Guarding Art Galleries: The Extra Cost for Sculptures Is Linear
- Improved Bounds for Wireless Localization
- Minimum Time Multi-UGV Surveillance
- Towards optimal positioning of surveillance UGVs
- scientific article; zbMATH DE number 4065813 (Why is no real title available?)
- A new upper bound for the VC-dimension of visibility regions
- Watchman tours for polygons with holes
- Approximation algorithms for a geometric set cover problem
- On k-convex polygons
- An art gallery theorem for line segments in the plane
- Algorithms for computing best coverage path in the presence of obstacles in a sensor field
- The art gallery theorem for simple polygons in terms of the number of reflex and convex vertices
- The art gallery theorem, revisited
- Irrational guards are sometimes needed
- Obstacle numbers of planar graphs
- Online algorithms for searching and exploration in the plane
- How to Keep an Eye on Small Things
- Parameterized Analysis of Art Gallery and Terrain Guarding
- Vertex guarding for dynamic orthogonal art galleries
- Partially Walking a Polygon
- Guarding a Polygon Without Losing Touch
- Algorithm 966: A practical iterative algorithm for the art gallery problem using integer linear programming
- Optimal sensor positioning; a probability perspective study
- Cooperative guards in art galleries
- scientific article; zbMATH DE number 5058664 (Why is no real title available?)
- scientific article; zbMATH DE number 6729378 (Why is no real title available?)
- Inapproximability of finding maximum hidden sets on polygons and terrains
- Art galleries with guards of uniform range of vision
- Illumination in the presence of opaque line segments in the plane
- Guarding a terrain by two watchtowers
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4945523)
