Finding shortest paths with computational geometry.
Loh, Po-Shen
Journal of Graph Algorithms and Applications, Tome 7 (2003), p. 287-303 / Harvested from The Electronic Library of Mathematics
Access to full text
Full (PDF)
Publié le : 2003-01-01
EUDML-ID : urn:eudml:doc:51534 
@article{02171538,
     title = {Finding shortest paths with computational geometry.},
     journal = {Journal of Graph Algorithms and Applications},
     volume = {7},
     year = {2003},
     pages = {287-303},
     zbl = {1068.68105},
     language = {en},
     url = {http://dml.mathdoc.fr/item/02171538}
}

Loh, Po-Shen. Finding shortest paths with computational geometry.. Journal of Graph Algorithms and Applications, Tome 7 (2003) pp. 287-303. http://gdmltest.u-ga.fr/item/02171538/