Editing Parallax mapping (section)

==Steep parallax mapping==
'''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. '''[[Relief mapping (computer graphics)|Relief mapping]]''' and '''[[parallax occlusion mapping]]''' are other common names for these techniques.

'''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.