Login / Signup
An optimal parallel algorithm for finding shortest paths inside simple polygons.
Wei Chen
Koji Nakano
Toshimitsu Masuzawa
Yoshihiro Tsujino
Nobuki Tokura
Published in:
Systems and Computers in Japan (1993)
Keyphrases
</>
parallel algorithm
shortest path
minimum length
binary search trees
optimal path
parallel computation
shortest path algorithm
road network
shortest path problem
cluster of workstations
path length
shared memory
digital curves
data structure
optimal solution
routing algorithm
orders of magnitude
minimum cost flow