Da: PBShop.store US, Wood Dale, IL, U.S.A.
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
EUR 24,49
Quantità: 15 disponibili
Aggiungi al carrelloPAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.
Da: Forgotten Books, London, Regno Unito
EUR 15,51
Quantità: Più di 20 disponibili
Aggiungi al carrelloPaperback. 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.
EUR 31,45
Quantità: Più di 20 disponibili
Aggiungi al carrelloGebunden. Condizione: New.
Da: Buchpark, Trebbin, Germania
EUR 26,79
Quantità: 1 disponibili
Aggiungi al carrelloCondizione: Hervorragend. Zustand: Hervorragend | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.
Da: Majestic Books, Hounslow, Regno Unito
EUR 22,71
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. Print on Demand pp. 30.