基于距离比值的迭代分形图
DOI:
CSTR:
作者:
作者单位:

作者简介:

通讯作者:

中图分类号:

基金项目:


Iterated Fractal Based on Distance Ratio
Author:
Affiliation:

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    由于逃逸时间算法不能绘制函数收敛区域,所以现有的分形图大都存在大片的黑色区域.提出一种新的构造分形图的方法:距离比值迭代法.该方法采用两点迭代,利用其距离比值的收敛次数来绘制分形图.利用距离比值迭代法绘制了复映射zzα+c的广义M-J集并分析其构图性质.距离比值广义M-J集的内部收敛区域具有复杂的细节和自相似结构,当α>0时其外部边界与经典M-J集一致,当α<0时能够绘制出经典M-J集所没有的复杂结构.

    Abstract:

    The escape time algorithm cannot render the convergence region of mapping, so there are some black regions in escape time fractal. In this paper, a novel method is presented to construct fractal image, which is named the distance ratio iteration method. This method performs iteration on two points and render fractal image by using their distance ratio convergence times. Taking complex mapping zzα+c as example, the generalized Mandelbrot and Julia sets are constructed based on distance ratio and their visual properties are analyzed. The result fractal image has complex and self-similarity structure in inner convergence region. It is proved that the boundary of distance ratio fractal is the same as M-J set when α>0, and some visual structure of it with various exponent α are discussed. When α<0, the generalized Mandelbrot and Julia set based on distance ratio have some complex structures which M-J set does not have.

    参考文献
    相似文献
    引证文献
引用本文

张锡哲,吕天阳,王钲旋.基于距离比值的迭代分形图.软件学报,2006,17(zk):70-77

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2006-03-15
  • 最后修改日期:2006-09-11
  • 录用日期:
  • 在线发布日期:
  • 出版日期:
文章二维码
您是第位访问者
版权所有:中国科学院软件研究所 京ICP备05046678号-3
地址:北京市海淀区中关村南四街4号,邮政编码:100190
电话:010-62562563 传真:010-62562533 Email:jos@iscas.ac.cn
技术支持:北京勤云科技发展有限公司

京公网安备 11040202500063号