| Previous | [ 1] | [ 2] | [ 3] | [ 4] | [ 5] | [ 6] | [ 7] | [ 8] | [ 9] | [ 10] | [ 11] | [ 12] | [ 13] | [ 14] | [ 15] | [ 16] | [ 17] | [ 18] | [ 19] | [ 20] |
¡@
Seung-Gi Lee, Woo-Chan Park+, Won-Jong Lee, Sung-Bong Yang and Tack-Don Han
Department of Computer Science
Yonsei University
Seoul, 120-749 Korea
+Department of Internet Engineering
Sejong University
Seoul, 143-747 Korea
Bump mapping is a technique that represents the detailed parts of an object surface,
such as the skin of a peanut, using the geometry mapping without complex modeling.
However, the hardware implementation for bump mapping is very expensive, because a
large amount of per pixel computations, including the normal vector shading, is required.
In this paper, we propose an effective bump mapping algorithm that utilizes the reference
space with the polar coordinate system and also propose a new hardware architecture
associated with the proposed bump mapping algorithm. The proposed architecture
reduces the computations to transform the vectors from the object space into the reference
space by using a new vector rotation method. It also reduces the computations for
the illumination calculation by using the law of cosine. Compared with the previous approaches,
the proposed architecture reduces multiplication operations up to 78%.
Received April 11, 2005; revised July 12, 2005; accepted October 19, 2005.
Communicated by H. Y. Mark Liao.
* The preliminary version of this paper was presented in SIGGRAPH/EUROGRAPHICS Graphics Hardware
Workshop 2003, San Diego, U.S.A.