Nonuniform SINR+Voroni Diagrams Are Effectively Uniform

Lecture Notes in Computer Science - Distributed Computing ◽

10.1007/978-3-662-48653-5_39 ◽

2015 ◽

pp. 588-601 ◽

Author(s):

Erez Kantor ◽

Zvi Lotker ◽

Merav Parter ◽

David Peleg

Keyword(s):

Voroni Diagrams

Download Full-text

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

Proceedings of the thirty-third annual ACM symposium on Theory of computing - STOC '01 ◽

10.1145/380752.380815 ◽

2001 ◽

Author(s):

Christian Icking ◽

Lihong Ha

Keyword(s):

Distance Functions ◽

Tight Bound ◽

Polyhedral Convex ◽

Convex Distance Functions ◽

Voroni Diagrams

Download Full-text