Title of article :
AN OPTIMAL ALGORITHM FOR EUCLIDEAN SHORTEST PATHS IN THE PLANE
Author/Authors :
HERSHBERGER، JOHN نويسنده , , SURI، SUBHASH نويسنده ,
Issue Information :
دوماهنامه با شماره پیاپی سال 1999
Pages :
-2214
From page :
2215
To page :
0
Abstract :
An associative block design is a certain balanced partition of a hypercube into smaller hypercubes. We construct such a design, thus settling the smallest open case.
Keywords :
shortest path , Euclidean distance , quadtree , planar subdivision , weighted distance , obstacle avoidance , shortest path map
Journal title :
SIAM Journal on Computing
Serial Year :
1999
Journal title :
SIAM Journal on Computing
Record number :
16646
Link To Document :
بازگشت