# Classes of Graphs Which Approximate the Complete Euclidean Graph.

Discrete & computational geometry (1992)

- Volume: 7, Issue: 1, page 13-28
- ISSN: 0179-5376; 1432-0444/e

## Access Full Article

top## How to cite

topKeil, J.M., and Gutwin, C.A.. "Classes of Graphs Which Approximate the Complete Euclidean Graph.." Discrete & computational geometry 7.1 (1992): 13-28. <http://eudml.org/doc/131177>.

@article{Keil1992,

author = {Keil, J.M., Gutwin, C.A.},

journal = {Discrete & computational geometry},

keywords = {euclidean graphs; approximation; Delaunay-triangulation},

number = {1},

pages = {13-28},

title = {Classes of Graphs Which Approximate the Complete Euclidean Graph.},

url = {http://eudml.org/doc/131177},

volume = {7},

year = {1992},

}

TY - JOUR

AU - Keil, J.M.

AU - Gutwin, C.A.

TI - Classes of Graphs Which Approximate the Complete Euclidean Graph.

JO - Discrete & computational geometry

PY - 1992

VL - 7

IS - 1

SP - 13

EP - 28

KW - euclidean graphs; approximation; Delaunay-triangulation

UR - http://eudml.org/doc/131177

ER -

## NotesEmbed ?

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