Items related to Separating Two Simple Polygons, by a Sequence of Translation...

Separating Two Simple Polygons, by a Sequence of Translations - Softcover

Unknown

 
9781332194605: Separating Two Simple Polygons, by a Sequence of Translations

Synopsis

This book presents an innovative algorithm to determine whether two disjoint simple polygons can be moved by a sequence of translations to a position sufficiently far from each other without colliding, and if so, produces such a motion. The algorithm can also determine whether a given polygon can be separated from another using a specified number of translations, and if so, produces a motion using the smallest number of translations or a motion with the shortest total translational distance. The problem that this book addresses is a special instance of the motion planning problem that seeks a purely translational collision-free motion of a polygonal object amidst a collection of polygonal obstacles. The author has shown that the existence of a motion of this type can be determined in time that is close to optimal.

"synopsis" may belong to another edition of this title.