Title :
Generation algorithm and application of matlab-based voronoi diagram with urban obstacles
Author :
An, Zhi Hong ; Zhang, Jian Guang
Author_Institution :
Dept. of Math. & Comput. Sci., Heng Shui Univ., Heng Shui, China
Abstract :
As to the urban Voronoi diagram based on the plane measurement, any point may freely passes in and out of the horizontal and vertical transport network, but the situation of direct transport without obstacle is relatively rare in the objective world, most of the transport networks are separated by the obstacles in various shapes, the linear obstacle is the most important one among the obstacles in various shapes, and many obstacles can be treated as approximate linear ones, so the study of the urban Voronoi diagram with linear obstacles is necessary. The Voronoi diagram processing process is the same as the matrix operation process, while with matrix as the basic data unit of MATLAB, and its expression is very similar to the form commonly used in mathematics and engineering, so to solve the problem with MATLAB is much simpler than that with the C, FORTRAN, and other languages. In this paper, the crystal 4-neighborhood generation algorithm of the urban Voronoi diagram with linear barriers is simulated with MATLAB as a tool, and it is applied to specific instances.
Keywords :
computational geometry; mathematics computing; matrix algebra; traffic engineering computing; transportation; C language; FORTRAN; Matlab based Voronoi diagram; crystal 4-neighborhood generation algorithm; generation algorithm; horizontal transport network; matrix operation process; plane measurement; urban Voronoi diagram; urban obstacles; vertical transport network; Cities and towns; Crystals; Generators; Hospitals; Image color analysis; MATLAB; Rivers; MATLAB; the urban Voronoi diagram with linear barriers; urban Voronoi diagram;
Conference_Titel :
Artificial Intelligence, Management Science and Electronic Commerce (AIMSEC), 2011 2nd International Conference on
Conference_Location :
Deng Leng
Print_ISBN :
978-1-4577-0535-9
DOI :
10.1109/AIMSEC.2011.6011191