A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
We give efficient, output sensitive algorithms to construct Voronoi diagrams of order one to k of a given collection of sites in Rd and levels of order one to k in a nonredundant arrangement of hyperplanes in Rd (an arrangement is called nonredundant if every hyperplane in it supports the convex polytope of the arrangement surrounding the origin). We also give efficient dynamic algorithms for the same problems that allow the user to add or delete an object-the object being a site in the case ofdoi:10.1016/0022-0000(93)90041-t fatcat:vkmzrakm25ffbibfr6fehij5cq