Polygon Triangulation in O(n log log n) Time with Simple Data Structures.

D.G. Kirkpatrick; M.M. Klawe; R.E. Tarjan

Discrete & computational geometry (1992)

  • Volume: 7, Issue: 4, page 329-346
  • ISSN: 0179-5376; 1432-0444/e

How to cite

top

Kirkpatrick, D.G., Klawe, M.M., and Tarjan, R.E.. "Polygon Triangulation in O(n log log n) Time with Simple Data Structures.." Discrete & computational geometry 7.4 (1992): 329-346. <http://eudml.org/doc/131199>.

@article{Kirkpatrick1992,
author = {Kirkpatrick, D.G., Klawe, M.M., Tarjan, R.E.},
journal = {Discrete & computational geometry},
keywords = {triangulation; simple polygon; horizontal visibility},
number = {4},
pages = {329-346},
title = {Polygon Triangulation in O(n log log n) Time with Simple Data Structures.},
url = {http://eudml.org/doc/131199},
volume = {7},
year = {1992},
}

TY - JOUR
AU - Kirkpatrick, D.G.
AU - Klawe, M.M.
AU - Tarjan, R.E.
TI - Polygon Triangulation in O(n log log n) Time with Simple Data Structures.
JO - Discrete & computational geometry
PY - 1992
VL - 7
IS - 4
SP - 329
EP - 346
KW - triangulation; simple polygon; horizontal visibility
UR - http://eudml.org/doc/131199
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.