. Din, The Voronoi diagram of three lines in R 3, SoCG'07, pp.255-264, 2007.

M. Karavelas, A robust and efficient implementation for the segment voronoi diagram, Proc. Internat. Symp. on Voronoi diagrams in Science and Engineering, pp.51-62, 2004.

M. I. Karavelas, A robust and efficient implementation for the segment Voronoi diagram, International Symposium on Voronoi Diagrams in Science and Engineering, pp.51-62, 2004.

V. Koltun and M. Sharir, Three dimensional euclidean Voronoi diagrams of lines with a fixed number of orientations, Proceedings of the eighteenth annual symposium on Computational geometry , SCG '02, pp.616-642, 2003.
DOI : 10.1145/513400.513427

V. J. Milenkovic, Robust construction of the Voronoi diagram of a polyhedron, CCCG'93, pp.473-478, 1993.

B. Mourrain, J. Técourt, and M. Teillaud, On the computation of an arrangement of quadrics in 3D, Computational Geometry, vol.30, issue.2, pp.145-164, 2005.
DOI : 10.1016/j.comgeo.2004.05.003
URL : https://hal.archives-ouvertes.fr/inria-00350858

E. Schömer and N. Wolpert, An exact and efficient approach for computing a cell in an arrangement of quadrics, Computational Geometry, vol.33, issue.1-2, pp.65-97, 2006.
DOI : 10.1016/j.comgeo.2004.02.007

M. Sharir, Almost tight upper bounds for lower envelopes in higher dimensions, pp.327-345, 1994.