Skip to main content
Springer Nature Link
Log in

A Reliable Area Reduction Technique for Solving Circle Packing Problems

  • Published:
Computing Aims and scope Submit manuscript

Abstract

We are dealing with the optimal, i.e., densest packings of congruent circles into the unit square. In the recent years we have built a numerically reliable, verified method using interval arithmetic computations, which can be regarded as a ``computer-assisted proof''. An efficient algorithm has been published earlier for eliminating large sets of suboptimal points of the equivalent point packing problem. The present paper discusses an interval arithmetic based version of this tool, implemented as an accelerating device of an interval branch-and-bound optimization algorithm. In order to satisfy the rigorous requirements of a computational proof, a detailed algorithmic description and a proof of correctness are provided. This elimination method played a key role in solving the previously open problem instances of packing 28, 29, and 30 circles.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  • de Groot, C., Monagan, M., Peikert, R., Würtz, D.: Packing circles in a square: review and new results. In: System modeling and optimization (Proc. 15th IFIP Conf. Zurich, 1991) (P. Kall, ed.). Lecture Notes in Control and Information Services, vol. 180, 1992, pp. 45–54.

  • R. Hammer M. Hocks U. Kulisch D. Ratz (1993) Numerical toolbox for verified computing I Springer Berlin

    Google Scholar 

  • E. Hansen (1992) Global optimization using interval analysis Marcel Dekker New York

    Google Scholar 

  • Knüppel, O.: PROFIL – Programmer's Runtime Optimized Fast Interval Library. Bericht 93.4., Technische Universität Hamburg-Harburg 1993.

  • M. Locatelli U. Raber (2002) ArticleTitlePacking equal circles in a square: a deterministic global optimization approach Discrete Appl. Math. 122 139–166 Occurrence Handle10.1016/S0166-218X(01)00359-6 Occurrence Handle2003e:52026

    Article  MathSciNet  Google Scholar 

  • M. Cs. Markót (2000) ArticleTitleAn interval method to validate optimal solutions of the “Packing Circles in a Unit Square” problems Central Eur. J. Oper. Res. 8 63–78 Occurrence Handle0963.52008

    MATH  Google Scholar 

  • M. Cs. Markót (2004) ArticleTitleOptimal packing of 28 equal circles in a unit square – the first reliable solution Numer. Algorith. 37 253–261 Occurrence Handle1077.90056

    MATH  Google Scholar 

  • M. Cs. Markót T. Csendes (2005) ArticleTitleA new verified optimization technique for the “Packing Circles in a Unit Square” problems SIAM J. Optim. 16 193–219 Occurrence Handle10.1137/S1052623403425617 Occurrence Handle2177775

    Article  MathSciNet  Google Scholar 

  • M. Cs. Markót T. Csendes A. E. Csallner (1999) ArticleTitleMultisection in interval methods for global optimization II. Numerical tests J. Global Optim. 16 219–228

    Google Scholar 

  • R. E. Moore (1966) Interval analysis Prentice-Hall Englewood Cliffs

    Google Scholar 

  • Nurmela, K. J., Östergård, P. R. J.: Optimal packings of equal circles in a square. In: Combinatorics, graph theory, and algorithms (Proc. 8th Quadrennial Int. Conf. on Graph Theory, Combinatorics, Algorithms, and Applications, 1999) (Y. Alavi, D. R. Lick, and A. Schwenk, eds.), pp. 671–680.

  • K. J. Nurmela P. R. J. Östergård (1999) ArticleTitleMore optimal packings of equal circles in a square Disc Comput. Geometry 22 439–457

    Google Scholar 

  • H. Ratschek J. Rokne (1988) New Computer methods for global optimization Ellis Horwood Chichester

    Google Scholar 

  • P. G. Szabó (2000) ArticleTitleSome new structures for the “Equal Circles Packing in a Square” Problem Central Eur. J. Oper. Res. 8 79–91 Occurrence Handle0962.52005

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Advanced Concepts Team, ESTEC, European Space Agency, Keplerlaan 1, 2201, AZ, Noordwijk, The Netherlands

    M. C. Markót

  2. Institute of Informatics, University of Szeged, 6701, Szeged, P.O. Box 652, Hungary

    T. Csendes

Authors
  1. M. C. Markót
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. T. Csendes
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to M. C. Markót.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Markót, M.C., Csendes, T. A Reliable Area Reduction Technique for Solving Circle Packing Problems. Computing 77, 147–162 (2006). https://doi.org/10.1007/s00607-005-0155-x

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00607-005-0155-x

AMS Subject Classifications

Keywords