Skip to main content
Log in

On the total perimeter of homothetic convex bodies in a convex container

  • Original Paper
  • Published:
Beiträge zur Algebra und Geometrie / Contributions to Algebra and Geometry Aims and scope Submit manuscript

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 \(\mathrm{per}(S)\), in terms of \(\mathrm{per}(D)\) and \(n\). When all homothets of \(C\) touch the boundary of the container \(D\), we show that either \(\mathrm{per}(S)=O(\log n)\) or \(\mathrm{per}(S)=O(1)\), depending on how \(C\) and \(D\) “fit together”. Apart from the constant factors, these bounds are the best possible. Specifically, we prove that \(\mathrm{per}(S)=O(1)\) if \(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\)) and \(\mathrm{per}(S)=O(\log n)\) otherwise. When \(D\) is parallel to \(C\) but the homothets of \(C\) may lie anywhere in \(D\), we show that \(\mathrm{per}(S)=O((1+\mathrm{esc}(S)) \log n/\log \log n)\), where \(\mathrm{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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

Notes

  1. Throughout this paper, \(\log x\) denotes the logarithm of \(x\) to base 2.

  2. A planar set has bounded description complexity if its boundary consists of a finite number of algebraic curves of bounded degrees.

References

  • Apostol, T.M.: Introduction to Analytic Number Theory. Springer, New York (1976)

    MATH  Google Scholar 

  • Arora, S.: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J. ACM 45(5), 753–782 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  • Bezdek, K.: On a strong version of the Kepler conjecture. Mathematika 59(1), 23–30 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  • Bern, M., Eppstein, D.: Approximation algorithms for geometric problems. In: Hochbaum, D.S. (ed.) Approximation Algorithms for NP-hard Problems, pp. 296–345. PWS Publishing Company, Boston (1997)

    Google Scholar 

  • Brass, P., Moser, W.O.J., Pach, J.: Research Problems in Discrete Geometry. Springer, New York (2005)

    MATH  Google Scholar 

  • de Berg, M., Gudmundsson, J., Katz, M.J., Levcopoulos, C., Overmars, M.H., van der Stappen, A.F.: TSP with neighborhoods of varying size. J. Algorithms 57(1), 22–36 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  • Dumitrescu, A., Mitchell, J.S.B.: Approximation algorithms for TSP with neighborhoods in the plane. J. Algorithms 48(1), 135–159 (2003)

  • Dumitrescu, A., Tóth, C.D.: Minimum weight convex Steiner partitions. Algorithmica 60(3), 627–652 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  • Dumitrescu, A., Tóth, C.D.: The traveling salesman problem for lines, balls and planes. In: Proceedings of 24th ACM-SIAM Symposium on Discrete Algorithms, 2013, SIAM, pp. 828–843

  • Ford, K.R.: Fractions. Am. Math. Mon. 45(9), 586–601 (1938)

    Article  Google Scholar 

  • Glazyrin, A., Morić, F.: Upper bounds for the perimeter of plane convex bodies. Acta Mathematica Hungarica 142(2), 366–383 (2014)

  • Graham, R.L., Lagarias, J.C., Mallows, C.L., Wilks, A.R., Yan, C.H.: Apollonian circle packings: geometry and group theory I: the Apollonian group. Discret. Comput. Geom. 34, 547–585 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  • Hales, T.C.: The strong dodecahedral conjecture and Fejes Tóth’s conjecture on sphere packings with kissing number twelve. In: Discrete Geometry and Optimization, vol. 69 of Fields Communications, pp. 121–132, Springer, Switzerland (2013)

  • Levcopoulos, C., Lingas, A.: Bounds on the length of convex partitions of polygons. In: Proceedings of 4th Annual Conference on Foundations of Software Technology and Theoretical Computer Science, LNCS 181, pp. 279–295, Springer (1984)

  • Mata, C., Mitchell, J.S.B.: Approximation algorithms for geometric tour and network design problems. In: Proceedings of 11th ACM Symposium on Computational Geometry, ACM, pp. 360–369 (1995)

  • Mitchell, J.S.B.: A constant-factor approximation algorithm for TSP with pairwise-disjoint connected neighborhoods in the plane. In: Proceedings of 26th ACM Symposium on Computational Geometry, ACM, pp. 183–191 (2010)

Download references

Acknowledgments

We are grateful to Guangwu Xu for kindly showing us a short alternative derivation of the number theoretical sum in Eq. (5). We also thank an anonymous reviewer for his very careful reading of the manuscript and his pertinent remarks.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Csaba D. Tóth.

Additional information

A preliminary version of this paper appeared in Proceedings of the 17th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2013), Berkeley, CA, 2013, LNCS 8096, pp. 96–109. A. Dumitrescu was supported in part by NSF Grant DMS-1001667.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Dumitrescu, A., Tóth, C.D. On the total perimeter of homothetic convex bodies in a convex container. Beitr Algebra Geom 56, 515–532 (2015). https://doi.org/10.1007/s13366-014-0219-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13366-014-0219-1

Keywords

Mathematics Subject Classification

Navigation