当前位置:网站首页>實驗10 Bezier曲線生成-實驗提高-控制點生成B樣條曲線
實驗10 Bezier曲線生成-實驗提高-控制點生成B樣條曲線
2022-06-11 21:26:00 【圖形空間】
本代碼根據已知控制點( 10, 5, 0 ),( 5, 10, 0 ),( -5, 15, 0 ),( -10, -5, 0 ),( 4, -4, 0 ),( 10, 5, 0 ), ( 5, 10, 0 ), ( -5, 15, 0 ), ( -10, -5, 0 ),( 10, 5, 0 )來生成三次B樣條曲線。
#include <GL/glut.h>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
using namespace std;
struct Point
{
float c[2];
float& x = c[0];
float& y = c[1];
Point() {
x = 0, y = 0; }
Point(float x0, float y0) {
x = x0, y = y0; }
Point(const Point& pt) {
x = pt.x, y = pt.y; }
float& operator[](const int i) {
return c[i]; }
};
vector<Point> GctrlPt, GbsCurvePt;
int GnumSegment = 10;
void CalcBSPoints()
{
int numCtrPt = GctrlPt.size();
float F0[2], F1[2], F2[2], F3[2];
float t = 0;
float dt = 1 / (float)GnumSegment;
//第一段NumSubSegment + 1個點,第二段之後每段為NumSubSegment個點,因為第二段之後的起點為前一段的終點
int numCurvePoint = (GnumSegment + 1) + GnumSegment * (numCtrPt - 4);
GbsCurvePt.resize(numCurvePoint);
//第一段起點編號為0,第二段之後的為1,原因見上
for (int i = 0; i < (numCtrPt - 3); i++)
{
for (int j = 0; j < 2; j++)
{
F0[j] = (GctrlPt[i][j] + 4 * GctrlPt[1 + i][j] + GctrlPt[2 + i][j]) / 6.0f;
F1[j] = (-3 * GctrlPt[i][j] + 3 * GctrlPt[2 + i][j]) / 6.0f;
F2[j] = (3 * GctrlPt[i][j] - 6 * GctrlPt[1 + i][j] + 3 * GctrlPt[2 + i][j]) / 6.0f;
F3[j] = (-GctrlPt[i][j] + 3 * GctrlPt[1 + i][j] - 3 * GctrlPt[2 + i][j] + GctrlPt[3 + i][j]) / 6.0f;
}
t = (i == 0) ? 0 : dt;//第一段起點參數為0,第二段之後的為dt,原因同上
for (int j = (i == 0) ? 0 : 1; j < GnumSegment + 1; j++)
{
for (int k = 0; k < 2; k++)
{
GbsCurvePt[j + GnumSegment * i][k] = F0[k] + F1[k] * t + F2[k] * t*t + F3[k] * t*t*t;
}
t += dt;
}
}
}
void ControlPoint(const vector<Point>& vpt)
{
glPointSize(3);
glBegin(GL_POINTS);
for (unsigned int i = 0; i < vpt.size(); i++)
{
glVertex2f(vpt[i].x, vpt[i].y);
}
glEnd();
}
void PolylineGL(const vector<Point>& vpt)
{
glBegin(GL_LINE_STRIP);
for (unsigned int i = 0; i < vpt.size(); i++)
{
glVertex2f(vpt[i].x, vpt[i].y);
}
glEnd();
}
void myDisplay()
{
glClear(GL_COLOR_BUFFER_BIT);
glColor3f(1.0f, 0.0f, 0.0f);
ControlPoint(GctrlPt);
glColor3f(0.0f, 1.0f, 0.0f);
PolylineGL(GctrlPt);
if (GctrlPt.size() >= 4)
{
glColor3f(1.0f, 1.0f, 1.0f);
CalcBSPoints();
PolylineGL(GbsCurvePt);
}
glFlush();
}
void Init()
{
glClearColor(0.0, 0.0, 0.0, 0.0);
glShadeModel(GL_SMOOTH);
float points[9][3] = {
{
10, 5, 0 }, {
5, 10, 0 }, {
-5, 15, 0 }, {
-10, -5, 0 }, {
4, -4, 0 },
{
10, 5, 0 }, {
5, 10, 0 }, {
-5, 15, 0 }, {
-10, -5, 0 } };
Point pt;
for (int i = 0; i < 9; i++)
{
Point pt = Point(points[i][0], points[i][1]);
GctrlPt.push_back(pt);
}
}
void myReshape(int w, int h)
{
glViewport(0, 0, (GLsizei)w, (GLsizei)h);
glMatrixMode(GL_PROJECTION);
glLoadIdentity();
glOrtho(-30.0, 30.0, -30.0*(GLfloat)h / (GLfloat)w, 30.0*(GLfloat)h / (GLfloat)w, 0.0, 100.0);
}
int main(int argc, char *argv[])
{
glutInit(&argc, argv);
glutInitDisplayMode(GLUT_RGB | GLUT_SINGLE);
glutInitWindowPosition(100, 100);
glutInitWindowSize(640, 480);
glutCreateWindow("B-Spline Curve");
Init();
glutDisplayFunc(myDisplay);
glutReshapeFunc(myReshape);
glutMainLoop();
return 0;
}
边栏推荐
- 正则校验匹配[0-100]、[0-1000]之间的正整数或小数点位数限制
- 实验10 Bezier曲线生成-实验提高-控制点生成B样条曲线
- Serval and Rooted Tree(CF1153D)-DP
- CANN编码的一些报错汇编
- LabVIEW controls Arduino to realize ultrasonic ranging (advanced chapter-5)
- 关于gorm的preload方法笔记说明
- Codeforces Round #740 Div. 2 解题报告
- Online excel file parsing and conversion to JSON format
- ASCII码对照表
- LeetCode-76-最小覆盖子串
猜你喜欢

JVM object allocation policy TLAB
![[Part 13] source code analysis and application details of completabilefuture class [key]](/img/cf/87c60a1d46835f3f0dae9f44970de4.jpg)
[Part 13] source code analysis and application details of completabilefuture class [key]

How to Load Data from CSV (Data Preparation Part)
![[game theory complete information static game] strategic game](/img/d2/743e8d14e4fb27cbe883d1df1bca27.jpg)
[game theory complete information static game] strategic game

Codeforces Round #744 (Div. 3) 解题报告

Network security Kali penetration learning introduction to web penetration using MSF penetration to attack win7 host and execute commands remotely

LeetCode-155-最小栈

Iros 2021 | new idea of laser vision fusion? Lidar intensity diagram +vpr

Test plans and test cases

Use float to create a page header, footer, left content, and main content.
随机推荐
Live broadcast with practice | 30 minutes to build WordPress website with Alibaba cloud container service and container network file system
【 C Advanced language】 Integer Storage in Memory
Educational Codeforces Round 114 (Rated for Div. 2) D
Go语言函数
焕新升级 | 创新,从云商店开始
Common file functions
JUnit tests multithreaded code, and the sub thread does not run
JVM方法区
使用 SAP UI5 CLI 命令行工具构建和运行 SAP UI5 应用
Jenkins+allure integrated report construction
作为一名 ABAP 资深顾问,下一步可以选择哪一门 SAP 技术作为主攻方向?
Serval and Rooted Tree(CF1153D)-DP
LabVIEW控制Arduino实现超声波测距(进阶篇—5)
Website online customer service system Gofly source code development log - 2 Develop command line applications
Codeforces Round #740 Div. 2 解题报告
The gateway starts other microservices first. When the gateway is started, the gateway cannot be started and there is no exception log; Start the gateway first, and all services can be started normall
LeetCode-76-最小覆盖子串
LabVIEW Arduino电子称重系统(项目篇—1)
Notes on the preload method of Gorm
LeetCode-43-字符串相乘