虚拟机下的代码int main(){vector3f P(2.0,1.0,1.0);Matrix3f rotate,translation;float sita = 45 * M_PI/180;rotate<< cos(sita), -sin(sita), 0,0,sin(sita),cos(sita), 0.0,0.0,0.0, 0.0;translation<<1,0,

虚拟机Eigen::Matrix4f get_view_matrix(Eigen::Vector3f eye_pos){Eigen::Matrix4f view = Eigen::Matrix4f::Identity();Eigen::Matrix4f translate;translate << 1, 0, 0, -eye_pos[0], 0, 1, 0, -eye_pos[1],

虚拟机代码：理论：前面的（n, i）代表的是组合组合：C(n,m)=P(n,m)/P(m,m) =n!/m!（n-m）!算法流程：递归构造Bezier曲线recursive_bezier（）cv::Point2f recursive_bezier(const std::vector<cv::Point2f> &control_points, float t){// TODO: