Finding shortest paths with computational geometry.
Journal of Graph Algorithms and Applications (2003)
- Volume: 7, Issue: 3, page 287-303
- ISSN: 1526-1719
Access Full Article
top
How to cite
topLoh, Po-Shen. "Finding shortest paths with computational geometry.." Journal of Graph Algorithms and Applications 7.3 (2003): 287-303. <http://eudml.org/doc/51534>.
@article{Loh2003,
author = {Loh, Po-Shen},
journal = {Journal of Graph Algorithms and Applications},
keywords = {heuristic search algorithm},
language = {eng},
number = {3},
pages = {287-303},
publisher = {Brown University, Providence, RI; University of Texas, Dallas},
title = {Finding shortest paths with computational geometry.},
url = {http://eudml.org/doc/51534},
volume = {7},
year = {2003},
}
TY - JOUR
AU - Loh, Po-Shen
TI - Finding shortest paths with computational geometry.
JO - Journal of Graph Algorithms and Applications
PY - 2003
PB - Brown University, Providence, RI; University of Texas, Dallas
VL - 7
IS - 3
SP - 287
EP - 303
LA - eng
KW - heuristic search algorithm
UR - http://eudml.org/doc/51534
ER -
NotesEmbed ?
topYou 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.