PDF - Stanford University

More documents

Recommendations

Info

Cost of silhouette maps In the current implementation we use a float4 texture to store each point plus edge data. This is overkill! If bit-ops are available, we can pack it into a single byte: Three bits for the x and y values of the silhouette point, addressing 8x8 positions per cell. Two bits for the extra edge information An extra byte per cell adds 33% to a 24-bit RGB texture Graphics Hardware 2004 Pradeep Sen
Benefits of silhouette map textures Space-efficient representation Constant-time lookup and bounded complexity Piecewise linear approximation by deforming the underlying mesh Easy to create content 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 and 44: Bilinear interpolation as filter ba
Page 45 and 46: Implementation of Filtering Thus, w
Page 47 and 48: Minifying silhouette map textures
Page 49 and 50: Creation of silmap textures Two way
Page 51: Silmap samples from hi-res texture
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

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?