Triangle Interpolation on Discrete Point Set

Abstract:

An algorithm for triangle interpolation on discrete points is presented in the paper. It creates a square mesh which covers all the discrete points, then puts the points into the mesh and records the relationship between grids and points. When interpolating elevation of an interpolation point, it can fast find the discrete points which are near the interpolation point and these discrete points can be used to create a special triangle which contains the interpolation point. The elevation of the interpolation point can be obtained from the triangle. The method has the advantage of fast speed, high precision and needing less memory.

• Periodical: Applied Mechanics and Materials (Volumes 580-583)
• Pages: 2872-2875
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.580-583.2872
• Online since: July 2014
• Authors: Hong Fei Jiang
• Keywords: Cone, Discrete Points, Interpolation, Mesh, Triangle

References

[1] Janos Kalmar. DEM-Based Surface and Volume Approximation—Geographical Applications. Computer&Geosciences, Vol. 21(1995), pp.147-163.

[2] Tsai V.J.D. Delaunay Triangulations in TIN Creation: An Overview and a Linear-time Algorithm. Int. J. of GIS, Vol. 7(1993), pp.501-524.

DOI: 10.1080/02693799308901979

[3] George Nagy, Sharad Wagle. Geographic Data Processing, Computing Surveys. Vol. 11(1979), pp.139-181.

DOI: 10.1145/356770.356777

[4] Wang Yongming, Lin Xinggan. A Fast Algorithm for Generating DEM. Computer Application and Software. Vol. 15(1998), pp.28-33.

[5] Xue Jiaqing. The Principle and Algorithm of Optimization. Beijing: Metallurgy Industry Publishing Company. (1983).