Polygon Triangulation in O(n log log n) Time with Simple Data Structures.
Kirkpatrick, D.G. ; Klawe, M.M. ; Tarjan, R.E.
Discrete & computational geometry, Tome 7 (1992), p. 329-346 / Harvested from Göttinger Digitalisierungszentrum
Access to full text
Publié le : 1992-01-01
EUDML-ID : urn:eudml:doc:131199 
@article{GDZPPN000365270,
     title = {Polygon Triangulation in O(n log log n) Time with Simple Data Structures.},
     journal = {Discrete \& computational geometry},
     volume = {7},
     year = {1992},
     pages = {329-346},
     zbl = {0753.68092},
     url = {http://dml.mathdoc.fr/item/GDZPPN000365270}
}

Kirkpatrick, D.G.; Klawe, M.M.; Tarjan, R.E. Polygon Triangulation in O(n log log n) Time with Simple Data Structures.. Discrete & computational geometry, Tome 7 (1992) pp. 329-346. http://gdmltest.u-ga.fr/item/GDZPPN000365270/