On calculating the packing efficiency for embedding hexagonal and dodecagonal sensors in a circular container
Summary: In this paper, a problem of packing hexagonal and dodecagonal sensors in a circular container is considered. We concentrate on the sensor manufacturing application, where sensors need to be produced from a circular wafer with maximal silicon efficiency (SE) and minimal number of sensor cuts. Also, a specific application is considered when produced sensors need to cover the circular area of interest with the largest packing efficiency (PE). Even though packing problems are common in many fields of research, not many authors concentrate on packing polygons of known dimensions into a circular shape to optimize a certain objective. We revisit this problem by using some well-known formulations concerning regular hexagons. We provide mathematical expressions to formulate the difference in efficiency between regular and semiregular tessellations. It is well-known that semiregular tessellation will cause larger silicon waste, but it is important to formulate the ratio between the two, as it affects the sensor production cost. The reason why we have replaced the ``perfect regular tessellation with semiregular one is the need to provide spacings at the sensor vertices for placing mechanical apertures in the design of the new CMS detector. Archimedean \(\{3,12^2 \}\) semiregular tessellation and its more flexible variants with irregular dodecagons can provide these triangular spacings but with larger number of sensor cuts. Hence, we construct an irregular convex hexagon that is semiregularly tessellating the targeted area. It enables the sensor to remain symmetric and hexagonal in shape, even though irregular, and produced with minimal number of cuts with respect to dodecagons. Efficiency remains satisfactory, as we show that, by producing the proposed irregular hexagon sensors from the same wafer as a regular hexagon, we can obtain almost the same SE.
- 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
- scientific article; zbMATH DE number 3789394 (Why is no real title available?)
- scientific article; zbMATH DE number 894522 (Why is no real title available?)
- 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)
