说明：  一、Cantor三分集的递归算法 选取一个欧氏长度的直线段，将该线段三等分，去掉中间一段，剩下两段。将剩下的两段分别再三等分，各去掉中间一段，剩下四段。将这样的操作继续下去，直到无穷，则可得到一个离散的点集。点数趋于无穷多，而欧氏长度趋于零。经无限操作，达到极限时所得到的离散点集称之为Cantor集。
(A recursive algorithm selection Cantor ternary set a Euclidean line segment length, the three equal segments, remove the middle section, and the remaining two. The remaining two aliquots were repeated, removing the middle section of each of the remaining four. This operation will continue until infinity, you can get a discrete set of points. Points tends to infinity and more, and the Euclidean length tends to zero. After unlimited operation, discrete points obtained when reaching the limit set called the Cantor set.)