基于Bezier的Spline算法

ttod_qzstudio

已于 2024-03-15 11:02:13 修改

阅读量200

点赞数 1

分类专栏：算法 Unity C# 文章标签：算法 unity Bezier

于 2022-10-19 14:50:33 首次发布

本文链接：https://blog.csdn.net/ttod/article/details/127407995

版权

Unity 同时被 3 个专栏收录

117 篇文章 4 订阅

订阅专栏

36 篇文章 1 订阅

订阅专栏

算法

21 篇文章 1 订阅

订阅专栏

基于Bezier的Spline算法，目前的代码不是很满意，效果不够顺滑，勉强可用，先放在这里，慢慢改进。

代码如下：

static public Vector3[] GetSpline(Vector3[] points, int segment)
{
	if (points.Length < 4) return null;
	if (segment < 1) segment = 1;
	segment *= 2;
	//
	List<Vector3> listPos = new List<Vector3>();
	int nodeCount = segment + 1;
	int halfCount = nodeCount / 2;
	Vector3[,] ps = new Vector3[nodeCount, points.Length - 3];
	float segmentInterval = 1f / segment;
	for (int i = 0; i < points.Length - 3; i++)
	{
		for (int j = 0; j < nodeCount; j++)
		{
			ps[j, i] = Bezier.GetPoint(j * segmentInterval, points[i], points[i + 1], points[i + 2], points[i + 3]);
		}
	}
		for (int j = 0; j < halfCount; j++)
	{
		listPos.Add(ps[j, 0]);
	}
	float intervalHalf = 1f / halfCount;
	for (int i = 0; i < points.Length - 4; i++)
	{
		for (int j = halfCount; j < nodeCount; j++)
		{
			float t = (j - halfCount) * intervalHalf;
			t = Mathf.Sin((t - 0.5f) * Mathf.PI) * 0.5f + 0.5f;
			Vector3 p1 = ps[j, i];
			Vector3 p2 = ps[j - halfCount, i + 1];
			Vector3 pos = p1 * (1 - t) + p2 * t;
			listPos.Add(pos);
		}
	}
	for (int j = halfCount; j < nodeCount; j++)
	{
		listPos.Add(ps[j, points.Length - 4]);
	}
	return listPos.ToArray();
}

里面使用的Bezier类请参看下面的连接：

三点和四点贝塞尔及切线算法