An O(n log n) Algorithm for the Voronoi Diagram of a Set of Simple Curve Segments.
Discrete & computational geometry (1987)
- Volume: 2, page 365-394
- ISSN: 0179-5376; 1432-0444/e
Access Full Article
topHow to cite
topYap, C.K.. "An O(n log n) Algorithm for the Voronoi Diagram of a Set of Simple Curve Segments.." Discrete & computational geometry 2 (1987): 365-394. <http://eudml.org/doc/131029>.
@article{Yap1987,
author = {Yap, C.K.},
journal = {Discrete & computational geometry},
keywords = {computational geometry; Voronoi diagram},
pages = {365-394},
title = {An O(n log n) Algorithm for the Voronoi Diagram of a Set of Simple Curve Segments.},
url = {http://eudml.org/doc/131029},
volume = {2},
year = {1987},
}
TY - JOUR
AU - Yap, C.K.
TI - An O(n log n) Algorithm for the Voronoi Diagram of a Set of Simple Curve Segments.
JO - Discrete & computational geometry
PY - 1987
VL - 2
SP - 365
EP - 394
KW - computational geometry; Voronoi diagram
UR - http://eudml.org/doc/131029
ER -
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.