The closest packing of convex two-dimensional domains
From MaRDI portal
Publication:2649591
Cites work
Cited in
(22)- Combinatorial geometry
- On two finite covering problems of Bambah, Rogers, Woods and Zassenhaus
- Densest packing of translates of a domain
- Densest packing of translates of the union of two circles
- Finite coverings by translates of centrally symmetric convex domains
- A star domain with densest admissible point set not a lattice
- Self-packing of centrally symmetric convex bodies in \(\mathbb{R}{}^ 2\)
- Sausages are good packings
- Packings, sausages and catastrophes
- Pessimal packing shapes
- Bounds for totally separable translative packings in the plane
- The simultaneous packing and covering constants in the plane
- Functionals on the spaces of convex bodies
- Modern developments in the geometry of numbers
- Etalements cristallographiques
- Covering the plane by convex discs
- On the multiple packing densities of triangles
- Entropic Trust Region for Densest Crystallographic Symmetry Group Packings
- The honeycomb conjecture in normed planes and an alpha-convex variant of a theorem of Dowker
- An inequality in the geometry of numbers
- Double-lattice packings of convex bodies in the plane
- Heuristic approaches to large-scale periodic packing of irregular shapes on a rectangular sheet
This page was built for publication: The closest packing of convex two-dimensional domains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2649591)