A combinatorial theorem in plane geometry
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Polygon exploration with time-discrete vision
- Finding the \(\Theta \)-guarded region
- On gallery watchmen in grids
- Visibility between two edges of a simple polygon
- Parallel computational geometry
- Hiding people in polygons
- Determination of minimum number of sensors and their locations for an automated facility: An algorithmic approach
- A short proof of Chvatal's Watchman Theorem
- On the number of guard edges of a polygon
- An optimal algorithm to solve the minimum weakly cooperative guards problem for 1-spiral polygons
- Tight bounds for the number of edge guards for spiral polygons
- The prison yard problem
- Protecting convex sets
- Reconfiguring closed polygonal chains in Euclidean \(d\)-space
- Hiding points in arrangements of segments
- Converting triangulations to quadrangulations
- Note on an art gallery problem
- Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces
- Art gallery theorems for guarded guards.
- Art gallery problem with guards whose range of vision is \(180^{\circ}\)
- Tight bounds for conflict-free chromatic guarding of orthogonal art galleries
- Combinatorics and complexity of guarding polygons with edge and point 2-transmitters
- Modem illumination of monotone polygons
- Improved bounds for guarding plane graphs with edges
- Guarding orthogonal art galleries with sliding k-transmitters: hardness and approximation
- 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
- Multiple-guard kernels of simple polygons
- Efficient visibility queries in simple polygons
- Guarding disjoint triangles and claws in the plane
- Coverage with k-transmitters in the presence of obstacles
- New bounds on guarding problems for orthogonal polygons in the plane using vertex guards with halfplane vision
- Triangles and (total) domination in subcubic graphs
- Edge guards for polyhedra in three-space
- Line segment visibility with sidedness constraints
- Vertex-to-point conflict-free chromatic guarding is NP-hard
- Optimally guarding 2-reflex orthogonal polyhedra by reflex edge guards
- Tight bounds for illuminating and covering of orthotrees with vertex lights and vertex beacons
- Partial domination of maximal outerplanar graphs
- Finding minimum witness sets in orthogonal polygons
- Perfect graphs and guarding rectilinear art galleries
- Optimal art gallery localization is NP-hard
- Twenty years of progress of \(\mathrm{JCDCG}^3\)
- Convex dominating sets in maximal outerplanar graphs
- Isolation number of maximal outerplanar graphs
- Tight bounds for beacon-based coverage in simple rectilinear polygons
- Semipaired domination in maximal outerplanar graphs
- An \(O(\lg \lg {\mathrm {OPT}})\)-approximation algorithm for multi-guarding galleries
- Approximability of guarding weak visibility polygons
- Guarding monotone art galleries with sliding cameras in linear time
- On boundaries of highly visible spaces and applications
- Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday)
- Approximate guarding of monotone and rectilinear polygons
- A tight bound for point guards in piecewise convex art galleries
- Algorithms for art gallery illumination
- Guarding orthogonal art galleries with sliding cameras
- Total dominating sets in maximal outerplanar graphs
- Conflict-free chromatic art gallery coverage
- 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
- On guarding the vertices of rectilinear domains
- A new 2D tessellation for angle problems: the polar diagram
- Orthogonal art galleries with interior walls
- A unified solving approach for two and three dimensional coverage problems in sensor networks
- Art gallery problem with rook and queen vision
- On orthogonally guarding orthogonal polygons with bounded treewidth
- Extensions of the Art Gallery Theorem
- Multiple point visibility and related problems
- Multi-agent deployment for visibility coverage in polygonal environments with holes
- Computational complexity of the r-visibility guard set problem for polyominoes
- On guarding orthogonal polygons with sliding cameras
- Locating guards for visibility coverage of polygons
- Exploring and triangulating a region by a swarm of robots
- Universal guard problems
- Guarding polyominoes, polycubes and polyhypercubes
- Traditional Galleries Require Fewer Watchmen
- Guard placement for maximizing L-visibility exterior to a convex polygon
- Polygon guarding with orientation
- GRAPH ORIENTATION ALGORITHMS TO MINIMIZE THE MAXIMUM OUTDEGREE
- On Some City Guarding Problems
- Guarding Art Galleries: The Extra Cost for Sculptures Is Linear
- Improved Bounds for Wireless Localization
- Towards optimal positioning of surveillance UGVs
- Polychromatic 4-coloring of cubic even embeddings on the projective plane
- Polychromatic 4-coloring of cubic bipartite plane graphs
- Radar placement along banks of river
- EDGE GUARDS IN STRAIGHT WALKABLE POLYGONS
- The art gallery theorem for simple polygons in terms of the number of reflex and convex vertices
- The art gallery theorem, revisited
- POLYHEDRA WITH UNGUARDED INTERIORS
- Open guard edges and edge guards in simple polygons
- An exact algorithm for minimizing vertex guards on art galleries
- Distance \(k\)-domination, distance \(k\)-guarding, and distance \(k\)-vertex cover of maximal outerplanar graphs
- How to Keep an Eye on Small Things
- Parameterized Analysis of Art Gallery and Terrain Guarding
- Two-floodlight illumination of convex polygons
- Quadrangulations of planar sets
- Vertex guarding for dynamic orthogonal art galleries
- Guarding a Polygon Without Losing Touch
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)
