A Sweepline Algorithm for Higher Order Voronoi Diagrams

Maksym Zavershynskyi,Evanthia Papadopoulou

Voronoi Diagrams in Science and Engineering（2013）

引用 8|浏览0

暂无评分

摘要

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(nk^2 log n) time complexity and O(nk) space complexity.

查看译文

关键词

sweepline algorithm,line segment,higher order voronoi diagrams,sweepline technique,log n,order-k voronoi diagram,time complexity,space complexity,informatics,line segments,voronoi diagrams,euclidean distance,computational complexity,computational geometry

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要