XIA Lanfang, HU Peng, HUANG Menglong. Zero Initialization of Spatial Data and Minimum Spanning Tree Algorithm in Presence of Arbitrary Obstacles[J]. Geomatics and Information Science of Wuhan University, 2009, 34(1): 60-63.
Citation:
XIA Lanfang, HU Peng, HUANG Menglong. Zero Initialization of Spatial Data and Minimum Spanning Tree Algorithm in Presence of Arbitrary Obstacles[J]. Geomatics and Information Science of Wuhan University, 2009, 34(1): 60-63.
XIA Lanfang, HU Peng, HUANG Menglong. Zero Initialization of Spatial Data and Minimum Spanning Tree Algorithm in Presence of Arbitrary Obstacles[J]. Geomatics and Information Science of Wuhan University, 2009, 34(1): 60-63.
Citation:
XIA Lanfang, HU Peng, HUANG Menglong. Zero Initialization of Spatial Data and Minimum Spanning Tree Algorithm in Presence of Arbitrary Obstacles[J]. Geomatics and Information Science of Wuhan University, 2009, 34(1): 60-63.
1School of Resource and Environments Science,Wuhan University,129 Luoyu Road,Wuhan 430079,China;2Key Laboratory of Geographic Information System,Ministry of Education,Wuhan University,129 Luoyu Road,Wuhan 430079,China;3Geomatics Center of Fujian Province,205 Hualin Road,Fuzhou 350003,China
A raster algorithm of minimum spanning tree in space with obstacles is described.Firstly,with the idea of zero initialization,location data,including entity point,obstacle point and ordinary spatial point,are initialized.Secondly,the nearest connected graph in space with obstacles,also known as the Delaunay graph,is gained by trace back algorithm on the basis of Voronoi graph.Lastly,minimum spanning tree is gained by greedy strategy according to the nearest connected graph.
DownLoad: