Christian Icking, Lihong Ma
A tight bound for the complexity of voroni diagrams under polyhedral convex distance functions in 3D
STOC, 2001.
@inproceedings{STOC-2001-IckingM, author = "Christian Icking and Lihong Ma", booktitle = "{Proceedings of the 33rd Annual ACM Symposium on Theory of Computing}", doi = "10.1145/380752.380815", isbn = "1-58113-349-9", pages = "316--321", publisher = "{ACM}", title = "{A tight bound for the complexity of voroni diagrams under polyhedral convex distance functions in 3D}", year = 2001, }