1. Mesh Color Cem Yuksel John Keyser Donald H. House Texas A&M University SIGGRAPH 2010 2010/12/06 Xiang

2. Outline 1.Introduction 2.Mesh Color Structure 3.Mesh Color Properties 4.Filtering 5.Experimental Result 6.Disscusion 7.Conclusion 8.Reference

3. 1. Introduction 2D texture 3D texture Texture Mapping Some problem & Some challenge

4. Texture Mapping Challenge 2D texture −Seams −No local texture detail adjustment −Very sensitive to model topology 3D texture −Challenge to One-to-one mapping −Sharp and thin edge requires high textue resolution to avoid color bleeding −Slightest change in the textured 3D model may require to regenerate map −Big memory requirement Color bleeding

5. Mesh Color Structure Number of color samples per vertex= 1 Number of color samples per edge= Number of color samples per face= With different resolution, Add color samples on triangle.

6. Mesh Color Properties No mapping No discontinuities (no seams) Guaranteed one-to-one correspondence Correct MIP-map filtering Local resolution adjustment Permits model editing and subdivision Compatible with current graphics pipeline

7. Mesh Color Structure The 3D surface position of any color sample can be computed using barycentric coordinates based on the index of the color sample. [1,0,0] [0,1,0] [0,0,1] The barycentric coordinate of Color Sample Cij Like standard map, mesh colors can be usable in the current graphics pipeline.

8. Mesh Color Structure Colors are shared along edges - Guaranteed continuity

9. Mesh Color Structure Color sample density can be concentrated on areas with hight detail - achieving maximum texture detail with minimal memory consumption Non-uniform Face Resolution

10. Mesh Color Structure Color sample density can be concentrated on areas with hight detail - achieving maximum texture detail with minimal memory consumption Non-uniform Face Resolution Shared Edge

11. Editting Mesh Color Geometry Mesh colors can easily support most other mesh editing operations without the need for resampling.

12. Other Mesh Quad Mesh can use bilinear coordinates. triangulate the polygon position sample use bilinear interpolation

13. How to project to screen pixel?

14. Nearest Filtering Find the nearest triangle, and use the barycentric coordinates to interpolate the color of the red point.

15. Nearest Filtering Interpolation with weight from the points of the triangle

16. Nearest Filtering

17. Linear Filtering Staircase artifacts of nearest-filtering can be hidden by linear filtering. Nearest filteringLinear filtering blending

18. Mip-map Filtering MIP-map filtering R=8R=4R=2R=1 Face & EdgeVertex

19. Filtering Staircase artifact Under sampling artifact blurring

20. Filtering Correct Filtering - Mesh Colors result is the same as 2D Texture

21. Experiment Result

23. Memory Efficient

24. Experiment Result

25. Performance Fast under Hardware support

26. Discussion Periodic texture tiling is not supported. If discontinuities is desired, mesh color can’t support. Non-equal edge – result isn’t good Use polygon meshUse subdivideNon-equal edge

27. Conclusion 1.Easy to use 2.Easy to implement 3.High quality 4.High performance 5.Mesh Colors are ideally suited for – 3D painting – Storing precomputed data Ambient occlusion 6.Mesh Colors provide a solution to the fundamental problems of texture mapping.

28. Reference [1] L´E VY, B., AND MALLET, J.-L. 1998. Non-distorted texture mapping for sheared triangulated meshes. In Proceedings of SIGGRAPH’98, 343–352. [2] BENNIS, C., V´EZIEN, J.-M., AND IGL´ESIAS, G. 1991. Piecewise surface flattening for non-distorted texture mapping. Proc. SIGGRAPH ’91, ACM SIGGRAPH Comp. Graph. 25, 4, 237–246.