Deferred Splatting
| dc.contributor.author | Guennebaud, Gael | en_US |
| dc.contributor.author | Barthe, Loic | en_US |
| dc.contributor.author | Paulin, Mathias | en_US |
| dc.date.accessioned | 2015-02-19T09:54:48Z | |
| dc.date.available | 2015-02-19T09:54:48Z | |
| dc.date.issued | 2004 | en_US |
| dc.description.abstract | In recent years it has been shown that, above a certain complexity, points become the most efficient rendering primitives. Although the programmability of the lastest graphics hardware allows efficient implementation of high quality surface splatting algorithms, their performance remains below those obtained with simpler point based rendering algorithms when they are used for scenes of high complexity. In this paper, our goal is to apply high quality point based rendering algorithms on complex scenes. For this purpose, we show how to take advantage of temporal coherency in a very accurate hardware accelerated point selection algorithm allowing the expensive computations to be peformed only on visible points. Our algorithm is based on a multi-pass hardware accelerated EWA splatting. It is also suitable for any rendering application since no pre-process is needed and no assumption is made on the data structure. In addition, we briefly discuss the association of our method with other existing culling techniques and optimization for particular applications.Categories and Subject Descriptors (according to ACM CCS): I.3.3 [Computer Graphics]: Viewing algorithms | en_US |
| dc.description.number | 3 | en_US |
| dc.description.seriesinformation | Computer Graphics Forum | en_US |
| dc.description.volume | 23 | en_US |
| dc.identifier.doi | 10.1111/j.1467-8659.2004.00797.x | en_US |
| dc.identifier.issn | 1467-8659 | en_US |
| dc.identifier.pages | 653-660 | en_US |
| dc.identifier.uri | https://doi.org/10.1111/j.1467-8659.2004.00797.x | en_US |
| dc.publisher | The Eurographics Association and Blackwell Publishing, Inc | en_US |
| dc.title | Deferred Splatting | en_US |