A fast and efficient bump mapping algorithm by angular perturbation

Cited 6 time in webofscience Cited 0 time in scopus
  • Hit : 242
  • Download : 0
Bump mapping is a surface rendering technique to simulate bumped surfaces without changing model geometry. Since it requires intensive computations at every pixel such as normal vector deflection and lighting calculation, its hardware implementation is desirable. However, the operations involved in conventional bump mapping algorithm are not adequate to hardware implementation. Therefore, we propose a simple and efficient algorithm, which directly calculates the inner product of the perturbed normal vector n ' and the halfway vector h. The deflection function is defined by perturbation angles represented in the spherical polar coordinate to reduce its computations. Also the perturbed term n ' h is used as an index to shading look-up tables which enable real-time per-pixel lighting on bumped surfaces. Since our architecture requires few arithmetic units and only 16.75 KB memory size, it can be easily implemented into a single chip renderer. (C) 2001 Elsevier Science Ltd. All rights reserved.
Publisher
PERGAMON-ELSEVIER SCIENCE LTD
Issue Date
2001
Language
English
Article Type
Article
Citation

COMPUTERS & GRAPHICS-UK, v.25, no.3, pp.401 - 407

ISSN
0097-8493
URI
http://hdl.handle.net/10203/83738
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 6 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0