Description: 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.
To Search:
File list (Check if you may need any files):
新建文件夹\cantor.m
..........\Koch.m
新建文件夹
Download