On the Total Perimeter of Homothetic Convex Bodies in a Convex Container
For two 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 n. When all homothets of C touch the boundary of the container D, we show that either per(S) = O(logn) 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(logn) 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)) logn/loglogn), 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.
KeywordsConvex body perimeter maximum independent set homothet traveling salesman approximation algorithm
Unable to display preview. Download preview PDF.
- 2.Brass, P., Moser, W.O.J., Pach, J.: Research Problems in Discrete Geometry. Springer (2005)Google Scholar
- 3.Bern, M., Eppstein, D.: Approximation algorithms for geometric problems. In: Approximation Algorithms for NP-hard Problems, pp. 296–345. PWS (1997)Google Scholar
- 7.Dumitrescu, A., Tóth, C.D.: The traveling salesman problem for lines, balls and planes, in. In: Proc. 24th SODA, pp. 828–843. SIAM (2013)Google Scholar
- 9.Mata, C., Mitchell, J.S.B.: Approximation algorithms for geometric tour and network design problems. In: Proc. 11th SOCG, pp. 360–369. ACM (1995)Google Scholar
- 10.Mitchell, J.S.B.: A constant-factor approximation algorithm for TSP with pairwise-disjoint connected neighborhoods in the plane. In: Proc. 26th SOCG, pp. 183–191. ACM (2010)Google Scholar