Finding Shortest Paths With Computational Geometry
Journal of Graph Algorithms and Applications, Tome 7 (2003) no. 3, pp. 287-303.

Voir la notice de l'article provenant de la source Journal of Graph Algorythms and Applications website

We present a heuristic search algorithm for the Rd Manhattan shortest path problem that achieves front-to-front bidirectionality in subquadratic time. In the study of bidirectional search algorithms, front-to-front heuristic computations were thought to be prohibitively expensive (at least quadratic time complexity); our algorithm runs in O(n logd n) time and O(n logd−1 n) space, where n is the number of visited vertices. We achieve this result by embedding the problem in Rd+1 and identifying heuristic calculations as instances of a dynamic closest-point problem, to which we then apply methods from computational geometry.
@article{JGAA_2003_7_3_a2,
     author = {Po-Shen Loh},
     title = {Finding {Shortest} {Paths} {With} {Computational} {Geometry}},
     journal = {Journal of Graph Algorithms and Applications},
     pages = {287--303},
     publisher = {mathdoc},
     volume = {7},
     number = {3},
     year = {2003},
     doi = {10.7155/jgaa.00071},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00071/}
}
TY  - JOUR
AU  - Po-Shen Loh
TI  - Finding Shortest Paths With Computational Geometry
JO  - Journal of Graph Algorithms and Applications
PY  - 2003
SP  - 287
EP  - 303
VL  - 7
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00071/
DO  - 10.7155/jgaa.00071
LA  - en
ID  - JGAA_2003_7_3_a2
ER  - 
%0 Journal Article
%A Po-Shen Loh
%T Finding Shortest Paths With Computational Geometry
%J Journal of Graph Algorithms and Applications
%D 2003
%P 287-303
%V 7
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00071/
%R 10.7155/jgaa.00071
%G en
%F JGAA_2003_7_3_a2
Po-Shen Loh. Finding Shortest Paths With Computational Geometry. Journal of Graph Algorithms and Applications, Tome 7 (2003) no. 3, pp. 287-303. doi : 10.7155/jgaa.00071. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00071/

Cité par Sources :