Delaunay Graphs Are Almost as Good as Complete Graphs.

D.P. Dobkin; S.J. Friedman; K.J. Supowit

Discrete & computational geometry (1990)

  • Volume: 5, Issue: 4, page 399-408
  • ISSN: 0179-5376; 1432-0444/e

How to cite

top

Dobkin, D.P., Friedman, S.J., and Supowit, K.J.. "Delaunay Graphs Are Almost as Good as Complete Graphs.." Discrete & computational geometry 5.4 (1990): 399-408. <http://eudml.org/doc/131128>.

@article{Dobkin1990,
author = {Dobkin, D.P., Friedman, S.J., Supowit, K.J.},
journal = {Discrete & computational geometry},
keywords = {Delaunay triangulation; Euclidean distance; shortest path},
number = {4},
pages = {399-408},
title = {Delaunay Graphs Are Almost as Good as Complete Graphs.},
url = {http://eudml.org/doc/131128},
volume = {5},
year = {1990},
}

TY - JOUR
AU - Dobkin, D.P.
AU - Friedman, S.J.
AU - Supowit, K.J.
TI - Delaunay Graphs Are Almost as Good as Complete Graphs.
JO - Discrete & computational geometry
PY - 1990
VL - 5
IS - 4
SP - 399
EP - 408
KW - Delaunay triangulation; Euclidean distance; shortest path
UR - http://eudml.org/doc/131128
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.