Minimizing visible edges in polyhedra

DOI10.1007/s00373-023-02707-yzbMath1527.52008arXiv2208.09702MaRDI QIDQ6083182

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

Publication date: 31 October 2023

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2208.09702

zbMATH Keywords

polyhedron; visibility graph; edge guard; spherical occlusion diagram

Mathematics Subject Classification ID

52B05: Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.)

52B10: Three-dimensional polytopes

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

52B70: Polyhedral manifolds

Related Items

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Triangulations. Structures for algorithms and applications
• On the complexity of umbra and penumbra
• On the difficulty of triangulating three-dimensional nonconvex polyhedra
• A combinatorial theorem in plane geometry
• Minimal simplicial dissections and triangulations of convex 3-polytopes
• An optimal algorithm for reporting visible rectangles
• Generalized hidden surface removal
• Edge guards for polyhedra in three-space
• Optimally guarding 2-reflex orthogonal polyhedra by reflex edge guards
• Face-guarding polyhedra
• Weak visibility counting in simple polygons
• Visibility maps of segments and triangles in 3D
• Traditional Galleries Require Fewer Watchmen
• Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
• Computational complexity of art gallery problems
• THE OBJECT COMPLEXITY MODEL FOR HIDDEN-SURFACE REMOVAL
• The complexity of finding small triangulations of convex 3-polytopes
• The Art Gallery Problem is ∃ℝ-complete
• Planar visibility
• On nontriangulable polyhedra