A tight bound for the complexity of voroni diagrams under polyhedral convex distance functions in 3D
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A lower bound on Voronoi diagram complexity
Information Processing Letters
Recent Developments in the Theory of Arrangements of Surfaces
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Hi-index | 0.00 |