Skip to Main content Skip to Navigation
Other publications

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.
Document type :
Other publications
Complete list of metadata

Cited literature [3 references]  Display  Hide  Download

https://hal.inria.fr/inria-00606806
Contributor : Team Reves <>
Submitted on : Monday, July 18, 2011 - 1:41:55 PM
Last modification on : Saturday, January 27, 2018 - 1:30:51 AM
Long-term archiving on: : Wednesday, October 19, 2011 - 2:20:21 AM

File

Dachsbacher-Tatarchuk-Prism_Pa...
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00606806, version 1

Collections

Citation

Carsten Dachsbacher, Natalya Tatarchuk. Prism Parallax Occlusion Mapping with Accurate Silhouette Generation. 2007. ⟨inria-00606806⟩

Share