Parallax mapping

<h2 id="steep-parallax-mapping">Steep parallax mapping</h2>
<p>Steep parallax mapping is one name for the class of algorithms that trace rays against heightfields. The idea is to walk along a ray that has entered the heightfield's volume, finding the intersection point of the ray with the heightfield. This closest intersection is what part of the heightfield is truly visible. <a href="/facts/Relief_mapping_(computer_graphics)/dNf3xaYx">Relief mapping</a> and <a href="/facts/Parallax_occlusion_mapping/GPdC10h2">parallax occlusion mapping</a> are other common names for these techniques.
</p><p>Interval mapping improves on the usual binary search done in relief mapping by creating a line between known inside and outside points and choosing the next sample point by intersecting this line with a ray, rather than using the midpoint as in a traditional binary search.
</p>
<h2 id="see-also">See also</h2>
<ul><li><a href="/facts/Parallax_scrolling/pXPNCUo3">Parallax scrolling</a></li></ul>

<h2 id="external-links">External links</h2>
<ul><li>Comparison from the <a href="/facts/Irrlicht_Engine/l08ylxhV">Irrlicht Engine</a>: <a href="http://www.irrlicht3d.org/images/parallaxmapping.jpg">With Parallax mapping</a> vs. <a href="http://www.irrlicht3d.org/images/noparallaxmapping.jpg">Without Parallax mapping</a></li>
<li><a href="http://www.gamedev.net/community/forums/topic.asp?topic_id=387447">Parallax mapping implementation in DirectX, forum topic</a></li>
<li><a href="http://cowboyprogramming.com/2007/01/05/parallax-mapped-bullet-holes/comment-page-1/">Parallax Mapped Bullet Holes</a> - Details the algorithm used for F.E.A.R. style bullet holes.</li></ul>

<h2 id="references">References</h2>

<ol>
<li id="fn:1"><p>Kaneko, T., et al., 2001. Detailed Shape Representation with Parallax Mapping Archived 2016-06-01 at the Wayback Machine. In Proceedings of ICAT 2001, pp. 205-208. <a href="https://www.researchgate.net/profile/Susumu_Tachi/publication/228583097_Detailed_shape_representation_with_parallax_mapping/links/02e7e518259abdc882000000.pdf" target="_blank">https://www.researchgate.net/profile/Susumu_Tachi/publication/228583097_Detailed_shape_representation_with_parallax_mapping/links/02e7e518259abdc882000000.pdf</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li>
<li id="fn:2"><p>Tatarchuk, N., 2005. Practical Dynamic Parallax Occlusion Mapping Archived 2009-09-25 at the Wayback Machine Siggraph presentations <a href="http://ati.amd.com/developer/SIGGRAPH05/Tatarchuk-ParallaxOcclusionMapping-Sketch-print.pdf" target="_blank">http://ati.amd.com/developer/SIGGRAPH05/Tatarchuk-ParallaxOcclusionMapping-Sketch-print.pdf</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li>
</ol>

Parallax mapping open-in-new

Parallax mapping