By Topic

Shortest path algorithm in GIS network analysis based on Clifford algebra

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Jiyi Zhang ; Key Lab. of VGE, Nanjing Normal Univ., Nanjing, China ; Wen Luo ; Linwang Yuan ; Weichang Mei

Based on Clifford algebra, a shortest path analysis algorithm is proposed in this paper. Dimensions free distance and intersection operators are defined in a homogeneous space. By using these operators, we extract the adjacency matrix automatically from geographical network data. Locally dynamical layer separation and shortest path query mechanism are constructed based on the outer product. The experiment on China National Highway Road data suggests that the algorithm is comparable in both result and computational performance, and with the potentiality to extend to higher dimensions.

Published in:

Future Computer and Communication (ICFCC), 2010 2nd International Conference on  (Volume:1 )

Date of Conference:

21-24 May 2010