An algorithm to construct greedy drawings of triangulations.

Angelini, Patrizio; Frati, Fabrizio; Grilli, Luca

Journal of Graph Algorithms and Applications (2010)

  • Volume: 14, Issue: 1, page 19-51
  • ISSN: 1526-1719

How to cite

top

Angelini, Patrizio, Frati, Fabrizio, and Grilli, Luca. "An algorithm to construct greedy drawings of triangulations.." Journal of Graph Algorithms and Applications 14.1 (2010): 19-51. <http://eudml.org/doc/225320>.

@article{Angelini2010,
author = {Angelini, Patrizio, Frati, Fabrizio, Grilli, Luca},
journal = {Journal of Graph Algorithms and Applications},
language = {eng},
number = {1},
pages = {19-51},
publisher = {Brown University, Providence, RI; University of Texas, Dallas},
title = {An algorithm to construct greedy drawings of triangulations.},
url = {http://eudml.org/doc/225320},
volume = {14},
year = {2010},
}

TY - JOUR
AU - Angelini, Patrizio
AU - Frati, Fabrizio
AU - Grilli, Luca
TI - An algorithm to construct greedy drawings of triangulations.
JO - Journal of Graph Algorithms and Applications
PY - 2010
PB - Brown University, Providence, RI; University of Texas, Dallas
VL - 14
IS - 1
SP - 19
EP - 51
LA - eng
UR - http://eudml.org/doc/225320
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.