Faster Relief Mapping using the Secant Method

Relief mapping using the secant method offers an efficient method for adding per pixel height field based displacement to an arbitrary polygonal mesh in real time. The technique utilizes an interval based method in which bounds of the interval are computed in the beginning and are refined at every iteration until the intersection point is reached. The search space defined by the interval reduces and converges to the intersection point rapidly and outperforms currently popular binary search based method (relief mapping) used for performing this task. We compute the bounds using simple ray segment intersection method. We demonstrate the algorithm and show empirical and explicit evidence of the speedup.

• Type: Journal
• Year: 2007
• Where: JGTOOLS
• Authors: Eric Risser, Musawir Shah, Sumanta N. Pattanaik
• Keywords: Arbitrary Polygonal Mesh, Intersection Point, Interval Based Method, JGTOOLS 2007