Optimal Packings of Two Ellipses in a Square

@inproceedings{Gensane2014OptimalPO,
  title={Optimal Packings of Two Ellipses in a Square},
  author={Thierry Gensane and Pascal Honvault},
  year={2014}
}
For each real number E in ]0, 1], we describe the densest packing PE of two non-overlapping congruent ellipses of aspect ratio E in a square. We find three different patterns as E belongs to ]0, 1/2], [1/2, E0] where E0 = √ (6 √ 3− 3)/11, and [E0, 1]. The technique of unavoidable sets – used by Friedman for proving the optimality of square packings – allows to prove the optimality of each packing PE . 

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper

References

Publications referenced by this paper.
Showing 1-3 of 3 references

Packing and covering with circles

  • H. Melissen
  • Ph.D. Thesis, Utrecht University
  • 1997
1 Excerpt