Name
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(nk^2 log n) time complexity and O(nk) space complexity. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/ISVD.2013.17 | Voronoi Diagrams in Science and Engineering |
Keywords | Field | DocType |
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 | Power diagram,Combinatorics,Centroidal Voronoi tessellation,Algorithm,Lloyd's algorithm,Weighted Voronoi diagram,Voronoi diagram,Fortune's algorithm,Time complexity,Sweep line algorithm,Mathematics | Conference |
Citations | PageRank | References |
4 | 0.44 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Maksym Zavershynskyi | 1 | 21 | 2.31 |
| Evanthia Papadopoulou | 2 | 110 | 18.37 |