The digital edition of all books may be viewed on our website before purchase. Excerpt from Robotics Research Technical Report: Combinatorial and Algorithmic Analysis of Space Decomposition Problems (Classic Reprint)
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books.
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works. This text has been digitally restored from a historical edition. Some errors may persist, however we consider it worth publishing due to the work's historical value.The digital edition of all books may be viewed on our website before purchase.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Vendeur : Forgotten Books, London, Royaume-Uni
Paperback. Etat : 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. N° de réf. du vendeur 9781332114689_0
Quantité disponible : Plus de 20 disponibles
Vendeur : PBShop.store US, Wood Dale, IL, Etats-Unis
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur LW-9781332114689
Quantité disponible : 15 disponible(s)
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur LW-9781332114689
Quantité disponible : 15 disponible(s)