Publisher's Synopsis
Excerpt from On Shortest Paths Amidst Convex Polyhedra
The paper is organized as follows. In Section 2 we prove our main result about a polynomial upper bound on the number of sequences of edges crossed by shortest paths along a convex polyhedron. In Section 3 we extend the observations made above to obtain polynomial time shortest-path algorithms for any fixed number of convex polyhedral obstacles.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
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.
