A. J. Willmott, Hierarchical Radiosity with Multiresolution Meshes. PhD thesis, Carnegie Mellon University, Pittsburgh, PA, (Nov. 2000). 2, 3, 5, 8  Home/Search   Document Details and Download   Summary   Related Articles   Check

....vector per cluster, which leads to blocky solutions or fine subdivisions. As for volume clusters, the classic smoothing post pass is difficult to apply, and re evaluating visibility at the input polygon level is prohibitively expensive for highly tessellated scenes. For this reason, Willmott [Wil00] proposes a final post processing stage in which irradiance vectors are recomputed at the corners of each node throughout the hierarchy and interpolated at each input model vertex for computing radiosity. Our work improves over this method by using higher order bases during the solution, leading ....

....attributes as in our earlier simplification tool [BG01] Since face clusters do not in general not represent planar surfaces with constant material attributes, all queries return average, minimum, and maximum expected values. In particular, we employ the following expressions, due to Willmott [Wil00] Normal projected area of cluster i: # # # # k A k n k # # # (3.1) where A k is surface area of face k and n k is the normal of face k; Minimum projected area of cluster i in direction r: A i (n i r) 3.2) where A i is the total surface area of the cluster ....

[Article contains additional citation context not shown here]

Andrew J. Willmott. Hierarchical Radiosity with Multiresolution Meshes. PhD thesis, Carnegie Mellon University, Pittsburgh, PA, November 2000. Available from http://reportsarchive. adm.cs.cmu.edu/anon/2000/abstracts/00-166.html.

No context found.

A. J. Willmott, Hierarchical Radiosity with Multiresolution Meshes. PhD thesis, Carnegie Mellon University, Pittsburgh, PA, (Nov. 2000). 2, 3, 5, 8

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