Minimizing Visible Edges in Polyhedra

08/20/2022

∙

by   Csaba D. Tóth, et al.

∙

0

∙

share

We prove that, given a polyhedron 𝒫 in ℝ^3, every point in ℝ^3 that does not see any vertex of 𝒫 must see eight or more edges of 𝒫; this bound is tight. More generally, this remains true if 𝒫 is any finite arrangement of internally disjoint polygons in ℝ^3.