English  |  正體中文  |  简体中文  |  Items with full text/Total items : 94286/110023 (86%)
Visitors : 21693642      Online Users : 625
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    ASIA unversity > 資訊學院 > 資訊工程學系 > 會議論文 >  Item 310904400/78217


    Please use this identifier to cite or link to this item: http://asiair.asia.edu.tw/ir/handle/310904400/78217


    Title: A fast algorithm for generating fractals
    Authors: 朱學亭;Chu, Hsueh-Ting
    Contributors: 資訊工程學系
    Date: 2000.09
    Issue Date: 2013-12-26 09:54:58 (UTC+0)
    Abstract: With iterated function systems (IFS), there are two classical algorithms of generating artificial fractal pictures: the deterministic algorithm and the random iteration algorithm. The deterministic algorithm spends huge computations on checking convergence iteratively. On the other hand, the random iteration algorithm is nondeterministic and time consuming. People seldom check convergence by the algorithm. Moreover, many pixels in the picture are computed again and again by both of the algorithms. Thus a new algorithm is given. The algorithm promises convergence without iterative checks. Also, our algorithm runs faster than the existing algorithms do on a large scale
    Relation: 15th International Conference on Pattern Recognition, 2000 (ICPR2000)
    Appears in Collections:[資訊工程學系] 會議論文

    Files in This Item:

    File SizeFormat
    index.html0KbHTML313View/Open


    All items in ASIAIR are protected by copyright, with all rights reserved.


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback