我在教科书中遇到的问题之一是:
In Computer Graphics transformations are applied on many vertices on the screen. Translation, Rotations
and Scaling.
Assume you’re operating on a vertex with 3 values (X, Y, 1). X, Y being the X Y coordinates and 1 is always
constant
A Translation is done on X as X = X + X’ and on Y as Y = Y + Y’
X’ and Y’ being the values to translate by
A scaling is done on X as X = aX and on Y as Y = bY
a and b being the scaling factors
Propose the best way to store these linear equations and an optimal way to calculate them on each vertex
暗示它涉及矩阵乘法和Strassen。但是,我不确定从哪里开始?它不涉及复杂的代码,它声明想出一些简单的东西来展示我的想法,但我遇到的所有 Strassen 实现绝对足够大,不会称之为复杂。我的思考过程应该是什么?
我的矩阵会像这样吗?每个方程 3x3 还是我将它们组合在一起?
[ X X X']
[ Y Y Y']
[ 1 1 1 ]