Name
Abstract | ||
|---|---|---|
We consider the farthest-neighbor Voronoi diagram of a set of line segments in three dimensions. To understand the structure of the diagram, we define the ``farthest hull'' of the segments and investigate it by its representation in a Gaussian map. We then provide lower and upper bounds on the worst-case complexities of the farthest hull and of the Voronoi diagram. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/ISVD.2013.15 | ISVD |
Keywords | Field | DocType |
farthest-neighbor voronoi diagram,worst-case complexity,line segment,farthest hull,gaussian map,upper bound,voronoi diagram,computer science,gaussian processes,computational geometry | Line segment,Power diagram,Combinatorics,Computational geometry,Diagram,Cluster diagram,Gaussian,Weighted Voronoi diagram,Voronoi diagram,Mathematics | Conference |
Citations | PageRank | References |
0 | 0.34 | 9 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gill Barequet | 1 | 809 | 86.97 |
| Evanthia Papadopoulou | 2 | 110 | 18.37 |