The densest packing of equal circles into a parallel strip

Research output: Article

15 Citations (Scopus)

Abstract

What is the densest packing of points in an infinite strip of width w, where any two of the points must be separated by distance at least I? This question was raised by Fejes-Tóth a number of years ago. The answer is trivial for {Mathematical expression} and, surprisingly, it is not difficult to prove [M2] for {Mathematical expression}, where n is a positive integer, that the regular triangular lattice gives the optimal packing. Kertész [K] solved the case {Mathematical expression}. Here we fill the first gap, i.e., the maximal density is determined for {Mathematical expression}.

Original languageEnglish
Pages (from-to)95-106
Number of pages12
JournalDiscrete & Computational Geometry
Volume6
Issue number1
DOIs
Publication statusPublished - dec. 1 1991

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'The densest packing of equal circles into a parallel strip'. Together they form a unique fingerprint.

  • Cite this