PDF - Stanford University

More documents

Recommendations

Info

Silhouette map hardware The silhouette map algorithm might be implemented in hardware, exposed to the user as a texture fetch command. This would allow these examples to be implemented without a single fragment program being written! Graphics Hardware 2004 Pradeep Sen
Comparison: Feature-based textures FBT’s encode texture features by dividing cells into different regions using spline curves Like silhouette map textures, they address the artifacts that occur in the magnification of textures Complicated spline intersection algorithm would be difficult to implement in real-time on graphics hardware Graphics Hardware 2004 Ramanarayanan, Bala, Walter – “Feature-Based Textures” 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 and 52: Silmap samples from hi-res texture
Page 53: Benefits of silhouette map 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
show all

PDF - Stanford University

Create successful ePaper yourself

Delete template?

Save as template?