Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have