Stem voroni$ (all stems)
1 papers:
STOC-2001-IckingM #3d #bound #complexity #diagrams #distance- A tight bound for the complexity of voroni diagrams under polyhedral convex distance functions in 3D (CI, LM), pp. 316–321.
STOC-2001-IckingM #3d #bound #complexity #diagrams #distance