On calculating the packing efficiency for embedding hexagonal and dodecagonal sensors in a circular container
From MaRDI portal
Publication:2299015
Recommendations
Cites work
- scientific article; zbMATH DE number 3789394 (Why is no real title available?)
- scientific article; zbMATH DE number 894522 (Why is no real title available?)
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Degree diameter problem on triangular networks
- Global Optimization in Geometry — Circle Packing into the Square
- Integer programming formulations for approximate packing circles in a rectangular container
- New approaches to circle packing in a square. With program codes.
- Numerical optimization method for packing regular convex polygons
- Optimized ellipse packings in regular polygons
- Optimized packing clusters of objects in a rectangular container
- Packing circular-like objects in a rectangular container
- Packing ellipses in an optimized convex polygon
- Packing ellipsoids with overlap
- Packing unequal rectangles and squares in a fixed size circular container using formulation space search
- Revisiting the hexagonal lattice: on optimal lattice circle packing
- Tilings by Regular Polygons
This page was built for publication: On calculating the packing efficiency for embedding hexagonal and dodecagonal sensors in a circular container
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2299015)