等值点链簇的一次性跟踪算法
An Alogorithm for Tracing a Family of Contour Ponit Chains “Block by Block”
-
摘要: 与传统的逐条跟踪法不同,本文提出一种逐决跟踪法,并设计出相应的数据结构,在计算机上实现等值点链簇的一次性跟踪。它不仅提高了跟踪效率(簇中,等值点链的条数越多,则效率提高越多),而且,为在等值点链簇上的各种进一步操作提供很大的方便。Abstract: In this paper, an algorithm for tracing a famfly of contour point chains, ‘block by block' rather than ‘stripe by stripe', is proposed and the data structure and the flow chart of the algorithm are pres ented in detail .The algorithm is implemented in Pascal. It not only raises the efficiency of the tracing considerably but abo facilitates further operations on the contour point chains very much.
下载: