An F-polygon is a simple polygon whose vertices are F-points, which are points of the set of vertices of a tiling of R~2 by regular triangles and regular hexagons of unit edge. Let f(v) denote the least possible numbe...An F-polygon is a simple polygon whose vertices are F-points, which are points of the set of vertices of a tiling of R~2 by regular triangles and regular hexagons of unit edge. Let f(v) denote the least possible number of F-points in the interior of a convex F-polygon K with v vertices. In this paper we prove that f(10) = 10, f(11) = 12,f(12) = 12.展开更多
The pinwheel pattern as a suitable and advantageous alternative for the loading implementation of the pallet loading problem （PLP） is identified after a survey on the loading pattern. The definitions, elements, cate...The pinwheel pattern as a suitable and advantageous alternative for the loading implementation of the pallet loading problem （PLP） is identified after a survey on the loading pattern. The definitions, elements, categories, generating algorithms of the pinwheel pattern are discussed and a uniform symmetric pinwheel notation is proposed. Based on the forming geometry of a pinwheel, the pinwheel structure is analyzed in terms of the innate box ratio, the box/block orientation and the box number by combinatorial and geometrical methods. A revised data set for the PLP with an area ratio range from 1 to 76 and a box ratio range from 1 to 10 is proposed. All pinwheel instances with this data set are calculated, and box ratio range is obtained for each possible pinwheel pattern, which can be found for all non-prime numbers of boxes. And a high box ratio makes an optimal pinwheel pattern more likely appear. Results identify the impact of the above pinwheel pattern and the box ratio on the pallet loading problem.展开更多
基金Supported by National Natural Science Foundation of China(Grant No.12271139)。
文摘An F-polygon is a simple polygon whose vertices are F-points, which are points of the set of vertices of a tiling of R~2 by regular triangles and regular hexagons of unit edge. Let f(v) denote the least possible number of F-points in the interior of a convex F-polygon K with v vertices. In this paper we prove that f(10) = 10, f(11) = 12,f(12) = 12.
基金The National Natural Science Foundation of China(No.70571033,70831002)
文摘The pinwheel pattern as a suitable and advantageous alternative for the loading implementation of the pallet loading problem （PLP） is identified after a survey on the loading pattern. The definitions, elements, categories, generating algorithms of the pinwheel pattern are discussed and a uniform symmetric pinwheel notation is proposed. Based on the forming geometry of a pinwheel, the pinwheel structure is analyzed in terms of the innate box ratio, the box/block orientation and the box number by combinatorial and geometrical methods. A revised data set for the PLP with an area ratio range from 1 to 76 and a box ratio range from 1 to 10 is proposed. All pinwheel instances with this data set are calculated, and box ratio range is obtained for each possible pinwheel pattern, which can be found for all non-prime numbers of boxes. And a high box ratio makes an optimal pinwheel pattern more likely appear. Results identify the impact of the above pinwheel pattern and the box ratio on the pallet loading problem.
