Robotics Research Technical Report: Computing the Geodesic Center of a Simple Polygon (Classic Reprint) - Softcover

Inhaltsangabe

Excerpt from Robotics Research Technical Report: Computing the Geodesic Center of a Simple Polygon

The total time complexity of our algorithm is o(u log2u). The final stage (that of finding the smallest spanning circle of circles), which may be of independent interest in location theory, runs in time o(u log n log log n).

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.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.