scientific article; zbMATH DE number 1424310
From MaRDI portal
Publication:4945523
zbMath0941.68138MaRDI QIDQ4945523
Publication date: 23 March 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (only showing first 100 items - show all)
Guarding disjoint triangles and claws in the plane ⋮ Searching for an evader in an unknown dark cave by an optimal number of asynchronous searchers ⋮ Tight bounds for conflict-free chromatic guarding of orthogonal art galleries ⋮ Edge guards for polyhedra in three-space ⋮ Guarding monotone art galleries with sliding cameras in linear time ⋮ Parameterized Analysis of Art Gallery and Terrain Guarding ⋮ On boundaries of highly visible spaces and applications ⋮ The embracing Voronoi diagram and closest embracing number ⋮ Guarding galleries and terrains ⋮ Line segment visibility with sidedness constraints ⋮ Note on covering monotone orthogonal polygons with star-shaped polygons ⋮ A note on optimal floodlight illumination of stages ⋮ Guarding polyominoes, polycubes and polyhypercubes ⋮ New Results on Visibility in Simple Polygons ⋮ Maximizing the guarded boundary of an Art Gallery is APX-complete ⋮ Polygon guarding with orientation ⋮ A tight bound for point guards in piecewise convex art galleries ⋮ Vertex Guarding for Dynamic Orthogonal Art Galleries ⋮ Guarding orthogonal art galleries with sliding cameras ⋮ Optimally guarding 2-reflex orthogonal polyhedra by reflex edge guards ⋮ Cooperative mobile guards in grids ⋮ Tight bounds for illuminating and covering of orthotrees with vertex lights and vertex beacons ⋮ Approximating maximum edge 2-coloring in simple graphs ⋮ A 3-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras ⋮ Note on an art gallery problem ⋮ A new upper bound for the VC-dimension of visibility regions ⋮ On optimal coverage of a tree with multiple robots ⋮ Watchman tours for polygons with holes ⋮ 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 ⋮ Guarding a set of line segments in the plane ⋮ Approximation algorithms for a geometric set cover problem ⋮ Coverage with \(k\)-transmitters in the presence of obstacles ⋮ Modem illumination of monotone polygons ⋮ On \(k\)-convex polygons ⋮ A nearly optimal algorithm for covering the interior of an art gallery ⋮ Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces ⋮ Art gallery theorems for guarded guards. ⋮ Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors) ⋮ Finding minimum witness sets in orthogonal polygons ⋮ Clearing an orthogonal polygon to find the evaders ⋮ Minimizing the solid angle sum of orthogonal polyhedra ⋮ Algorithms for computing best coverage path in the presence of obstacles in a sensor field ⋮ Spanning trees crossing few barriers ⋮ The art gallery theorem for simple polygons in terms of the number of reflex and convex vertices ⋮ Compatible spanning trees ⋮ Watchman routes for lines and line segments ⋮ Starshaped sets ⋮ Diffuse reflection diameter and radius for convex-quadrilateralizable polygons ⋮ Guarding curvilinear art galleries with vertex or point guards ⋮ Online algorithms for searching and exploration in the plane ⋮ Illuminating labyrinths. ⋮ Obstacle Numbers of Planar Graphs ⋮ On the structure of graphs with low obstacle number ⋮ Illuminating disjoint line segments in the plane ⋮ An improved approximation algorithm for maximum edge 2-coloring in simple graphs ⋮ Packing \([1, \Delta \)-factors in graphs of small degree] ⋮ A nearly optimal sensor placement algorithm for boundary coverage ⋮ Geometric hitting set for segments of few orientations ⋮ Face-guarding polyhedra ⋮ On guarding the vertices of rectilinear domains ⋮ Information-seeking control under visibility-based uncertainty ⋮ Guarding orthogonal art galleries with sliding \(k\)-transmitters: hardness and approximation ⋮ Bamboo garden trimming problem: priority schedulings ⋮ Approximation algorithms for art gallery problems in polygons ⋮ Improved bounds for wireless localization ⋮ Finding minimum hidden guard sets in polygons --- tight approximability results ⋮ Minimum Time Multi-UGV Surveillance ⋮ Towards Optimal Positioning of Surveillance UGVs ⋮ The art gallery theorem for polyominoes ⋮ Orthogonal art galleries with interior walls ⋮ An ``Art Gallery Theorem for pyramids ⋮ Graphs with Large Obstacle Numbers ⋮ Path optimization with limited sensing ability ⋮ A Zen master, a Zen monk, a Zen mathematician ⋮ Model-based view planning ⋮ New bounds on guarding problems for orthogonal polygons in the plane using vertex guards with halfplane vision ⋮ Facets for art gallery problems ⋮ Generalised outerplanar Turán numbers and maximum number of \(k\)-vertex subtrees ⋮ Twenty years of progress of \(\mathrm{JCDCG}^3\) ⋮ Partially Walking a Polygon ⋮ Edge guards in rectilinear polygons ⋮ Covering orthogonal polygons with sliding \(k\)-transmitters ⋮ Approximating maximum edge 2-coloring in simple graphs via local improvement ⋮ Finding the \(\Theta \)-guarded region ⋮ Optimal placement of base stations in border surveillance using limited capacity drones ⋮ Tight bounds for beacon-based coverage in simple rectilinear polygons ⋮ Illuminating a convex polygon with vertex lights ⋮ Partially walking a polygon ⋮ An \(O(\lg \lg {\mathrm {OPT}})\)-approximation algorithm for multi-guarding galleries ⋮ How to Keep an Eye on Small Things ⋮ Solving the natural wireless localization problem to optimality efficiently ⋮ Reprint of: Face-guarding polyhedra ⋮ Art gallery problem with guards whose range of vision is \(180^{\circ}\) ⋮ Approximation algorithms for terrain guarding. ⋮ Spindle starshaped sets ⋮ The searchlight problem for road networks ⋮ An O\((n\log n)\) algorithm for the zoo-keeper's problem
This page was built for publication:
