Result 1 to 20 of 114 total
A hybrid approach to interactive global illumination and soft shadows. (English)
Visual Comput. 26, No. 6-8, 565-574 (2010).
1
An extended GPU radiosity solver including diffuse and specular reflectance and transmission. (English)
Visual Comput. 25, No. 5-7, 529-537 (2009).
2
Improving multipath radiosity with bundles of parallel lines. (English)
Comput. Graph. Forum 27, No. 6, 1632-1646 (2008).
3
Fast GPU-based reuse of paths in radiosity. (English)
Monte Carlo Methods Appl. 13, No. 4, 253-273 (2007).
4
Fréchet derivative with respect to the shape of a strongly convex nonscattering region in optical tomography. (English)
Inverse Probl. 23, No. 5, 2249-2270 (2007).
5
Fast multipole method for solving the radiosity equation. (English)
Bermúdez de Castro, Alfredo (ed.) et al., Numerical mathematics and advanced applications. Proceedings of ENUMATH 2005, the 6th European conference on numerical mathematics and advanced applications, Santiago de Compostela, Spain, July 18‒22, 2005. Berlin: Springer (ISBN 3-540-34287-7/hbk). 609-617 (2006).
6
Iterative sinc-convolution method for solving radiosity equation in computer graphics. (English)
ETNA, Electron. Trans. Numer. Anal. 23, 251-262, electronic only (2006).
7
A low complexity discrete radiosity method. (English)
Andres, Eric (ed.) et al., Discrete geometry for computer imagery. 12th international conference, DGCI 2005, Poitiers, France, April 13‒15, 2005. Proceedings. Berlin: Springer (ISBN 3-540-25513-3/pbk). Lecture Notes in Computer Science 3429, 392-403 (2005).
8
A fast collocation method for the radiosity equation, based on the hierarchical algorithm of Hanrahan and Salzman: the 1D case. (English)
Adv. Comput. Math. 22, No. 4, 353-375 (2005).
9
Progressive radiosity method on clusters using a new clipping algorithm. (English)
Int. J. High Perform. Comput. Netw. 1, No. 1-3, 55-63 (2004).
10
An inner product lemma. (English)
Numer. Linear Algebra Appl. 11, No. 7, 649-659 (2004).
11
Reuse of paths in final gathering step with moving light sources. (English)
Bubak, Marian (ed.) et al., Computational science ‒ ICCS 2004. 4th international conference, Kraków, Poland, June 6‒9, 2004. Proceedings, Part IV. Berlin: Springer (ISBN 3-540-22129-8/pbk). Lecture Notes in Computer Science 3039, 189-196 (2004).
12
A practical radiosity method for predicting transmission loss in urban environments. (English)
EURASIP J. Wirel. Commun. Netw. 2004, No. 2, 357-364 (2004).
13
Fast multipath radiosity using hierarchical subscenes. (English)
Comput. Graph. Forum 23, No. 1, 43-53 (2004).
14
Space-time hierarchical radiosity with clustering and higher-order wavelets. (English)
Comput. Graph. Forum 23, No. 2, 129-141 (2004).
15
Reusing paths in radiosity and global illumination. (English)
Monte Carlo Methods Appl. 10, No. 3-4, 575-585 (2004).
16
A comparison of task pools for dynamic load balancing of irregular algorithms. (English)
Concurrency Comput. Pract. Exp. 16, No. 1, 1-47 (2004).
17
Generalized block iterative methods. (English)
Hege, Hans-Christian (ed.) et al., Visualization and mathematics III. Outgrowth of the 3rd international workshop, Berlin, Germany, May 22‒25, 2002. Berlin: Springer (ISBN 3-540-01295-8/hbk). 261-285, 433 (2003).
18
3-D computer graphics. A mathematical introduction with OpenGL. (English)
Cambridge: Cambridge University Press (ISBN 0-521-82103-7/hbk). xvi, 371~p. \sterling~35.00; \$~65.00 (2003).
19
A neural network based finite element grid generation algorithm for the simulation of light propagation. (English)
Appl. Numer. Math. 46, No.3-4, 263-277 (2003).
20
Result 1 to 20 of 114 total
Start
Contact
Print
General Help
