A combinatorial theorem in plane geometry
From MaRDI portal
Publication:1394353
DOI10.1016/0095-8956(75)90061-1zbMath0278.05028OpenAlexW2087422927WikidataQ56504463 ScholiaQ56504463MaRDI QIDQ1394353
Publication date: 1975
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(75)90061-1
Related Items (only showing first 100 items - show all)
Guarding disjoint triangles and claws in the plane ⋮ 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 ⋮ An optimal algorithm to solve the minimum weakly cooperative guards problem for 1-spiral polygons ⋮ On gallery watchmen in grids ⋮ On boundaries of highly visible spaces and applications ⋮ Tight bounds for the number of edge guards for spiral polygons ⋮ The prison yard problem ⋮ Protecting convex sets ⋮ Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday) ⋮ A unified solving approach for two and three dimensional coverage problems in sensor networks ⋮ Approximate guarding of monotone and rectilinear polygons ⋮ Reconfiguring closed polygonal chains in Euclidean \(d\)-space ⋮ Multi-agent deployment for visibility coverage in polygonal environments with holes ⋮ Visibility between two edges of a simple polygon ⋮ Universal Guard Problems ⋮ Line segment visibility with sidedness constraints ⋮ Guarding polyominoes, polycubes and polyhypercubes ⋮ Hiding points in arrangements of segments ⋮ Vertex-to-point conflict-free chromatic guarding is NP-hard ⋮ Polygon guarding with orientation ⋮ A tight bound for point guards in piecewise convex art galleries ⋮ Algorithms for art gallery illumination ⋮ Parallel computational geometry ⋮ Art gallery problem with rook and queen vision ⋮ Guarding orthogonal art galleries with sliding cameras ⋮ On orthogonally guarding orthogonal polygons with bounded treewidth ⋮ Optimally guarding 2-reflex orthogonal polyhedra by reflex edge guards ⋮ Hiding people in polygons ⋮ Cooperative mobile guards in grids ⋮ Tight bounds for illuminating and covering of orthotrees with vertex lights and vertex beacons ⋮ Total dominating sets in maximal outerplanar graphs ⋮ Converting triangulations to quadrangulations ⋮ Computational Complexity of the $$r$$-visibility Guard Set Problem for Polyominoes ⋮ Polychromatic 4-coloring of cubic even embeddings on the projective plane ⋮ Note on an art gallery problem ⋮ Polychromatic 4-coloring of cubic bipartite plane graphs ⋮ Partial domination of maximal outerplanar graphs ⋮ Total domination in maximal outerplanar graphs. II. ⋮ Guarding a set of line segments in the plane ⋮ Coverage with \(k\)-transmitters in the presence of obstacles ⋮ Combinatorics and complexity of guarding polygons with edge and point 2-transmitters ⋮ Modem illumination of monotone polygons ⋮ Radar placement along banks of river ⋮ Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces ⋮ Art gallery theorems for guarded guards. ⋮ Extensions of the Art Gallery Theorem ⋮ Finding minimum witness sets in orthogonal polygons ⋮ Conflict-free chromatic art gallery coverage ⋮ On Guarding Orthogonal Polygons with Sliding Cameras ⋮ The art gallery theorem for simple polygons in terms of the number of reflex and convex vertices ⋮ Watchman routes for lines and line segments ⋮ Simple agents learn to find their way: an introduction on mapping polygons ⋮ Diffuse reflection diameter and radius for convex-quadrilateralizable polygons ⋮ Multiple point visibility and related problems ⋮ Guarding curvilinear art galleries with vertex or point guards ⋮ Distance \(k\)-domination, distance \(k\)-guarding, and distance \(k\)-vertex cover of maximal outerplanar graphs ⋮ Improved bounds for guarding plane graphs with edges ⋮ Guarding polyhedral terrains ⋮ Edge guarding polyhedral terrains ⋮ The orthogonal art gallery theorem with constrained guards ⋮ Perfect graphs and guarding rectilinear art galleries ⋮ On guarding the vertices of rectilinear domains ⋮ Guarding orthogonal art galleries with sliding \(k\)-transmitters: hardness and approximation ⋮ Covering a line segment with variable radius discs ⋮ Determination of minimum number of sensors and their locations for an automated facility: An algorithmic approach ⋮ Approximation algorithms for art gallery problems in polygons ⋮ Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree ⋮ Improved bounds for wireless localization ⋮ A new 2D tessellation for angle problems: the polar diagram ⋮ Guarding curvilinear art galleries with edge or mobile guards via 2-dominance of triangulation graphs ⋮ Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree ⋮ Orthogonal art galleries with interior walls ⋮ Polychromatic 4-coloring of guillotine subdivisions ⋮ An ``Art Gallery Theorem for pyramids ⋮ LOCATING GUARDS FOR VISIBILITY COVERAGE OF POLYGONS ⋮ A short proof of Chvatal's Watchman Theorem ⋮ The fortress problem in terms of the number of reflex and convex vertices. A 3D objects scanning application ⋮ A Zen master, a Zen monk, a Zen mathematician ⋮ New bounds on guarding problems for orthogonal polygons in the plane using vertex guards with halfplane vision ⋮ Facets for art gallery problems ⋮ Exploring and Triangulating a Region by a Swarm of Robots ⋮ Optimal art gallery localization is NP-hard ⋮ Twenty years of progress of \(\mathrm{JCDCG}^3\) ⋮ Multiple-guard kernels of simple polygons ⋮ Convex dominating sets in maximal outerplanar graphs ⋮ Polygon exploration with time-discrete vision ⋮ Finding the \(\Theta \)-guarded region ⋮ Isolation number of maximal outerplanar graphs ⋮ Tight bounds for beacon-based coverage in simple rectilinear polygons ⋮ Semipaired domination in maximal outerplanar graphs ⋮ An alternative proof of the rectilinear art gallery theorem ⋮ An \(O(\lg \lg {\mathrm {OPT}})\)-approximation algorithm for multi-guarding galleries ⋮ Art gallery problem with guards whose range of vision is \(180^{\circ}\) ⋮ On the number of guard edges of a polygon ⋮ Efficient visibility queries in simple polygons ⋮ On partitioning rectilinear polygons into star-shaped polygons ⋮ Triangles and (total) domination in subcubic graphs ⋮ Approximability of guarding weak visibility polygons
This page was built for publication: A combinatorial theorem in plane geometry
