Title :
On the Farthest-Neighbor Voronoi Diagram of Segments in Three Dimensions
Author :
Barequet, Gill ; Papadopoulou, E.
Author_Institution :
Dept. of Comput. Sci., Technion - Israel Inst. of Technol., Haifa, Israel
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.
Keywords :
Gaussian processes; computational geometry; Gaussian map; diagram structure; farthest-neighbor Voronoi diagram; line segments set; Complexity theory; Computational geometry; Computer science; Electronic mail; Joining processes; Upper bound; Gaussian m farthest hull; Davenport-Schinzel theory; upper envelope.;
Conference_Titel :
Voronoi Diagrams in Science and Engineering (ISVD), 2013 10th International Symposium on
Conference_Location :
St Petersburg
DOI :
10.1109/ISVD.2013.15
