The densest packing of equal circles into a parallel strip

Research output: Contribution to journalArticle

14 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 1991

Fingerprint

Packing
Strip
Circle
Triangular Lattice
Trivial
Integer

ASJC Scopus subject areas

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

Cite this

The densest packing of equal circles into a parallel strip. / Füredi, Z.

In: Discrete & Computational Geometry, Vol. 6, No. 1, 12.1991, p. 95-106.

Research output: Contribution to journalArticle

@article{592b06be455c49128699dc9f9f73fe5d,
title = "The densest packing of equal circles into a parallel strip",
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{\'o}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{\'e}sz [K] solved the case {Mathematical expression}. Here we fill the first gap, i.e., the maximal density is determined for {Mathematical expression}.",
author = "Z. F{\"u}redi",
year = "1991",
month = "12",
doi = "10.1007/BF02574677",
language = "English",
volume = "6",
pages = "95--106",
journal = "Discrete and Computational Geometry",
issn = "0179-5376",
publisher = "Springer New York",
number = "1",

}

TY - JOUR

T1 - The densest packing of equal circles into a parallel strip

AU - Füredi, Z.

PY - 1991/12

Y1 - 1991/12

N2 - 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}.

AB - 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}.

UR - http://www.scopus.com/inward/record.url?scp=51249171451&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=51249171451&partnerID=8YFLogxK

U2 - 10.1007/BF02574677

DO - 10.1007/BF02574677

M3 - Article

AN - SCOPUS:51249171451

VL - 6

SP - 95

EP - 106

JO - Discrete and Computational Geometry

JF - Discrete and Computational Geometry

SN - 0179-5376

IS - 1

ER -