Publication:4945523

Publication date: 23 March 2000

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

Related Items

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, Approximating maximum edge 2-coloring in simple graphs, Guarding a set of line segments in the plane, A nearly optimal algorithm for covering the interior of an art gallery, The embracing Voronoi diagram and closest embracing number, Guarding galleries and terrains, Cooperative mobile guards in grids, Guarding curvilinear art galleries with vertex or point guards, An improved approximation algorithm for maximum edge 2-coloring in simple graphs, A nearly optimal sensor placement algorithm for boundary coverage, Approximation algorithms for art gallery problems in polygons, Improved bounds for wireless localization, An ``Art Gallery Theorem for pyramids, 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, 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., An O\((n\log n)\) algorithm for the zoo-keeper's problem, Guarding disjoint triangles and claws in the plane, 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, 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, Graphs with Large Obstacle Numbers, New Results on Visibility in Simple Polygons, 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