๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the section of a convex polyhedron

โœ Scribed by Peter Frankl; Hiroshi Maehara; Junichiro Nakashima


Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
117 KB
Volume
140
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

โœฆ Synopsis


Let P be a convex polyhedron in R s, and E be a plane cutting P. Then the section Pt=Pc~E is a convex polygon. We show a sharp inequality (the perimeter of Pe) <~ L(P), where L(P) denotes the sum of the edge-lengths of P.

For a polyhedron (or a polygon) X, L(X) denotes the sum of the edge-lengths of X. Thus if X is a polygon then L(X) is the perimeter of X.

Let P be the surface of a convex polyhedron in R 3, and E be a plane cutting P. Then the section PE = PnE is a convex polygon, see Fig. 1. We prove the following theorem.

Theorem. L (PE) < ~ L (P).

We use the following lemma.

Lemma. If X is a convex polygon contained in another convex polyffon Y, then L(X) ~ L( Y).


๐Ÿ“œ SIMILAR VOLUMES


Characterizations of adjacency on the br
โœ Rick Giles; Dirk Hausmann ๐Ÿ“‚ Article ๐Ÿ“… 1979 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 805 KB

Given two distinct branchings of a directed graph G, we present several conditions which are equivalent to the corresporiding incidence vectors of the branchings being adjacent on the branching polyhedron of 6. The proof of these equivalences uses a "shrinking algorithm'\* whi\_h will determine in O

On the C-Curves of a Convex Surface
โœ Paris Pamfilos ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 206 KB

0. Introdnction. W. BLASCHXE proved in his book "Kreis und Kugel" ([ 11, p. 157) the following theorem: An ovaloid which for every direction e (unit vector) of parallel light has plnnnr shadow-lines L'i (fig. 1) is an ellipsoid.

On the diameter of convex polytopes
โœ Peter Kleinschmidt; Shmuel Onn ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 171 KB