How many cages midscribe an egg

Abstract: The Midscribability Theorem, which was first proved by O. Schramm, states that: given a strictly convex body

K s u b s e t m a t h b b R^{3}

with smooth boundary and a convex polyhedron

P

, there exists a polyhedron

Q s u b s e t m a t h b b {R P}^{3}

combinatorially equivalent to

P

which midscribes

K

. Here the word "midscribe" means that all it's edges are tangent to the boundary surface of

K

. By using of the intersection number technique, together with the Teichm"{u}ller theory of packings, this paper provides an alternative approach to this theorem. Furthermore, combining Schramm's method with the above ones, the authors prove a rigidity result concerning this theorem as well. Namely, such a polyhedron is unique under certain normalization conditions.

Recommendations

Cites work

Cited in

(11)

Describes a project that uses

Uses Software

CirclePack

This page was built for publication: How many cages midscribe an egg

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963147)