Preprocessing-query tradeoffs in offline non-convex polygon separation queries
This paper studies an offline translation-query problem between two simple polygons. Given polygons 𝐴 and 𝐵 and a query translation 𝑡 = (𝑑𝑥, 𝑑𝑦), the task is to compute an additional correction vector 𝑎 so that 𝐵 + 𝑡 + 𝑎 is separated from 𝐴, or reaches the minimum corrective translation required by the evaluated solver...