Edge guards for polyhedra in three-space
From MaRDI portal
Publication:2123291
Recommendations
Cites work
- A combinatorial theorem in plane geometry
- A short proof of the Berge-Tutte formula and the Gallai-Edmonds structure theorem
- Computing large matchings fast
- Convex Polytopes
- Differential Topology
- Edge guarding polyhedral terrains
- Galleries need fewer mobile guards: A variation on Chvatal's theorem
- scientific article; zbMATH DE number 4065813 (Why is no real title available?)
- scientific article; zbMATH DE number 1182918 (Why is no real title available?)
- scientific article; zbMATH DE number 1424310 (Why is no real title available?)
- Lower bounds on the cardinality of the maximum matchings of planar graphs
- Matching theory
- Optimally guarding 2-reflex orthogonal polyhedra by reflex edge guards
- Tight bounds on maximal and maximum matchings
- Traditional Galleries Require Fewer Watchmen
- Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces
Cited in
(8)- Reprint of: Face-guarding polyhedra
- A note on the lower bound of edge guards of polyhedral terrains
- On The Lower Bound Of Edge Guards Of Polyhedral Terrains
- EDGE GUARDS IN STRAIGHT WALKABLE POLYGONS
- Minimizing visible edges in polyhedra
- A theory of spherical diagrams
- On the sum of the angles of orthogonal polyhedra, and guarding orthogonal polyhedra
- Nonrealizable planar and spherical occlusion diagrams
This page was built for publication: Edge guards for polyhedra in three-space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2123291)