Every polygon
can be
companioned by a cap polygon
such that
and
serve as two parts of the boundary surface of a polyhedron
. Pairs of
vertices on
and
are identified successively
to become vertices of
.
We study the cap construction that asserts equal angular defects at these pairings.
We exhibit a linear relation that arises from the cap construction algorithm, which in
turn demonstrates an abundance of polygons that satisfy the
closed capcondition, that is, those that can successfully undergo the cap construction
process.
PDF Access Denied
We have not been able to recognize your IP address
18.97.14.89
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our
journal-recommendation form.
Or, visit our
subscription page
for instructions on purchasing a subscription.