The boundary-to-boundary p -dispersion configuration problem with oval objects
研究在给定可行区域内分配不同大小和形状的椭圆对象，通过最大化对象边界与区域边界的最小间距，实现最优分散配置。
We study the problem of allocating “sizeable” (area-consuming) heterogeneous objects with varying features and characteristics in a given feasible region. The objects are modeled by general ovals. The feasible region could be convex (modelled here by regular polygons) or non-convex (modelled here by the intersection of general ovals). We introduce a continuous boundary-to-boundary oval p-dispersion problem. Our objective is to produce optimally dispersed configurations, by maximizing the minimal separation between the boundaries of the oval objects and the boundary of the feasible region.