SIG-CG: Output sensitive computation of 4-d convex hulls

I will present an algorithm of Chan, Snoeyink and Yap (95)
that constructs the convex hull of n points in 4-d space
in O((n+f)log^2 f) time where f is the size of the output.
This implies output sensitive algorithms for 3-d Voronoi
diagrams and Delaunay triangulations.