Deferred Splatting

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 work, 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.
Type de document :
Article dans une revue
Computer Graphics Forum, Wiley, 2004, Proceedings of Eurographics 2004, 23 (3), pp.653-660
Liste complète des métadonnées

https://hal.inria.fr/inria-00355034
Contributeur : Gaël Guennebaud <>
Soumis le : mercredi 21 janvier 2009 - 17:07:13
Dernière modification le : jeudi 11 janvier 2018 - 06:21:34

Identifiants

  • HAL Id : inria-00355034, version 1

Collections

Citation

Gael Guennebaud, Loïc Barthe, Mathias Paulin. Deferred Splatting. Computer Graphics Forum, Wiley, 2004, Proceedings of Eurographics 2004, 23 (3), pp.653-660. 〈inria-00355034〉

Partager

Métriques

Consultations de la notice

108