• <ins id="pjuwb"></ins>
    <blockquote id="pjuwb"><pre id="pjuwb"></pre></blockquote>
    <noscript id="pjuwb"></noscript>
          <sup id="pjuwb"><pre id="pjuwb"></pre></sup>
            <dd id="pjuwb"></dd>
            <abbr id="pjuwb"></abbr>
            隨筆 - 85  文章 - 47  trackbacks - 0

            常用鏈接

            隨筆分類(lèi)

            隨筆檔案

            搜索

            •  

            最新評(píng)論

            First, think what you want these matrices do.
            Let we have transformation matrices A and B . We want to transform vector V by both and get vector V'.
            But above is not enough to specify what we want to do, as
            first transform by A then transform by B
            and
            first transform by B then transform by A
            are different. You can just try to play with rotations in real world.(get a cube, paint x,y,z on sides, etc.)

            Now, more on how it's done:

            first transform by A then transform by B
            It is easy to see that this is accomplished by:
            In openGL's convention:
            V'=B*(A*V)
            Note that it is same as
            V'=(B*A)*V
            so you can do it as
            C=B*A;
            V'=C*V;
            In DX's convention:
            V'=(V*A)*B
            C=A*B;
            V'=V*C;
            (note: real operations done on memory is the same. It's just matter how we map matrix indices to memory)
            As you see, V*A*B and B*A*V is kind of symmetrical. Same for consequently applied transforms like V*A*B*C*D*E*F or F*E*D*C*B*A*V

            Now, write it down for "transform by B then transform by A" yourself to remember it better.

            When you render something , you want points to be transformed by
            matrix of object
            matrix of parent object
            matrix of grandparent object ...
            matrix of camera
            (and done by API, projection matrix)
            From there you can find what order of multiplications you want. In OGL, you need to
            m=matrix_of_camera*matrix_of_grandparent_objectmatrix_of_parent object*matrix_of_object;
            ...
            then if you'll glLoadMatrix, OpenGL will do
            vertice=m*vertice;

            Some more notes: Let you have spacecraft with spacecraft-to-world matrix M
            And you use OpenGL convention.
            For example, to turn spacecraft around spacecraft's local X direction, you need to
            M=M*axis_angle_to_matrix(Vector(1,0,0),angle);
            (note: you need to reorthonormalize matrix if you do that incrementally)
            To turn spacecraft around global X direction, you need to
            M=axis_angle_to_matrix(Vector(1,0,0),angle)*M;


            On openGL:

            This sequence

            glMatrixMode(GL_MODELVIEW);
            glMultMatrix(A);
            glMultMatrix(B);
            glMultMatrix(C);
            ... render your mesh ...
            works as if your mesh would be transformed by C,then B, then A
            It makes lot of sense, if you for example want to render a robot with matrices giving positions of child nodes (fingers) relativelty to parent (arm), and arm are responsible for positioning fingers, you can do
            RenderArm(){
            glPushMatrix();
            glMultMatrix(matrix_of_first_finger);
            RenderFinger();
            glPopMatrix();
            glPushMatrix();
            glMultMatrix(matrix_of_second_finger);
            RenderFinger();
            glPopMatrix();
            }
            and so-on(simplified example)
            Then, you can have
            glPushMatrix();
            glMultMatrix(matrix_of_arm);
            RenderArm();
            glPopMatrix();

            and it will work properly.

            If you have more questions, ask.
            posted on 2008-04-30 22:05 w2001 閱讀(1402) 評(píng)論(2)  編輯 收藏 引用

            FeedBack:
            # re: OpenGL中的矩陣計(jì)算[未登錄](méi) 2009-09-04 19:22 joe
            you english is really...bad...

            please write in chinese, that will be more helpful~  回復(fù)  更多評(píng)論
              
            # re: OpenGL中的矩陣計(jì)算 2009-09-09 19:31 w2001
            轉(zhuǎn)載,與本人水平無(wú)關(guān)。english止一工具耳,看得懂就達(dá)到目的了,至于badgood,說(shuō)明不了任何問(wèn)題。  回復(fù)  更多評(píng)論
              

            只有注冊(cè)用戶登錄后才能發(fā)表評(píng)論。
            網(wǎng)站導(dǎo)航: 博客園   IT新聞   BlogJava   博問(wèn)   Chat2DB   管理


            国内精品久久久久久久涩爱| 一级女性全黄久久生活片免费 | 亚洲欧美成人久久综合中文网 | 国内精品久久久久久野外| 99久久国产免费福利| 欧美成人免费观看久久| 国产精品久久久久久福利69堂| 亚洲伊人久久大香线蕉苏妲己| 日本久久中文字幕| 国产精品毛片久久久久久久| 亚洲午夜精品久久久久久app| 精品国产福利久久久| 亚洲精品乱码久久久久久| 久久99亚洲综合精品首页| 蜜臀av性久久久久蜜臀aⅴ| 女同久久| 久久久国产精华液| 国产精品久久久久无码av| 久久无码专区国产精品发布| 99久久国产综合精品网成人影院 | 久久久久久精品成人免费图片| 国产免费福利体检区久久| 国产成人精品白浆久久69| 久久99热这里只有精品国产| 伊人色综合久久天天人守人婷| 99久久精品无码一区二区毛片| 九九精品99久久久香蕉| 亚洲精品无码成人片久久| 亚洲欧美日韩精品久久亚洲区| 久久精品中文字幕第23页| 精品久久久无码中文字幕天天| AA级片免费看视频久久| 91精品国产91久久综合| 99久久精品午夜一区二区| 久久66热人妻偷产精品9| 九九精品99久久久香蕉| 亚洲va国产va天堂va久久| 亚洲愉拍99热成人精品热久久| 亚洲人成精品久久久久| 久久夜色精品国产欧美乱| www.久久热|