Packing of ellipses with continuously distributed area

DOI10.1016/0012-365X(86)90018-XzbMath0599.52007MaRDI QIDQ1080186

László Fejes Tóth

Publication date: 1986

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

coveringdensitypacking of ellipses with continuously distributed areas

Mathematics Subject Classification ID

Inequalities and extremum problems involving convexity in convex geometry (52A40) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Combinatorial aspects of packing and covering (05B40)

Related Items (1)

Numerical optimization methods for packing equal orthogonally oriented ellipses in a rectangular domain

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An Introduction to the Geometry of Numbers
• Covering the Plane with Convex Sets

This page was built for publication: Packing of ellipses with continuously distributed area