Optimized Packing Clusters of Objects in a Rectangular Container
作者: T. RomanovaA. PankratovI. LitvinchevYu. PankratovaI. Urniaieva
刊名: Mathematical Problems in Engineering, 2019, Vol.2019
来源数据库: Directory of Open Access Journals
DOI: 10.1155/2019/4136430
原始语种摘要: A packing (layout) problem for a number of clusters (groups) composed of convex objects (e.g., circles, ellipses, or convex polygons) is considered. The clusters have to be packed into a given rectangular container subject to nonoverlapping between objects within a cluster. Each cluster is represented by the convex hull of objects that form the cluster. Two clusters are said to be nonoverlapping if their convex hulls do not overlap. A cluster is said to be entirely in the container if so is its convex hull. All objects in the cluster have the same shape (different sizes are allowed) and can be continuously translated and rotated. The objective of optimized packing is constructing a maximum sparse layout for clusters subject to nonoverlapping and containment conditions for clusters and...
全文获取路径: DOAJ  (合作)

  • cluster 
  • problem 题目
  • nonoverlapping 不重叠
  • optimal 最佳的
  • rotated 修]轮流[排
  • convex 凸起的
  • constructing 合组
  • packing 充填
  • entirely 完全地
  • layout 草图