本程序实现的是二维图形的限定Delaunay的三角剖分，算法的主要思想是采用微分方程数值解法中的有限元方法对二值图像进行三角剖分，程序为二维图像重建提供一个有利的基础。-this program is limited to the two-dimensional graphics Delaunay triangulation. The main idea of this algorithm is the numerical solution of differential equations b

A.Said和W.A. pearlman根据Shapiro零树编码的基本思想,提出了一种新的且更优的实现方法--分层树集合分割(SPIHT),它是高效性能编码算法.这里给出了SPIHT程序及其改进后的程序.-A. Said and WA pearlman Shapiro zerotree coding based on the basic idea, a new and more excellent implementations- set partitioning in hierarchi

基于上述原子搜索原理，提出一个简单的想法，采用“大步长快速接近、小步长逐步逼近”的策略来重构信号，对FBP算法进行改进，即改变其前向步长和后向步长-Based on the above search atomic theory, put forward a simple idea, a "big long fast approaching, gradually approaching small step" strategy to reconstruct the signal, FBP algo