ON SHORTEST PATHS BETWEEN TWO CONVEX POLYHEDRA (CLASSIC REPRINT)

Excerpt from On Shortest Paths Between Two Convex PolyhedraAs a matter of fact, the problem we face here can be formulated as that of calculating all possible sequences of edges of B which can be crossed by shortest paths from any point on e to any point on e. If we had all these sequences available, then we could unfold each such sequence C in turn so as to make the middle portion of the corresponding candidate path into a straight segment, and then find the shortest path from so to Z constrained to contain such a segment, a task which can be accomplished in much the same way as was done in Sections 3 and 4.About the PublisherForgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.comThis 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._,