University of Calgary

The Problem of Polygons with Hidden Vertices


G. Ewald proved that it is possible for a polygon(al path) in R^3 to hide all its vertices behind its edges from the sight of a point M not on the polygon. Ewald also stated that it takes at least 8 vertices to do the job and constructed an example with 14 vertices. It was then suggested that the least number of vertices n_min for such a configuration is closer to 14 than to 8. In this paper, we shall prove that 11 \le n_min \le 12.
Powered by UNITIS. More features.

Get Course Information