A combinatorial theorem in plane geometry
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Improved Bounds for Wireless Localization
- Tight bounds for illuminating and covering of orthotrees with vertex lights and vertex beacons
- A Zen master, a Zen monk, a Zen mathematician
- Guarding Exterior Region of a Simple Polygon
- Locating guards for visibility coverage of polygons
- Tight bounds for the number of edge guards for spiral polygons
- The prison yard problem
- Guarding polyhedral terrains
- On the general position numbers of maximal outerplane graphs
- The dispersive art gallery problem
- Tight bounds for beacon-based coverage in simple rectilinear polygons
- Parameterized Analysis of Art Gallery and Terrain Guarding
- Distance \(k\)-domination, distance \(k\)-guarding, and distance \(k\)-vertex cover of maximal outerplanar graphs
- Traditional Galleries Require Fewer Watchmen
- GRAPH ORIENTATION ALGORITHMS TO MINIMIZE THE MAXIMUM OUTDEGREE
- Hiding points in arrangements of segments
- Diffuse reflection diameter and radius for convex-quadrilateralizable polygons
- Multiple-guard kernels of simple polygons
- On partitioning rectilinear polygons into star-shaped polygons
- Ortho-unit polygons can be guarded with at most \(\left\lfloor \frac{n-4}{8} \right\rfloor\) guards
- Determination of minimum number of sensors and their locations for an automated facility: An algorithmic approach
- Optimal art gallery localization is NP-hard
- The orthogonal art gallery theorem with constrained guards
- Combinatorics and complexity of guarding polygons with edge and point 2-transmitters
- Minimizing visible edges in polyhedra
- Convex dominating sets in maximal outerplanar graphs
- Coverage with \(k\)-transmitters in the presence of obstacles
- Total dominating sets in maximal outerplanar graphs
- Triangles and (total) domination in subcubic graphs
- Perfect graphs and guarding rectilinear art galleries
- Polychromatic 4-coloring of cubic even embeddings on the projective plane
- Total domination in maximal outerplanar graphs. II.
- Finding minimum witness sets in orthogonal polygons
- Multiple point visibility and related problems
- Open guard edges and edge guards in simple polygons
- Edge guarding polyhedral terrains
- An exact algorithm for minimizing vertex guards on art galleries
- Art gallery problem with guards whose range of vision is \(180^{\circ}\)
- On guarding orthogonal polygons with sliding cameras
- Efficient visibility queries in simple polygons
- Guarding disjoint triangles and claws in the plane
- Parallel computational geometry
- Hiding people in polygons
- Improved bounds for wireless localization
- Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree
- GUARDING ART GALLERIES BY GUARDING WITNESSES
- Tight bounds for conflict-free chromatic guarding of orthogonal art galleries
- Guarding Art Galleries: The Extra Cost for Sculptures Is Linear
- Improved bounds for guarding plane graphs with edges
- The art gallery theorem, revisited
- Multi-agent deployment for visibility coverage in polygonal environments with holes
- An alternative proof of the rectilinear art gallery theorem
- An addition to art galleries with interior walls
- Quadrangulations of planar sets
- Art galleries with guards of uniform range of vision
- Approximation algorithms for art gallery problems in polygons
- Radar placement along banks of river
- Edge guards for polyhedra in three-space
- Guarding curvilinear art galleries with vertex or point guards
- On gallery watchmen in grids
- Polychromatic 4-coloring of guillotine subdivisions
- Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree
- Approximability of guarding weak visibility polygons
- Optimally guarding 2-reflex orthogonal polyhedra by reflex edge guards
- Two-floodlight illumination of convex polygons
- Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday)
- A short proof of Chvatal's Watchman Theorem
- Guarding a set of line segments in the plane
- POLYHEDRA WITH UNGUARDED INTERIORS
- An ``Art Gallery Theorem for pyramids
- Isolation of regular graphs and \(k\)-chromatic graphs
- Guarding orthogonal art galleries with sliding k-transmitters: hardness and approximation
- Guarding curvilinear art galleries with edge or mobile guards via 2-dominance of triangulation graphs
- A unified solving approach for two and three dimensional coverage problems in sensor networks
- Art gallery problem with rook and queen vision
- Computational complexity of the \(r\)-visibility guard set problem for polyominoes
- Art gallery theorems for guarded guards.
- On \(r\)-guarding SCOTs -- a new family of orthogonal polygons
- Vertex guarding for dynamic orthogonal art galleries
- Protecting convex sets
- Cooperative mobile guards in grids
- Simple agents learn to find their way: an introduction on mapping polygons
- Conflict-free chromatic art gallery coverage
- Twenty years of progress of \(\mathrm{JCDCG}^3\)
- Line segment visibility with sidedness constraints
- Covering a line segment with variable radius discs
- Isolation of squares in graphs
- On Some City Guarding Problems
- Semipaired domination in maximal outerplanar graphs
- Reconfiguring closed polygonal chains in Euclidean \(d\)-space
- Towards optimal positioning of surveillance UGVs
- On boundaries of highly visible spaces and applications
- How to Keep an Eye on Small Things
- Universal guard problems
- Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces
- An \(O(\lg \lg {\mathrm {OPT}})\)-approximation algorithm for multi-guarding galleries
- A simple proof of the rectilinear art gallery theorem
- Guarding monotone art galleries with sliding cameras in linear time
- Exploring and triangulating a region by a swarm of robots
- Guard placement for maximizing L-visibility exterior to a convex polygon
This page was built for publication: A combinatorial theorem in plane geometry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1394353)
