Publisher's Synopsis
Excerpt from Computing External-Farthest Neighbors for a Simple Polygon
This paper is divided into five sections. Section 2 discusses the basic geometric concepts that we use in this paper. In Section 3 we prove some properties of external shortest paths, which lead us to an efficient algorithm for computing the external farthest neighbors for every vertex of the polygon. Section 4 describes an O(u log n) algorithm to compute external farthest neighbors. We conclude with some final remarks in Section 5.
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.
