On calculating the packing efficiency for embedding hexagonal and dodecagonal sensors in a circular container
DOI10.1155/2019/9624751zbMATH Open1435.52009OpenAlexW2960363875WikidataQ127588520 ScholiaQ127588520MaRDI QIDQ2299015FDOQ2299015
Authors: Marina Prvan, Julije Ožegović, Arijana Burazin Mišura 
Publication date: 20 February 2020
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2019/9624751
Recommendations
Combinatorial optimization (90C27) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)
Cites Work
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Title not available (Why is that?)
- New approaches to circle packing in a square. With program codes.
- Tilings by Regular Polygons
- Packing ellipsoids with overlap
- Global Optimization in Geometry — Circle Packing into the Square
- Integer programming formulations for approximate packing circles in a rectangular container
- Packing circular-like objects in a rectangular container
- Numerical optimization method for packing regular convex polygons
- Revisiting the hexagonal lattice: on optimal lattice circle packing
- Degree diameter problem on triangular networks
- Packing unequal rectangles and squares in a fixed size circular container using formulation space search
- Optimized packing clusters of objects in a rectangular container
- Packing ellipses in an optimized convex polygon
- Optimized ellipse packings in regular polygons
- Title not available (Why is that?)
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)
