Intersection and Closest-Pair Problems for a Set of Planar Objects (Classic Reprint)
Liczba stron: 26
Wydanie: 2018 r.
Excerpt from Intersection and Closest-Pair Problems for a Set of Planar Objects<br><br>The algorithm halts whenever an intersection is detected, or, if no intersection has been detected, when all the abscissae a, and b, have been processed, in which case the algorithm reports that there is no intersection between the objects in S.<br><br>About the Publisher<br><br>Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com<br><br>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.