Tight Bound for Farthest-Color Voronoi Diagrams of Line Segments

2012 ◽  
pp. 40-51 ◽  
Author(s):  
Sang Won Bae
Keyword(s):  
Voronoi Diagrams ◽  
Tight Bound ◽  
Line Segments

Dynamic Construction of Voronoi Diagram for a Set of Points and Straight Line Segments

2014 ◽  
Vol 533 ◽  
pp. 264-267
Author(s):  
Xin Liu
Keyword(s):  
Production Process ◽  
Voronoi Diagram ◽  
Voronoi Diagrams ◽  
High Potential ◽  
Line Segments ◽  
Potential Value ◽  
Straight Line ◽  
Traditional Algorithm ◽  
Set Of Points

Voronoi Diagram for a set of points and straight line segments is difficult to construct because general figures have uncertain shapes[. In traditional algorithm, when generator of general figure changes, production process will be extremely complex because of the change of regions neighboring with those generator changed. In this paper, we use dynamicconstruction of Voronoi diagrams. The algorithm can get over all kinds of shortcomings that we have just mentioned. So it is more useful and effective than the traditional algorithm[2]. The results show that the algorithm is both simple and useful, and it is of high potential value in practice.

Sign in / Sign up

Export Citation Format

Share Document