scholarly journals The Higher-Order Voronoi Diagram of Line Segments

Algorithmica ◽  
2014 ◽  
Vol 74 (1) ◽  
pp. 415-439 ◽  
Author(s):  
Evanthia Papadopoulou ◽  
Maksym Zavershynskyi
Algorithmica ◽  
2002 ◽  
Vol 33 (4) ◽  
pp. 436-460 ◽  
Author(s):  
S. Rajasekaran ◽  
S. Ramaswami

2014 ◽  
Vol 533 ◽  
pp. 264-267
Author(s):  
Xin Liu

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.


Algorithmica ◽  
1993 ◽  
Vol 9 (2) ◽  
pp. 128-141 ◽  
Author(s):  
Michael T. Goodrich ◽  
Colm �'D�nlaing ◽  
Chee K. Yap

2008 ◽  
Vol 18 (04) ◽  
pp. 275-294 ◽  
Author(s):  
ROBERT GÖRKE ◽  
CHAN-SU SHIN ◽  
ALEXANDER WOLFF

Given a set P of n point sites in the plane, the city Voronoi diagram subdivides the plane into the Voronoi regions of the sites, with respect to the city metric. This metric is induced by quickest paths according to the Manhattan metric and an accelerating transportation network that consists of c non-intersecting axis-parallel line segments. We describe an algorithm that constructs the city Voronoi diagram (including quickest path information) using O((c+n) polylog (c+n)) time and storage by means of a wavefront expansion. For [Formula: see text] our algorithm is faster than an algorithm by Aichholzer et al., which takes O(n log n + c2 log c) time.


Sign in / Sign up

Export Citation Format

Share Document