Edge guards for polyhedra in three-space

DOI10.1016/j.comgeo.2022.101859OpenAlexW4207041202MaRDI QIDQ2123291

Csaba D. Tóth, Javier Cano, Jorge Urrutia, Giovanni Viglietta

Publication date: 8 April 2022

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2022.101859

zbMATH Keywords

polyhedronart gallery problemedge cover\(1\)-skeletonedge guard

Mathematics Subject Classification ID

Three-dimensional polytopes (52B10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

Minimizing visible edges in polyhedra ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A short proof of the Berge-Tutte formula and the Gallai-Edmonds structure theorem
• Edge guarding polyhedral terrains
• Galleries need fewer mobile guards: A variation on Chvatal's theorem
• Matching theory
• Lower bounds on the cardinality of the maximum matchings of planar graphs
• A combinatorial theorem in plane geometry
• Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces
• Tight bounds on maximal and maximum matchings
• Optimally guarding 2-reflex orthogonal polyhedra by reflex edge guards
• Computing large matchings fast
• Traditional Galleries Require Fewer Watchmen
• Differential Topology
• Convex Polytopes

This page was built for publication: Edge guards for polyhedra in three-space