games101 作业4

cv::Point2f recursive_bezier(const std::vector<cv::Point2f> &control_points, float t) 
{
    // TODO: Implement de Casteljau's algorithm
    if (control_points.size()==2)
    {
        auto point = (1.-t)*control_points[0] + t *control_points[1];
        return cv::Point2f(point);
    }

    std::vector<cv::Point2f> new_points;
    for (int i = 0; i < control_points.size()-1; i++)
    {
        std::vector<cv::Point2f> tmp;
        tmp.push_back(control_points[i]);
        tmp.push_back(control_points[i+1]);
        new_points.push_back(recursive_bezier(tmp,t));
    }
    return recursive_bezier(new_points,t);

}

void bezier(const std::vector<cv::Point2f> &control_points, cv::Mat &window) 
{
    // TODO: Iterate through all t = 0 to t = 1 with small steps, and call de Casteljau's 
    // recursive Bezier algorithm.
    for (float t = 0; t <= 1; t += 0.0001)
    {
        auto point = recursive_bezier(control_points, t);
        window.at<cv::Vec3b>(point.y, point.x)[1] = 255;
    }
    
}

比较简单。