Abstract Voronoi diagrams, AVDs for short, are based on bisecting curves enjoying simple combinatorial properties, rather than on the geometric notions of sites and distance. They serve as a unifying concept. Once the bisector system of any concrete type of Voronoi diagram is shown to fulfill the AVD axioms, structural results and efficient algorithms become available without further effort; for example, the first optimal algorithms for constructing nearest Voronoi diagrams of disjoint convex objects, or of line segments under the Hausdorff metric, have been obtained this way. One of these axioms stated that all Voronoi regions must be pathwise connected, a property quite useful in divide&conquer and randomized incremental construction algorithms. Yet, there are concrete Voronoi diagrams where this axiom fails to hold. In this paper we consider, for the first time, abstract Voronoi diagrams with disconnected regions. By combining a randomized incremental construction technique with trapezoidal decomposition we obtain an algorithm that runs in expected time [Formula: see text], where s is the maximum number of faces a Voronoi region in a subdiagram of three sites can have, and where mj denotes the average number of faces per region in any subdiagram of j sites. In the connected case, where s = 1 = mj , this results in the known optimal bound [Formula: see text].
Incremental Construction of Generalized Voronoi Diagrams on Pointerless Quadtrees
