Prism Parallax Occlusion Mapping with Accurate Silhouette Generation

Abstract : Per-pixel displacement mapping algorithms such as [Policarpo et al. 2005; Tatarchuk 2006] became very popular recently as they can take advantage of the parallel nature of programmable GPU pipelines and render detailed surfaces at highly interactive rates. These approaches exhibit pleasing visual quality and render motion parallax effects, however, most of them suffer from lack of correct silhouettes. We perform ray-surface intersection in a volume given by prisms extruded from the input mesh triangles in the direction of the normal. The displaced surface is embedded in the volume of these prisms, bounded by a top and a bottom triangle and three bilinear patches (slabs). [Hirche et al. 2004] propose to triangulate the slabs and split the prisms into three tetrahedra. A consistent triangulation of adjacent prisms ensures that no gaps between tetrahedra exist and no tetrahedra overlap. Ray marching through tetrahedra is then straightforward as texture gradients (for marching along the ray) can be computed per tetrahedron.
Type de document :
Autre publication
no note. 2007
Liste complète des métadonnées

Littérature citée [3 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00606806
Contributeur : Team Reves <>
Soumis le : lundi 18 juillet 2011 - 13:41:55
Dernière modification le : samedi 27 janvier 2018 - 01:30:51
Document(s) archivé(s) le : mercredi 19 octobre 2011 - 02:20:21

Fichier

Dachsbacher-Tatarchuk-Prism_Pa...
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00606806, version 1

Collections

Citation

Carsten Dachsbacher, Natalya Tatarchuk. Prism Parallax Occlusion Mapping with Accurate Silhouette Generation. no note. 2007. 〈inria-00606806〉

Partager

Métriques

Consultations de la notice

236

Téléchargements de fichiers

534