Computer Graphics: Difference between revisions
Jump to navigation
Jump to search
Adamcolton (talk | contribs) |
Adamcolton (talk | contribs) |
||
| Line 27: | Line 27: | ||
Interesting solution to a type problem I've had; points cannot be directly added to points. But, say finding the center of a triangle, it's (t[0]+t[1]+t[2])/3. The solution is that affine combination of points is allowed. | Interesting solution to a type problem I've had; points cannot be directly added to points. But, say finding the center of a triangle, it's (t[0]+t[1]+t[2])/3. The solution is that affine combination of points is allowed. | ||
A line can also be thought of as an affine map | |||
F(t) = (1-t)t<sub>0</sub> + (t)t<sub>1</sub> | |||
Revision as of 14:24, 28 March 2019
I'm leaving this as is, but really my interest is "Computational Geometry"
- Broken Chalk Series This is excellent
- Graphics Gems books
- https://www.reddit.com/r/GraphicsProgramming/
- https://www.reddit.com/r/raytracing/
- https://github.com/hunterloftis/oneweekend/blob/master/readme.md
- Ray Tracing in a Weekend
- [1]
Notes
BCS
- Flat shading
- Gouraud Shading
- Phong Shading
Catmull-Clark Surface
Curves and Surfaces for CAGD
Resume: 16
CAGD: computer aided geometric design
www.mkp.com/cagd5e
Interesting solution to a type problem I've had; points cannot be directly added to points. But, say finding the center of a triangle, it's (t[0]+t[1]+t[2])/3. The solution is that affine combination of points is allowed.
A line can also be thought of as an affine map
F(t) = (1-t)t0 + (t)t1