The concept of using multiple deep images,under a variety of different names, has been explored as a possible acceleration approach for finding raygeometry intersections. We leverage recent advances in deep image proc...The concept of using multiple deep images,under a variety of different names, has been explored as a possible acceleration approach for finding raygeometry intersections. We leverage recent advances in deep image processing from order independent transparency for fast building of a compound deep image(CDI) using a coherent memory format well suited for raycasting. We explore the use of a CDI and raycasting for the problem of determining distance between virtual point lights(VPLs) and geometry for indirect lighting,with the key raycasting step being a small fraction of total frametime.展开更多
Deep images store multiple fragments perpixel,each of which includes colour and depth,unlike traditional 2D flat images which store only a single colour value and possibly a depth value.Recently,deep images have found...Deep images store multiple fragments perpixel,each of which includes colour and depth,unlike traditional 2D flat images which store only a single colour value and possibly a depth value.Recently,deep images have found use in an increasing number of applications,including ones using transparency and compositing.A step in compositing deep images requires merging per-pixel fragment lists in depth order;little work has so far been presented on fast approaches.This paper explores GPU based merging of deep images using different memory layouts for fragment lists:linked lists,linearised arrays,and interleaved arrays.We also report performance improvements using techniques which leverage GPU memory hierarchy by processing blocks of fragment data using fast registers,following similar techniques used to improve performance of transparency rendering.We report results for compositing from two deep images or saving the resulting deep image before compositing,as well as for an iterated pairwise merge of multiple deep images.Our results show a 2 to 6 fold improvement by combining efficient memory layout with fast register based merging.展开更多
文摘The concept of using multiple deep images,under a variety of different names, has been explored as a possible acceleration approach for finding raygeometry intersections. We leverage recent advances in deep image processing from order independent transparency for fast building of a compound deep image(CDI) using a coherent memory format well suited for raycasting. We explore the use of a CDI and raycasting for the problem of determining distance between virtual point lights(VPLs) and geometry for indirect lighting,with the key raycasting step being a small fraction of total frametime.
文摘Deep images store multiple fragments perpixel,each of which includes colour and depth,unlike traditional 2D flat images which store only a single colour value and possibly a depth value.Recently,deep images have found use in an increasing number of applications,including ones using transparency and compositing.A step in compositing deep images requires merging per-pixel fragment lists in depth order;little work has so far been presented on fast approaches.This paper explores GPU based merging of deep images using different memory layouts for fragment lists:linked lists,linearised arrays,and interleaved arrays.We also report performance improvements using techniques which leverage GPU memory hierarchy by processing blocks of fragment data using fast registers,following similar techniques used to improve performance of transparency rendering.We report results for compositing from two deep images or saving the resulting deep image before compositing,as well as for an iterated pairwise merge of multiple deep images.Our results show a 2 to 6 fold improvement by combining efficient memory layout with fast register based merging.
