{"title":"利用层次可视性算法的时空一致性","authors":"Jiří Bittner, V. Havran","doi":"10.1109/SCCG.2001.945350","DOIUrl":null,"url":null,"abstract":"Presents a series of simple improvements that make use of temporal and spatial coherence in the scope of hierarchical visibility algorithms. The hierarchy updating avoids visibility tests of certain interior nodes of the hierarchy. The visibility propagation algorithm reuses information about visibility of neighbouring spatial regions. Finally, the conservative hierarchy updating avoids visibility tests of the hierarchy nodes that are expected to remain visible. We evaluate the presented methods in the context of hierarchical visibility culling using occlusion trees.","PeriodicalId":331436,"journal":{"name":"Proceedings Spring Conference on Computer Graphics","volume":"80 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Exploiting temporal and spatial coherence in hierarchical visibility algorithms\",\"authors\":\"Jiří Bittner, V. Havran\",\"doi\":\"10.1109/SCCG.2001.945350\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Presents a series of simple improvements that make use of temporal and spatial coherence in the scope of hierarchical visibility algorithms. The hierarchy updating avoids visibility tests of certain interior nodes of the hierarchy. The visibility propagation algorithm reuses information about visibility of neighbouring spatial regions. Finally, the conservative hierarchy updating avoids visibility tests of the hierarchy nodes that are expected to remain visible. We evaluate the presented methods in the context of hierarchical visibility culling using occlusion trees.\",\"PeriodicalId\":331436,\"journal\":{\"name\":\"Proceedings Spring Conference on Computer Graphics\",\"volume\":\"80 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-04-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Spring Conference on Computer Graphics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SCCG.2001.945350\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Spring Conference on Computer Graphics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCCG.2001.945350","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Exploiting temporal and spatial coherence in hierarchical visibility algorithms
Presents a series of simple improvements that make use of temporal and spatial coherence in the scope of hierarchical visibility algorithms. The hierarchy updating avoids visibility tests of certain interior nodes of the hierarchy. The visibility propagation algorithm reuses information about visibility of neighbouring spatial regions. Finally, the conservative hierarchy updating avoids visibility tests of the hierarchy nodes that are expected to remain visible. We evaluate the presented methods in the context of hierarchical visibility culling using occlusion trees.