Tight bound and improved algorithm for farthest-color Voronoi diagrams of line segments

Abellanas, 2006 Aurenhammer, 2000, Voronoi diagrams Bae, 2012, Tight bound for farthest-color Voronoi diagrams of line segments, 40 Bentley, 1979, Algorithms for reporting and counting geometric intersections, IEEE Trans. Comput., C-28, 643, 10.1109/TC.1979.1675432 Chazelle, 1992, An optimal algorithm for intersecting line segments in the plane, J. ACM, 39, 1, 10.1145/147508.147511 Cheong, 2007, Farthest-polygon Voronoi diagrams, vol. 4698, 407 de Berg, 2000 Hershberger, 1989, Finding the upper envelope of n line segments in O(nlogn) time, Inf. Process. Lett., 33, 169, 10.1016/0020-0190(89)90136-1 Huttenlocher, 1993, The upper envelope of Voronoi surfaces and its applications, Discrete Comput. Geom., 9, 267, 10.1007/BF02189323 Klein, 1989, Concrete and Abstract Voronoi Diagrams, vol. 400 Lee, 2010, Best and worst-case coverage problems for arbitrary paths in wireless sensor networks, 127 Lee, 1980, Two-dimensional Voronoi diagrams in the Lp-metric, J. ACM, 27, 604, 10.1145/322217.322219 Mehlhorn, 2001, Furthest site abstract Voronoi diagrams, Int. J. Comput. Geom. Appl., 11, 583, 10.1142/S0218195901000663 Okabe, 2000 Preparata, 1985 Sharir, 1995 Yap, 1987, An O(nlogn) algorithm for the Voronoi diagram of a set of simple curve segments, Discrete Comput. Geom., 2, 365, 10.1007/BF02187890 Zhu, 2013, Improved algorithms for the farthest colored Voronoi diagram of segments, Theor. Comput. Sci., 497, 20, 10.1016/j.tcs.2012.06.008