Let P = (p1, p2, …, pn) and Q = (q1 q2, …, qm) be two simple polygons monotonic in directions θ and ϕ, respectively. It is shown that P and Q are separable with a single translation in at least one of the directions: θ + π/2, ϕ + π/2. Furthermore, a direction for carrying out such a 2 translation can be determined in O(m + n) time. This procedure is of use in solving the FIND-PATH problem in robotics.
ASJC Scopus subject areas
- Control and Systems Engineering
- Computer Science Applications