PDF - Stanford University

More documents

Recommendations

Info

3 corner interpolation D A (x,y) So: C f(x,y) = (1 – x – y)C + xB + yD We note: g(x,0) = (1 – x)C + xB g(0,y) = (1 – y)C + yD g(x,0) + g(0,y) = 2C – xC – yC + xB + yD g(x,0) + g(0,y) – g(0,0) = (1 – x – y)C + xB + yD B Graphics Hardware 2004 Pradeep Sen
Implementation of Filtering Thus, we can represent any case using the bilinear interpolation function available on hardware. Because we have so many cases, implementation is tricky. Refer to paper… Graphics Hardware 2004 Pradeep Sen
Page 1 and 2: Silhouette Maps for Improved Textur
Page 3 and 4: A history of texture magnification
Page 5 and 6: A history of texture magnification
Page 7 and 8: Contributions Applied the silhouet
Page 9 and 10: Previous work in texture magnificat
Page 11 and 12: Concurrent work Presented at Render
Page 13 and 14: The silhouette map Introduced in S
Page 15 and 16: Silhouette map texture algorithm Du
Page 25 and 26: Initial results Pre-filtered textur
Page 27 and 28: Controlling shaders Example of usin
Page 29 and 30: Problem with “natural” images
Page 31 and 32: Additional info needed in silmap To
Page 39 and 40: Six different interpolation cases D
Page 41 and 42: Bilinear interpolation as filter ba
Page 43: Bilinear interpolation as filter ba
Page 47 and 48: Minifying silhouette map textures
Page 49 and 50: Creation of silmap textures Two way
Page 51 and 52: Silmap samples from hi-res texture
Page 53 and 54: Benefits of silhouette map textures
Page 55 and 56: Comparison: Feature-based textures
Page 57 and 58: Why does it look like a cartoon? f
Page 59 and 60: Conclusions We have extended the s
Page 61: Questions? Graphics Hardware 2004 P

PDF - Stanford University

Create successful ePaper yourself

Delete template?

Save as template?