How to sew in practice?

Abstract

In this note we prove a theorem concerning the sewing of even dimensional neighbourly polytopes. The theorem provides a fast algorithm for sewing in practice. We also give a description of the universal faces of a sewn $d$-polytope in terms of the main theorem.

10 pages, 1 figure, 1 table

Cited by in corpus (2)

• Neighborly and almost neighborly configurations, and their duals
• Many neighborly polytopes and oriented matroids