The upper bound theorem for polytopes: an easy proof of its asymptotic version

Updating and constructing constrained delaunay and constrained regular triangulations by flips

Proceedings of the nineteenth annual symposium on Computational geometry

Ready, set, go! the Voronoi diagram of moving points that start from a line

Information Processing Letters

Voronoi diagrams of moving points in the plane and of lines in space: tight bounds for simple configurations

Information Processing Letters

Voronoi diagrams of moving points in the plane and of lines in space: tight bounds for simple configurations

Information Processing Letters

Bounds on the complexity of halfspace intersections when the bounded faces have small dimension

Proceedings of the twenty-seventh annual symposium on Computational geometry