GAMES101 闫令琪图形学 作业4

作业4

问题描述

for (double t = 0.0; t <= 1.0; t += 0.001)
    {
        auto point = recursive_bezier(control_points,t);

        window.at<cv::Vec3b>(point.y, point.x)[1] = 255;
    }

递归算法

if (control_points.size() == 2)
        return t * control_points[0] + (1 - t) * control_points[1];

    std::vector<cv::Point2f> points;

    for (int i = 0; i < control_points.size() - 1; i++)
    {
        cv::Point2f p = t * control_points[i] + (1 - t) * control_points[i + 1];
        points.push_back(p);
    }
    return recursive_bezier(points, t);