Grid sequence algorithm generating contour based on delaunay triangulation

In order to improve the contour generation rate in drawing contour maps of rainfall of Tianjin, we propose a contour generation algorithm based on grid sequence, which according to the characteristics of historical data in meteorological field and the contours drawing requirements. Using this algorithm can make the drawing method efficient and intuitive. This algorithm based on Delaunay irregular triangulation using a new method to compare the grid endpoints with itself before with contour values. So it avoids the problem of selecting a starting point, simplifies the determination of grid export, and effectively reduces the frequency of comparing the contours value and endpoint. This clear, concise algorithm is suitable for contour expressing in meteorological field and other scientific data generation in similar circumstances.

[1]  Abbas Yongaçoglu,et al.  A comparison of interference cartography generation techniques in cognitive radio networks , 2012, 2012 IEEE International Conference on Communications (ICC).

[2]  M. Corsini,et al.  The active fault system of SW Alps , 2010 .

[3]  Albert Y. Zomaya,et al.  Midpoint routing algorithms for Delaunay triangulations , 2010, 2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS).

[4]  Chen He-ping Research and application of constrained Delaunay triangulation generation algorithm , 2012 .

[5]  Natan Rubin,et al.  On Topological Changes in the Delaunay Triangulation of Moving Points , 2012, SoCG '12.

[6]  Jean-Marc Chassery,et al.  The Delaunay constrained triangulation: the Delaunay stable algorithms , 1999, 1999 IEEE International Conference on Information Visualization (Cat. No. PR00210).

[7]  Ge Xia Improved upper bound on the stretch factor of delaunay triangulations , 2011, SoCG '11.

[8]  Joshua A. Levine,et al.  Delaunay meshing of isosurfaces , 2007, IEEE International Conference on Shape Modeling and Applications 2007 (SMI '07).