Aicholzer et al. recently presented a new geometric construct called the straight skeleton of a simple polygon and gave several combinatorial bounds for it. Independently, the current authors defined in companion papers a distance function based on the same offsetting function for convex polygons. In particular, we explored the nearest- and furthest- neighbor Voronoi diagrams of this function and presented algorithms for constructing them. In this paper we give solutions to some constrained annulus placement problems for offset polygons. The goal is to find the smallest annulus region of a polygon containing a set of points. We fix the inner (resp.,outer) polygon of the annulus and minimize the annulus region by minimizing the outer offset (resp., maximizing the inner offset. We also solve a a special case of the first problem: finding the smallest translated offset of a polygon containing an entire point set. We extend our results for the standard polygon scaling function as well.

Additional Metadata
Citation
Barequet, G. (Gill), Bose, P, & Dickerson, M.T. (Matthew T.). (1999). Optimizing constrained offset and scaled polygonal annuli.