An O(n log n) Algorithm for the Voronoi Diagram of a Set of Simple Curve Segments.
Yap, C.K.
Discrete & computational geometry, Tome 2 (1987), p. 365-394 / Harvested from Göttinger Digitalisierungszentrum
Access to full text
Publié le : 1987-01-01
EUDML-ID : urn:eudml:doc:131029 
@article{GDZPPN000363502,
     title = {An O(n log n) Algorithm for the Voronoi Diagram of a Set of Simple Curve Segments.},
     journal = {Discrete \& computational geometry},
     volume = {2},
     year = {1987},
     pages = {365-394},
     zbl = {0628.68042},
     url = {http://dml.mathdoc.fr/item/GDZPPN000363502}
}

Yap, C.K. An O(n log n) Algorithm for the Voronoi Diagram of a Set of Simple Curve Segments.. Discrete & computational geometry, Tome 2 (1987) pp. 365-394. http://gdmltest.u-ga.fr/item/GDZPPN000363502/