Geodesic
Polygon Triangulation in O(n log log n) Time with Simple Data Structures.
Discrete & computational geometry, Tome 7 (1992) no. 4, pp. 329-346 Cet article a éte moissonné depuis la source European Digital Mathematics Library

Voir la notice de l'article

Mots-clés : triangulation, simple polygon, horizontal visibility 
@article{DCG_1992__7_4_131199,
     author = {D.G. Kirkpatrick and M.M. Klawe and R.E. Tarjan},
     title = {Polygon {Triangulation} in {O(n} log log n) {Time} with {Simple} {Data} {Structures.}},
     journal = {Discrete & computational geometry},
     pages = {329--346},
     year = {1992},
     volume = {7},
     number = {4},
     zbl = {0753.68092},
     url = {http://geodesic.mathdoc.fr/item/DCG_1992__7_4_131199/}
}
TY  - JOUR
AU  - D.G. Kirkpatrick
AU  - M.M. Klawe
AU  - R.E. Tarjan
TI  - Polygon Triangulation in O(n log log n) Time with Simple Data Structures.
JO  - Discrete & computational geometry
PY  - 1992
SP  - 329
EP  - 346
VL  - 7
IS  - 4
UR  - http://geodesic.mathdoc.fr/item/DCG_1992__7_4_131199/
ID  - DCG_1992__7_4_131199
ER  - 
%0 Journal Article
%A D.G. Kirkpatrick
%A M.M. Klawe
%A R.E. Tarjan
%T Polygon Triangulation in O(n log log n) Time with Simple Data Structures.
%J Discrete & computational geometry
%D 1992
%P 329-346
%V 7
%N 4
%U http://geodesic.mathdoc.fr/item/DCG_1992__7_4_131199/
%F DCG_1992__7_4_131199
D.G. Kirkpatrick; M.M. Klawe; R.E. Tarjan. Polygon Triangulation in O(n log log n) Time with Simple Data Structures.. Discrete & computational geometry, Tome 7 (1992) no. 4, pp. 329-346. http://geodesic.mathdoc.fr/item/DCG_1992__7_4_131199/