Beitr\ EMIS ELibM Electronic Journals Beiträge zur Algebra und Geometrie
Contributions to Algebra and Geometry
Vol. 45, No. 1, pp. 217-224 (2004)

Previous Article

Next Article

Contents of this Issue

Other Issues

ELibM Journals

ELibM Home



The problem of polygons with hidden vertices

Joseph M. Ling

University of Calgary, Calgary, Alberta, Canada T2N 1N4

Abstract: G. Ewald proved that it is possible for a polygon(al path) in \bf{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\leq n_{\min }\leq 12$.

Full text of the article:

Electronic version published on: 5 Mar 2004. This page was last modified: 4 May 2006.

© 2004 Heldermann Verlag
© 2004--2006 ELibM and FIZ Karlsruhe / Zentralblatt MATH for the EMIS Electronic Edition