TY - GEN

T1 - Voronoi diagrams of lines in 3-space under polyhedral convex distance functions

AU - Chew, L. Paul

AU - Kedem, Klara

AU - Sharir, Micha

AU - Tagansky, Boaz

AU - Welzin, Emo

N1 - Funding Information:
*Work by Paul Chew and Klara Kedem has been supported by AFOSR Grant AFOSR-91-0328. Work by Paul Chew has also been supported by ONR Grant N00014-89-J-1946 and ARPA under ONR contract N00014-88-K-0591. Work by Micha Sharir and Emo Welzl has been supported by the G.I.F. - the German Israeli Foundation for Scientific Research and Development, and by a Max Planck Research Award. Work by Micha Sharir has also been supported by National Science Foundation Grant CCR-91-22103, and by grants from the U.S.-Israeli Binational Science Foundation, and the Israel Science Fund administered by the Israeli Academy of Sciences. Work by Emo Welzl has also been supported by the EC Basic Research Action, Project ALCOM II.

PY - 1995/1/22

Y1 - 1995/1/22

N2 - The combinatorial complexity of the Voronoi diagram of n lines in three dimensions under a polyhedral convex distance function is shown to be O(n2α(n)logn), where α(n) is a slowly growing inverse of the Ackermann function. The constant of proportionality depends on the number of faces of the polytope inducing the distance function.

AB - The combinatorial complexity of the Voronoi diagram of n lines in three dimensions under a polyhedral convex distance function is shown to be O(n2α(n)logn), where α(n) is a slowly growing inverse of the Ackermann function. The constant of proportionality depends on the number of faces of the polytope inducing the distance function.

UR - http://www.scopus.com/inward/record.url?scp=0040223812&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0040223812

T3 - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

SP - 197

EP - 204

BT - Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995

PB - Association for Computing Machinery

T2 - 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995

Y2 - 22 January 1995 through 24 January 1995

ER -