Farthest-polygon Voronoi diagrams

Abellanas, 2001, The farthest color Voronoi diagram and related problems, 113 Abellanas, 2001, Smallest color-spanning objects, vol. 2161, 278 Aurenhammer, 2006, Farthest line segment Voronoi diagrams, Information Processing Letters, 100, 220, 10.1016/j.ipl.2006.07.008 Aurenhammer, 2000, Voronoi diagrams, 201 Bae, 2009, The geodesic farthest-site Voronoi diagram in a polygonal domain with holes, 198 de Berg, 2008 Dehne, 2006, A coarse grained parallel algorithm for Hausdorff Voronoi diagrams, 497 Edelsbrunner, 1986, Optimal point location in a monotone subdivision, SIAM Journal on Computing, 15, 317, 10.1137/0215023 Fortune, 1987, A sweepline algorithm for Voronoi diagrams, Algorithmica, 2, 153, 10.1007/BF01840357 Hatcher, 2002 Huttenlocher, 1993, The upper envelope of Voronoi surfaces and its applications, Discrete Comput. Geom., 9, 267, 10.1007/BF02189323 Jadhav, 1996, An optimal algorithm for the intersection radius of a set of convex polygons, J. Algorithms, 20, 244, 10.1006/jagm.1996.0013 Megiddo, 1983, Applying parallel computation algorithms in the design of serial algorithms, J. ACM, 30, 852, 10.1145/2157.322410 Mehlhorn, 2001, Furthest site abstract Voronoi diagrams, Int. J. Comput. Geom. Appl., 11, 583, 10.1142/S0218195901000663 Molnár, 1956, Über eine Verallgemeinerung auf die Kugelfläche eines topologischen Satzes von Helly, Acta Math. Acad. Sci., 7, 107, 10.1007/BF02022970 Mulmuley, 1990, A fast planar partition algorithm, I, J. Symbolic Comput., 10, 253, 10.1016/S0747-7171(08)80064-8 Papadopoulou, 2004, The Hausdorff Voronoi diagram of point clusters in the plane, Algorithmica, 40, 63, 10.1007/s00453-004-1095-0 Sharir, 1995 M. van Kreveld, T. Schlechter, Automated label placement for groups of islands, in: Proc. of the 22nd International Cartographic Conference (ICC2005), 2005.