{"title":"Fast Tree Ambient Occlusion Approximation","authors":"J. Teng, Bao Hu, M. Jaeger","doi":"10.1109/PMA.2006.58","DOIUrl":null,"url":null,"abstract":"We present a fast ambient occlusion approximation algorithm for real-time tree rendering. The main contribution of the proposed method concerns the preprocessing stage of ambient occlusion. The proposed method is a divide- and-conquer calculation framework with limited user intervention. The proposed approach splits the plant geometry into clusters. On each plant primitive, ambiant occlusion approximation is then defined from statistical inner cluster properties and a fast outer cluster occlusion. The implementation achieves flexible ambient occlusion effects with linear complexity.","PeriodicalId":315124,"journal":{"name":"2006 Second International Symposium on Plant Growth Modeling and Applications","volume":"360 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 Second International Symposium on Plant Growth Modeling and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PMA.2006.58","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
We present a fast ambient occlusion approximation algorithm for real-time tree rendering. The main contribution of the proposed method concerns the preprocessing stage of ambient occlusion. The proposed method is a divide- and-conquer calculation framework with limited user intervention. The proposed approach splits the plant geometry into clusters. On each plant primitive, ambiant occlusion approximation is then defined from statistical inner cluster properties and a fast outer cluster occlusion. The implementation achieves flexible ambient occlusion effects with linear complexity.