A tight bound for the complexity of voroni diagrams under polyhedral convex distance functions in 3D.

Christian Icking, Lihong Ma

Browse the full STOC paper archive.