IFS的符号重写算法

Symbol Rewriting Algorithm of IFS

根据IFS吸引子生成的计算过程,提出了IFS的符号重写算法,使IFS与L系统建立了联系,并给出了适合该算法的符号重写系统实例.通过符号重写系统定义、IFS到该系统的转换、IFS符号重写算法描述和实例,能反映出它比常规L系统和IFS具有更强的表达能力、造型能力和直观交互性.

According to the calculating process generated by IFS attractor,the symbol rewriting algorithm of IFS is proposed. A connection between IFS and L system,is set up with the algorithmic examples of a suitable symbol rewriting system. The definition of symbol rewriting system, the conversion of IFS to the system, the descriptions and examples of IFS symbol rewriting algorithm show that it has a better capability of expression, modeling and intuitive interactivity than the conventional L system and IFS.