-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathbezier-curve.cpp
58 lines (50 loc) · 1.11 KB
/
bezier-curve.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
#include <bits/stdc++.h>
#include <graphics.h>
using namespace std;
int factorial(int n)
{
if (n)
{
return n * factorial(n - 1);
}
return 1;
}
double nCr(int n, int r)
{
return factorial(n) / (double)(factorial(r) * factorial(n - r));
}
double bezierFunction(int k, int n, double u)
{
return nCr(n, k) * pow(u, k) * pow((1 - u), (n - k));
}
void bezierCurve(vector<pair<int, int>> points)
{
int n = points.size() - 1;
double eps = 0.0001;
for (double u = 0; u <= 1; u += eps)
{
double x = 0, y = 0;
for (int k = 0; k <= n; k++)
{
double bez = bezierFunction(k, n, u);
x += points[k].first * bez;
y += points[k].second * bez;
}
putpixel(x, y, WHITE);
}
for (auto x: points)
{
putpixel(x.first, x.second, WHITE);
circle(x.first, x.second, 5);
}
}
int main()
{
int gd = DETECT, gm = DETECT;
initgraph(&gd, &gm, "");
vector<pair<int, int>> points = {{27, 243}, {101, 47}, {324, 197}, {437, 23}};
bezierCurve(points);
getch();
closegraph();
return 0;
}