Robotics Research Technical Report by Author Unknown (5 results)

- Softcover
Seller: PBShop.store US, Wood Dale, IL, U.S.A.PBShop.store US
Contact seller5-star sellerCondition: New
£ 24.23
Free ShippingShips within U.S.A.Quantity: 15 available
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.

- Softcover
Seller: PBShop.store UK, Fairford, GLOS, United KingdomPBShop.store UK
Contact seller5-star sellerCondition: New
£ 22.27
£ 4.16 shippingShips from United Kingdom to U.S.A.Quantity: 15 available
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.

- Hardcover
Seller: PBShop.store US, Wood Dale, IL, U.S.A.PBShop.store US
Contact seller5-star sellerCondition: New
£ 32.38
Free ShippingShips within U.S.A.Quantity: 15 available
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000.

- Hardcover
Seller: PBShop.store UK, Fairford, GLOS, United KingdomPBShop.store UK
Contact seller5-star sellerCondition: New
£ 29.27
£ 4.16 shippingShips from United Kingdom to U.S.A.Quantity: 15 available
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000.

- Softcover
- Print on Demand
Seller: Forgotten Books, London, United KingdomForgotten Books
Contact seller5-star sellerCondition: New
£ 15.49
Free ShippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Paperback. Condition: New. Print on Demand. This book analyzes the structure of space decomposition problems in computational geometry. It approaches this area of study through two main tracks: geodesic Voronoi diagrams and relative convexity. The Voronoi diagram of a set of sites partitions space into cells, each associated with a particular site such that all points in the cell are closer to that site than to any other site. Geodesic Voronoi diagrams are a generalized Voronoi diagram that instead of the Euclidean metric commonly employed, use an intrinsic geodesic distance within a simple polygon. The other approach this book takes is to provide a thorough combinatorial analysis of the structure of arrangements of convex plates in three-dimensional space and to establish subcubic bounds on the maximum cell complexity of such arrangements. The author's results provide insight into the computational complexity of motion planning algorithms and show that there exists a subdivision of cells that is not much larger than the combinatorial complexity of the cell(s) being triangulated. 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.…