### 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 language | English |
---|---|

Pages (from-to) | 95-106 |

Number of pages | 12 |

Journal | Discrete & Computational Geometry |

Volume | 6 |

Issue number | 1 |

DOIs | |

Publication status | Published - Dec 1991 |

### Fingerprint

### 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.

Research output: Contribution to journal › Article

*Discrete & Computational Geometry*, vol. 6, no. 1, pp. 95-106. https://doi.org/10.1007/BF02574677

}

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 -