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

L. Paul Chew, Klara Kedem, Micha Sharir, Boaz Tagansky, Emo Welzin

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

15 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publicationProceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995
PublisherAssociation for Computing Machinery
Pages197-204
Number of pages8
ISBN (Electronic)0898713498
StatePublished - 22 Jan 1995
Event6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995 - San Francisco, United States
Duration: 22 Jan 199524 Jan 1995

Publication series

NameProceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Conference

Conference6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995
Country/TerritoryUnited States
CitySan Francisco
Period22/01/9524/01/95

Fingerprint

Dive into the research topics of 'Voronoi diagrams of lines in 3-space under polyhedral convex distance functions'. Together they form a unique fingerprint.

Cite this