Jae-Ho Nah, Jeong-Soo Park, Jin-woo Kim, Chanmin Park, T. Han
{"title":"光线追踪的有序深度优先布局","authors":"Jae-Ho Nah, Jeong-Soo Park, Jin-woo Kim, Chanmin Park, T. Han","doi":"10.1145/1899950.1900005","DOIUrl":null,"url":null,"abstract":"We present an ordered depth-first tree layout for ray tracing. Among two child nodes, a child node with the larger surface area is stored next to its parent node. Hence, the probabilities that a ray accesses to the same cache line increase. Our approach can be easily and widely used for various ray tracing systems with very small overheads, as it is based on existing depth-first layouts.","PeriodicalId":354911,"journal":{"name":"ACM SIGGRAPH ASIA 2010 Sketches","volume":"481 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Ordered depth-first layouts for ray tracing\",\"authors\":\"Jae-Ho Nah, Jeong-Soo Park, Jin-woo Kim, Chanmin Park, T. Han\",\"doi\":\"10.1145/1899950.1900005\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present an ordered depth-first tree layout for ray tracing. Among two child nodes, a child node with the larger surface area is stored next to its parent node. Hence, the probabilities that a ray accesses to the same cache line increase. Our approach can be easily and widely used for various ray tracing systems with very small overheads, as it is based on existing depth-first layouts.\",\"PeriodicalId\":354911,\"journal\":{\"name\":\"ACM SIGGRAPH ASIA 2010 Sketches\",\"volume\":\"481 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-12-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM SIGGRAPH ASIA 2010 Sketches\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1899950.1900005\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM SIGGRAPH ASIA 2010 Sketches","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1899950.1900005","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We present an ordered depth-first tree layout for ray tracing. Among two child nodes, a child node with the larger surface area is stored next to its parent node. Hence, the probabilities that a ray accesses to the same cache line increase. Our approach can be easily and widely used for various ray tracing systems with very small overheads, as it is based on existing depth-first layouts.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
