A New Algorithm for Drawing the Attractor of IFS
碩士 === 國立中正大學 === 應用數學研究所 === 87 === The classical algorithms to draw the attractor of IFS must work under trial and error or to be stopped by manual control. We develop a new algorithm to overcome such difficulity.
Main Authors: | Wen Hsing Liao, 廖文興 |
---|---|
Other Authors: | Yu Ling Lai |
Format: | Others |
Language: | en_US |
Published: |
1999
|
Online Access: | http://ndltd.ncl.edu.tw/handle/37827942723750453957 |
Similar Items
-
A class of continua that are not attractors of any IFS
by: Kulczycki Marcin, et al.
Published: (2012-12-01) -
The effect of attention attractors on object representations in children's drawing
by: Ying-Lung Lu, et al.
Published: (2008) -
Ifs, cans and ordinary language
by: Leeper, Robert A.
Published: (1972) -
Bayesian reasoning with ifs and ands and ors
by: Nicole eCruz, et al.
Published: (2015-02-01) -
Characterisation of the S. Typhimurium σE regulon
by: Rowley, Gary
Published: (2005)