Full Download Separating Two Simple Polygons, by a Sequence of Translations (Classic Reprint) - R Pollack file in ePub Online

Excerpt from Separating Two Simple Polygons, by a Sequence of TranslationsLet P and Q be two disjoint simple polygons having m and n sides respectively. We present an algorithm which determines whether Q can be moved by a sequence of translations to a position sufficiently far from P without colliding with P, and which produces such a motion if it exists. Our algorithm