Kenneth L. Clarkson

• Combinatorial complexity bounds for arrangements of curves and surfaces
• Randomized parallel algorithms for trapezoidal diagrams