On the Total Perimeter of Homothetic Convex Bodies in a Convex Container

Abstract

For two planar convex bodies, C and D, consider a packing S of n positive homothets of C contained in D. We estimate the total perimeter of the bodies in S, denoted per(S), in terms of per(D) and n. When all homothets of C touch the boundary of the container D, we show that either per(S)=O( n) or per(S)=O(1), depending on how C and D "fit together," and these bounds are the best possible apart from the constant factors. Specifically, we establish an optimal bound per(S)=O( n) unless D is a convex polygon and every side of D is parallel to a corresponding segment on the boundary of C (for short, D is parallel to C). When D is parallel to C but the homothets of C may lie anywhere in D, we show that per(S)=O((1+ esc(S)) n/ n), where esc(S) denotes the total distance of the bodies in S from the boundary of D. Apart from the constant factor, this bound is also the best possible.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…