Title :
A Sweepline Algorithm for Higher Order Voronoi Diagrams
Author :
Zavershynskyi, Maksym ; Papadopoulou, E.
Author_Institution :
Fac. of Inf., Univ. della Svizzera Italiana, Lugano, Switzerland
Abstract :
We present an algorithm to construct order-k Voronoi diagrams with a sweepline technique. The sites can be points or line segments. The algorithm has O(nk2 log n) time complexity and O(nk) space complexity.
Keywords :
computational complexity; computational geometry; higher order Voronoi diagrams; order-k Voronoi diagrams; space complexity; sweepline algorithm; time complexity; Complexity theory; Electromyography; Electronic mail; Euclidean distance; Informatics; Standards; Voronoi diagrams; computational geometry; line segments; sweep;
Conference_Titel :
Voronoi Diagrams in Science and Engineering (ISVD), 2013 10th International Symposium on
Conference_Location :
St Petersburg
DOI :
10.1109/ISVD.2013.17
