Active search circle algorithm of isoline model based on balanced binary tree
Wang Sheguo · Journal of Liaoning Technical University · 2003
A major problem ,which digital isoline model algorithm is faced with is to speed up calculation. With the increase of sampling point quantity, it takes much time to pick up sample points for a interpolation. This paper discusses about how to improve the traditional digitalisoline model algorithm with balanced binary tree , and design a new algorithm ,which gives a formalization description. Based on the new algorithm, corresponding program is given also and used in practice. The new algorithm is helpful to advance the velocity of constructing digital isoline model, particularly with the increase of point quantity , which is more efficient.