Isbn: 9781332194605 - separating two simple polygons, by a sequence of translations (classic reprint) (3 risultati)

PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

Paperback. Condizione: New. Print on Demand. 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. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item.…