Maximin location of convex objects in a polygon and related dynamic voronoi diagrams

This paper considers the maximin placement of a convex polygon P inside a polygon Q, and introduce several new static and dynamic Voronoi diagrams to solve the problem. It is shown that P can be placed inside Q, using translation and rotation, so that the minimum Euclidean distance between any point on P and any point on Q is maximized in O(m⁴nλ₁₆(mn)log mn) time, where m and n are the numbers of edges of P and Q, respectively, and λ₁₆(N) is the maximum length of Davenport-Schinzel sequences on N alphabets of order 16. If only translation is allowed, the problem can be solved in O(mn log mn) time. The problem of placing multiple translates of P inside Q in a maximin manner is also considered, and in connection with this problem the dynamic Voronoi diagram of k rigidly moving sets of n points is investigated. The combinatorial complexity of this canonical dynamic diagram for kn points is shown to be O(n²) and O(n³k⁴ log^* k) for k = 2,3 and k ≥ 4, respectively. Several related problems are also treated in a unified way.