Excerpt from An O(n Log N) Algorithm for the Voronoi Diagram of a Set of Simple Curve Segments: Preliminary Version We overcome this problem by computing only the 'essential' part of the Voronoi diagram of a slab, where this essential part has size only O(k) if the slab contains 1: endpoints of X. Furthermore, merging two slabs that collectively contain 1: endpoints takes only O(k) work. (note: actually, I: should be the number of segments with endpoints in the slab.) This implies that cad-i stage takes linear time and our stated time bound follows. 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.