经典分形集测度上估的计算机搜索Ⅰ──对典型例子Sierpinski垫片编码技术的剖析  

COMPUTER SEARCH FOR THE UPPER ESTIMATION OF HAUSDORFF MEASURE OF CLASSICAL FRACTAL SETS I─ANALYSIS OF CODING TECHNIQUE FOR SIERPINSKI GASKET AS A TYPICAL EXAMPLE

作　　者：王何宇[1] 

机构地区：[1]杭州大学计算机基础教学部

出　　处：《计算数学》1999年第1期109-116,共8页Mathematica Numerica Sinica

摘　　要：The upper estimation of Hausdorff measure for Sierpinski gasket has beengreatly hoprovd in Refs. [1, 2]. As the basis of these two works, the codingteclmique of the upper estimation seardsng for regular fractal sets on computerdiscusses thoroughly in this paper through a troical example of Sierpinski gasket.The upper estimation of Hausdorff measure for Sierpinski gasket has beengreatly hoprovd in Refs. [1, 2]. As the basis of these two works, the codingteclmique of the upper estimation seardsng for regular fractal sets on computerdiscusses thoroughly in this paper through a troical example of Sierpinski gasket.

关 键 词：分形集 计算机搜索 编码 测度 SIERPINSKI垫片 

分 类 号：O18[理学—数学] O24[理学—基础数学]