Randomized incremental construction of abstract Voronoi diagrams

Aurenhammer, 1987, Power diagrams: Properties, algorithms and applications, SIAM J. Comput., 16, 78, 10.1137/0216006 Aurenhammer, 1991, Voronoi diagrams—A survey of fundamental geometric data structure, ACM Computing Surveys, 23, 345, 10.1145/116873.116880 Boissonnat, 1989, On the randomized construction of the Delaunay tree, Technical Report 1140 Boissonnat, 1992, Applications of random sampling to on-line algorithms in computational geometry, Discrete Comput. Geom., 8, 51, 10.1007/BF02293035 Boissonnat, 1990, An on-line construction of higher order Voronoi diagrams and its randomized analysis, Proc. of the 2nd Canadian Conference on Computational Geometry, 278 Brown, 1979, Voronoi diagrams from convex hulls, Inform. Process. Lett., 9, 223, 10.1016/0020-0190(79)90074-7 Clarkson, 1992, Four results on randomized incremental constructions, LNCS 577, 463 Clarkson, 1989, Applications of random sampling in computational geometry, II, Discrete Comput. Geom., 4, 387, 10.1007/BF02187740 Edelsbrunner, 1986, Voronoi diagrams and arrangements, Discrete Comput. Geom., 1, 25, 10.1007/BF02187681 Fortune, 1987, A sweepline algorithm for Voronoi diagrams, Algorithmica, 2, 153, 10.1007/BF01840357 Guibas, 1992, Randomized incremental construction of Delaunay and Voronoi diagrams, Algorithmica, 7, 381, 10.1007/BF01758770 Guibas, 1985, Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams, ACM Trans. Graphics, 4, 74, 10.1145/282918.282923 Klein, 1988, Abstract Voronoi diagrams and their applications, LNCS 333, 148 Klein, 1988, Voronoi diagrams in the Moscow metric, Proc. of the Workshop on Graphtheoretic Concepts in Computer Science, Amsterdam, LNCS 344, 434 Klein, 1989, Combinatorial properties of abstract Voronoi diagrams, LNCS 411, 356 Klein, 1989, LNCS 400 Lee, 1980, Two-dimensional Voronoi diagrams in the Lp-metric, J. ACM, 27, 604, 10.1145/322217.322219 Leven, 1986, Intersection and proximity problems and Voronoi diagrams, Vol. 1 Mehlhorn, 1991, On the construction of abstract Voronoi diagrams, Discrete Comput. Geom., 6, 211, 10.1007/BF02574686 Mehlhorn, 1992, Furthest site abstract Voronoi diagrams Shamos, 1975, Closet point problems, Proc. of the 16th Annual IEEE Symposium on Foundations of Computer Science, 151 Zimmer, 1992, Die Konstruktion abstrakter Voronoidiagramme