| Yu, Y., Ibarra, O.H., and Yang, T., " Parallel Progressive Radiosity with Adaptive Meshing ", Journal of Parallel and Distributed Computing, 42(1), pp.30-41, April 1997. |
....to the number of processors. Another difference is that all the processors equally share the Form Factor computation, whereas our implementation uses the master slave paradigm (which lets us support dynamic walk through as well as natural load balancing between the slaves) The algorithm in [17] uses static load assignment of super patches to hosts. The scene is essentially split between the hosts by geometric relations. During each iteration, the patch with the most significant energy is selected and each host then calculates all Form Factors between this patch and the part of the ....
Y. Yu, O.H. Ibarra, and T. Yang. Parallel Progressive Radiosity with Adaptive Meshing. Journal of Parallel and Distributed Computing, 42:30--41, April 1997.
No context found.
Yu, Y., Ibarra, O.H., and Yang, T., " Parallel Progressive Radiosity with Adaptive Meshing ", Journal of Parallel and Distributed Computing, 42(1), pp.30-41, April 1997.
....above a planar surface. The second case has one planar surface. There is a small area light source hanging above the center of the upper left quarter of the planar surface and the position of this light source is very close to that surface. One example is shown is Fig. 7. Based on an analysis [14] similar to that for Scenario 1, we can show our method can reach near optimal speedup(p) while the speedup of octree based block mapping is much less than p. So our method can balance the load and outperform the octree based block mapping. 5 Experimental Results We implemented the parallel ....
Yu, Y., Ibarra, O., Yang, T.: Parallel Progressive Radiosity with Adaptive Meshing. UCSB Computer Science Technical Report(1996).
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC