On the complexity of umbra and penumbra
J. Demouth, O. Devillers, H. Everett, M. Glisse, S. Lazard and R. Seidel
Computational Geometry, Vol 42, No 8, 2009, pp. 758-771.
Also in, Proc. 23th ACM Symp. on Comp. Geom., 2007, pp. 265-274.

A Tight Bound for the Delaunay Triangulation of Points on a Polyhedron
N. Amenta, D. Attali and O. Devillers
INRIA Research Report 6522, 2008.

Preciates for line transversals to lines and line segments in three-dimensional space
O. Devillers, M. Glisse and S. Lazard
Proc. 24th ACM Symp. of Comp. Geom., 2008, pp. 174-181.

Complexity of Delaunay triangulation for points on lower-dimensional polyhedra
N. Amenta, D. Attali and O. Devillers
Proc. 18th ACM-SIAM Sympos. Discrete Algorithms, 2007, pp. 1106-1113.

Lines tangent to four triangles in three-dimensional space
H. Bronnimann, O. Devillers, S. Lazard and F. Sottile
Discrete and Computational Geometry, Vol 37, 2007, pp. 369-380.
Also in, Proc. 10th Canad. Conf. Comput. Geom., 2004.

Lines and free line segments tangent to arbitrary three-dimensional convex polyhedra
H. Bronnimann, O. Devillers, V. Dujmovic, H. Everett, M. Glisse, X. Goaoc, S. Lazard, H.-S.Na and S. Whitesides
SIAM Journal on Computing, Vol 37, No 2, 2007, pp. 522-551.
Also in, Proc. 20th ACM Symp.on Comp. Geom, 2004, pp. 46-59.

Maintaining visibility information of planar point sets with a moving viewpoint
O. Devillers, V. Dujmovic, H. Everett, S. Hornus, S.Whitesides and S. Wismath
Internat. J. Comput. Geom. Appl., Vol 17, No 4, 2005, pp. 297-304.
Also in, Proc. 17th Canad. Conf. Comput. Geom., 2005, 302-305.

The expected number of 3D visibility events is linear
O. Devillers, V. Dujmovic, H. Everett, M. Glisse, X. Goaoc, S. Lazard, H.-S.Na and S.Petitjean
SIAM Journal on Computing, Vol 32, No 6, 2003, pp. 1586-1620.

On the number of lines tangent to four convex polyhedra
H. Bronnimann, O. Devillers, V. Dujmovic, H. Everett, M. Glisse, X. Goaoc, S. Lazard, H.-S.Na and S. Whitesides
Proc. 8th Canad. Conf. Comput. Geom., 2002, pp 113-117.