一种基于可控随机变换的分形树生成算法

Lin Jiang, Xianchun Guo, Ling Lu
{"title":"一种基于可控随机变换的分形树生成算法","authors":"Lin Jiang, Xianchun Guo, Ling Lu","doi":"10.1109/ICCMS.2009.14","DOIUrl":null,"url":null,"abstract":"An algorithm of fractal tree is hot research area in nature scenery simulation. We present a generate algorithm of fractal tree by use a controllable random transform method. This method base on fractal theory, controls some parameters of fractal tree generating in a random scope, which parameters including coordinates, length of tree branch, angle of tree branch transfer, thickness of trunk, color of render. Experiment show fractal tree rendered has a third dimension, although our render method is planar. Our algorithm guarantees the worst-case cost of O(B*level) for rendering a fractal tree, where B is numbers of tree branch and level is numbers of node on each branch.","PeriodicalId":325964,"journal":{"name":"2009 International Conference on Computer Modeling and Simulation","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"An Algorithm of Fractal Tree Generate Base on Controllable Random Transform\",\"authors\":\"Lin Jiang, Xianchun Guo, Ling Lu\",\"doi\":\"10.1109/ICCMS.2009.14\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An algorithm of fractal tree is hot research area in nature scenery simulation. We present a generate algorithm of fractal tree by use a controllable random transform method. This method base on fractal theory, controls some parameters of fractal tree generating in a random scope, which parameters including coordinates, length of tree branch, angle of tree branch transfer, thickness of trunk, color of render. Experiment show fractal tree rendered has a third dimension, although our render method is planar. Our algorithm guarantees the worst-case cost of O(B*level) for rendering a fractal tree, where B is numbers of tree branch and level is numbers of node on each branch.\",\"PeriodicalId\":325964,\"journal\":{\"name\":\"2009 International Conference on Computer Modeling and Simulation\",\"volume\":\"30 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-02-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 International Conference on Computer Modeling and Simulation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCMS.2009.14\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference on Computer Modeling and Simulation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCMS.2009.14","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

分形树算法是自然景物模拟中的研究热点。提出了一种利用可控随机变换方法生成分形树的算法。该方法基于分形理论,在随机范围内控制分形树生成的一些参数,包括坐标、树枝的长度、树枝转移的角度、树干的厚度、渲染的颜色。实验表明,尽管我们的渲染方法是平面的,但分形树的渲染具有三维性。我们的算法保证了绘制分形树的最坏情况成本为O(B*level),其中B为树分支的数量,level为每个分支上的节点数量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Algorithm of Fractal Tree Generate Base on Controllable Random Transform
An algorithm of fractal tree is hot research area in nature scenery simulation. We present a generate algorithm of fractal tree by use a controllable random transform method. This method base on fractal theory, controls some parameters of fractal tree generating in a random scope, which parameters including coordinates, length of tree branch, angle of tree branch transfer, thickness of trunk, color of render. Experiment show fractal tree rendered has a third dimension, although our render method is planar. Our algorithm guarantees the worst-case cost of O(B*level) for rendering a fractal tree, where B is numbers of tree branch and level is numbers of node on each branch.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信