We consider the Euclidean Voronoi diagram for a set of n parallel halflines in 3-space. A relation of this diagram to planar power diagrams is shown, and is used to analyze its geometric and topological properties. Moreover, a simple plane-sweep algorithm is given that computes the Voronoi diagram for parallel halflines at logarithmic cost per face.
|Title of host publication||Proc. 32nd European Workshop on Computational Geometry (EuroCG 2016)|
|Place of Publication||Lugano, Switzerland|
|Publication status||Published - 2016|
|Event||EuroCG 2016: 32nd European Workshop on Computational Geometry - Lugano, Switzerland|
Duration: 29 Mar 2016 → 1 Apr 2016
|Abbreviated title||EuroCG 2016|
|Period||29/03/16 → 1/04/16|