Geodesic
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

Voir la notice de l'article provenant de la source European Digital Mathematics Library

Mots-clés : computational geometry, Voronoi diagram 
@article{DCG_1987__2_131029,
     author = {C.K. Yap},
     title = {An {O(n} log n) {Algorithm} for the {Voronoi} {Diagram} of a {Set} of {Simple} {Curve} {Segments.}},
     journal = {Discrete & computational geometry},
     pages = {365--394},
     publisher = {mathdoc},
     volume = {2},
     year = {1987},
     zbl = {0628.68042},
     url = {http://geodesic.mathdoc.fr/item/DCG_1987__2_131029/}
}
TY  - JOUR
AU  - C.K. Yap
TI  - An O(n log n) Algorithm for the Voronoi Diagram of a Set of Simple Curve Segments.
JO  - Discrete & computational geometry
PY  - 1987
SP  - 365
EP  - 394
VL  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DCG_1987__2_131029/
ID  - DCG_1987__2_131029
ER  - 
%0 Journal Article
%A C.K. Yap
%T An O(n log n) Algorithm for the Voronoi Diagram of a Set of Simple Curve Segments.
%J Discrete & computational geometry
%D 1987
%P 365-394
%V 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DCG_1987__2_131029/
%F DCG_1987__2_131029
C.K. Yap. 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://geodesic.mathdoc.fr/item/DCG_1987__2_131029/