Synopsis
Understanding how to move one polygon past another using only translations — and doing it with an efficient, reliable method you can trust.
This work delves into the problem of separating two simple polygons by a sequence of translations. It places the question in the broader context of motion planning, showing how a single moving polygon can navigate around a fixed obstacle. The focus is on practical algorithms, performance guarantees, and the structure of the space of all free placements.
- Offers a concrete model of translational motion planning for polygonal shapes
- Shows how to compute the space of safe placements and the boundaries that separate them
- Describes methods to find shortest separating motions and, when possible, motions using a limited number of translations
- Provides time and complexity insights for planning and execution
"synopsis" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for Separating Two Simple Polygons, by a Sequence of Translation...
Stock Image
Separating Two Simple Polygons, by a Sequence of Translations (Classic Reprint)
Seller: Buchpark, Trebbin, Germany
Seller rating 5 out of 5 stars
Condition: Hervorragend. Zustand: Hervorragend | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar. Seller Inventory # 31180744/1
Buy Used
US$ 31.81
US$ 122.03 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 1 available