private void Cut()
{
int startTime = System.Environment.TickCount;
//根据本切割工具网格顶点形成切割面
Vector3[] v = transform.GetComponent <MeshFilter>().mesh.vertices;
Plane cutPlane = new Plane(transform.TransformPoint(v[0]), transform.TransformPoint(v[1]), transform.TransformPoint(v[v.Length - 1]));
//Debug.Log(cutPlane.normal);
Vector3[] cutPlanePoints = new Vector3[4];
cutPlanePoints[0] = transform.TransformPoint(v[10]);//切割平面4个顶点
cutPlanePoints[1] = transform.TransformPoint(v[0]);
cutPlanePoints[2] = transform.TransformPoint(v[110]);
cutPlanePoints[3] = transform.TransformPoint(v[120]);
//把切割面转化为被切割物体的当地坐标 (cutPlane.normal * -cutPlane.distance)表示？
Vector3 localPoint = beCutThing.transform.InverseTransformPoint(cutPlane.normal * -cutPlane.distance);
//Debug.Log(localPoint);
Vector3 localSplitPlaneNormal = beCutThing.transform.InverseTransformDirection(cutPlane.normal);
localSplitPlaneNormal.Normalize(); //生成法向量
cutPlanePoints[0] = beCutThing.transform.InverseTransformPoint(cutPlanePoints[0]); //打印一下跟上面是否一样(temp)
cutPlanePoints[1] = beCutThing.transform.InverseTransformPoint(cutPlanePoints[1]);
cutPlanePoints[2] = beCutThing.transform.InverseTransformPoint(cutPlanePoints[2]);
cutPlanePoints[3] = beCutThing.transform.InverseTransformPoint(cutPlanePoints[3]);
//根据切割面，把顶点分成两部分
Vector3[] vertices = beCutThing.GetComponent <MeshFilter>().mesh.vertices;
Vector3[] normals = beCutThing.GetComponent <MeshFilter>().mesh.normals;
bool[] vertexAbovePlane;
vertexAbovePlane = new bool[vertices.Length];
//int[] oldToNewVertexMap = new int[vertices.Length];
List <Vector3> newVertices1 = new List <Vector3>(vertices);//为了避免数组多次动态增加容量，给最大值
//List<Vector3> newVertices2 = new List<Vector3>(vertices.Length);
List <Vector3> newNormals1 = new List <Vector3>(normals);
//List<Vector3> newNormals2 = new List<Vector3>(normals.Length);
for (int i = 0; i < vertices.Length; i++)
{
Vector3 vertex = vertices[i];
bool abovePlane = Vector3.Dot(vertex - localPoint, localSplitPlaneNormal) >= 0.0f;
vertexAbovePlane[i] = abovePlane;
//if (abovePlane)
//{
// // Assign vertex to 1
// oldToNewVertexMap[i] = newVertices1.Count;
// newVertices1.Add(vertex);
// newNormals1.Add(normals[i]);
//}
//else
//{
// // Assign vertex to 2
// oldToNewVertexMap[i] = newVertices2.Count;
// newVertices2.Add(vertex);
// newNormals2.Add(normals[i]);
//}
}
//if (newVertices1.Count == 0 || newVertices2.Count == 0)
//{
// Debug.Log("nothing be cut,over");
// return;
//}
//分三角面
int[] indices = beCutThing.GetComponent <MeshFilter>().mesh.triangles;
int triangleCount = indices.Length / 3;
List <int> newTriangles1 = new List <int>(indices.Length);
//List<int> newTriangles2 = new List<int>(indices.Length);
List <Vector3> cutEdges1 = new List <Vector3>();
List <Vector3> cutEdges2 = new List <Vector3>();
for (int i = 0; i < triangleCount; i++) // 遍历每一个三角面
{
int index0 = indices[i * 3 + 0];
int index1 = indices[i * 3 + 1];
int index2 = indices[i * 3 + 2];
bool above0 = vertexAbovePlane[index0];
bool above1 = vertexAbovePlane[index1];
bool above2 = vertexAbovePlane[index2];
if (above0 && above1 && above2)
{
newTriangles1.Add(index0);
newTriangles1.Add(index1);
newTriangles1.Add(index2);
}
else if (!above0 && !above1 && !above2)
{
newTriangles1.Add(index0);
newTriangles1.Add(index1);
newTriangles1.Add(index2);
}
else
{
// Split triangle
int top, cw, ccw;
if (above1 == above2 && above0 != above1)
{
top = index0;
cw = index1;
ccw = index2;
}
else if (above2 == above0 && above1 != above2)
{
top = index1;
cw = index2;
ccw = index0;
}
else
{
top = index2;
cw = index0;
ccw = index1;
}
Vector3 cwIntersection, ccwIntersection, cwNormal, ccwNormal;
if (vertexAbovePlane[top])
{
SplitTriangle(localPoint, localSplitPlaneNormal, vertices, normals, top, cw, ccw, out cwIntersection, out ccwIntersection, out cwNormal, out ccwNormal);
//newTriangles1.Add(top);
//newTriangles1.Add(newVertices1.Count);
//newTriangles1.Add(newVertices1.Count + 1);
//newTriangles2.Add(newVertices2.Count + 1);//cwIntersection
//newTriangles2.Add(cw);
//newTriangles2.Add(ccw);
//newTriangles2.Add(ccw);
//newTriangles2.Add(newVertices2.Count);//ccwIntersection
//newTriangles2.Add(newVertices2.Count + 1);// cwIntersection
//切割点是否在切割四边形内部 否：正常添加该三角面 是：删除该三角面，并添加切割点和切割面，记录切割点
Vector3 v0 = Vector3.Cross(cutPlanePoints[0] - cutPlanePoints[3], cwIntersection - cutPlanePoints[3]);
Vector3 v1 = Vector3.Cross(cutPlanePoints[1] - cutPlanePoints[0], cwIntersection - cutPlanePoints[0]);
Vector3 v2 = Vector3.Cross(cutPlanePoints[2] - cutPlanePoints[1], cwIntersection - cutPlanePoints[1]);
Vector3 v3 = Vector3.Cross(cutPlanePoints[3] - cutPlanePoints[2], cwIntersection - cutPlanePoints[2]);
if (Vector3.Dot(v0, v1) < 0 || Vector3.Dot(v0, v2) < 0 || Vector3.Dot(v0, v3) < 0)
{
//该点不在四边形内
//（Temp)(cwIntersection点)-->OK 已解决
newTriangles1.Add(index0); //
newTriangles1.Add(index1); //
newTriangles1.Add(index2); //
}
else
{
newTriangles1.Add(top);
newTriangles1.Add(newVertices1.Count);
newTriangles1.Add(newVertices1.Count + 1);
newVertices1.Add(cwIntersection);
newVertices1.Add(ccwIntersection);
newNormals1.Add(cwNormal);
newNormals1.Add(ccwNormal);
newTriangles1.Add(newVertices1.Count + 1);//cwIntersection
newTriangles1.Add(cw);
newTriangles1.Add(ccw);
newTriangles1.Add(ccw);
newTriangles1.Add(newVertices1.Count); //ccwIntersection
newTriangles1.Add(newVertices1.Count + 1); // cwIntersection
Vector3 cwIntersectionDiffer = GetDifferentVector3(cwIntersection);
Vector3 ccwIntersectionDiffer = GetDifferentVector3(ccwIntersection);
newVertices1.Add(ccwIntersectionDiffer);
newVertices1.Add(cwIntersectionDiffer);
newNormals1.Add(ccwNormal);
newNormals1.Add(cwNormal);
cutEdges1.Add(cwIntersection);
cutEdges1.Add(ccwIntersection);
cutEdges2.Add(cwIntersectionDiffer);
cutEdges2.Add(ccwIntersectionDiffer);
}
//newVertices1.Add(cwIntersection);
//newVertices1.Add(ccwIntersection);
//newNormals1.Add(cwNormal);
//newNormals1.Add(ccwNormal);
//newVertices2.Add(ccwIntersection);
//newVertices2.Add(cwIntersection);
//newNormals2.Add(ccwNormal);
//newNormals2.Add(cwNormal);
}
else
{
SplitTriangle(localPoint, localSplitPlaneNormal, vertices, normals, top, cw, ccw, out cwIntersection, out ccwIntersection, out cwNormal, out ccwNormal);
//切割点是否在切割四边形内部 否：正常添加该三角面 是：删除该三角面，并添加切割点和切割面，记录切割点
Vector3 v0 = Vector3.Cross(cutPlanePoints[0] - cutPlanePoints[3], cwIntersection - cutPlanePoints[3]);
Vector3 v1 = Vector3.Cross(cutPlanePoints[1] - cutPlanePoints[0], cwIntersection - cutPlanePoints[0]);
Vector3 v2 = Vector3.Cross(cutPlanePoints[2] - cutPlanePoints[1], cwIntersection - cutPlanePoints[1]);
Vector3 v3 = Vector3.Cross(cutPlanePoints[3] - cutPlanePoints[2], cwIntersection - cutPlanePoints[2]);
if (Vector3.Dot(v0, v1) < 0 || Vector3.Dot(v0, v2) < 0 || Vector3.Dot(v0, v3) < 0)//即：在平面外不切割
{
//该点不在四边形内
newTriangles1.Add(index0);
newTriangles1.Add(index1);
newTriangles1.Add(index2);
}
else
{
newTriangles1.Add(newVertices1.Count + 1);//cwIntersection
newTriangles1.Add(cw);
newTriangles1.Add(ccw);
newTriangles1.Add(ccw);
newTriangles1.Add(newVertices1.Count); //ccwIntersection
newTriangles1.Add(newVertices1.Count + 1); // cwIntersection
newVertices1.Add(ccwIntersection);
newVertices1.Add(cwIntersection);
newNormals1.Add(ccwNormal);
newNormals1.Add(cwNormal);
newTriangles1.Add(top);
newTriangles1.Add(newVertices1.Count);
newTriangles1.Add(newVertices1.Count + 1);
Vector3 cwIntersectionDiffer = GetDifferentVector3(cwIntersection);
Vector3 ccwIntersectionDiffer = GetDifferentVector3(ccwIntersection);
newVertices1.Add(cwIntersectionDiffer);
newVertices1.Add(ccwIntersectionDiffer);
newNormals1.Add(cwNormal);
newNormals1.Add(ccwNormal);
cutEdges1.Add(ccwIntersection);
cutEdges1.Add(cwIntersection);
cutEdges2.Add(ccwIntersectionDiffer);
cutEdges2.Add(cwIntersectionDiffer);
}
}
}
}
/*
* int cutOverTime = System.Environment.TickCount;
* //------添加切割信息到Cut Position中
* Vector3 cutPosition = new Vector3();
* for (int i = 0; i < cutEdges1.Count; i = i + 2)
* {
* cutPosition += cutEdges1[i];
* }
* cutPosition = cutPosition / (cutEdges1.Count / 2);//平均法求中心点坐标
* //Plane plane = new Plane(localSplitPlaneNormal, cutPosition);
* CutPosition.cutObject.Add(beCutThing);
* CutPosition.cutPoint.Add(cutPosition);
* CutPosition.cutPlaneNormal.Add(localSplitPlaneNormal);
* //------
*
* //FillCutEdges(a, b, cutEdges, localSplitPlaneNormal);
* int edgeCount = cutEdges1.Count / 2;
*
* List<Vector3> points = new List<Vector3>(edgeCount);// T 边
* List<int> outline = new List<int>(edgeCount * 2);//T 轮廓
*
* int start = 0;
*
*
*
*
*
*
* //T 遍历边
* for (int current = 0; current < edgeCount; current++)
* {
* int next = current + 1;
*
* // Find the next edge
* int nearest = start;
* float nearestDistance = (cutEdges1[current * 2 + 1] - cutEdges1[start * 2 + 0]).sqrMagnitude;
*
* for (int other = next; other < edgeCount; other++)
* {
* float distance = (cutEdges1[current * 2 + 1] - cutEdges1[other * 2 + 0]).sqrMagnitude;//列表中的下条边的第一个点距离当前边的第一个点的距离
*
* if (distance < nearestDistance)
* {
* nearest = other;
* nearestDistance = distance;
* }
* }
*
*
*
*
* // Is the current edge the last edge in this edge loop?
* if (nearest == start && current > start)//T 围成一个环
* {
* int pointStart = points.Count;
* int pointCounter = pointStart;
*
* // Add this edge loop to the triangulation lists
* for (int edge = start; edge < current; edge++)
* {
* points.Add(cutEdges1[edge * 2 + 0]);//加入 入点
* outline.Add(pointCounter++);
* outline.Add(pointCounter);
* }
*
* points.Add(cutEdges1[current * 2 + 0]);
* outline.Add(pointCounter);
* outline.Add(pointStart);
*
* // Start a new edge loop
* start = next;
* }
* else if (next < edgeCount)//若还不是一个环 交换位置
* {
* // Move the nearest edge so that it follows the current edge
* Vector3 n0 = cutEdges1[next * 2 + 0];
* Vector3 n1 = cutEdges1[next * 2 + 1];
*
* cutEdges1[next * 2 + 0] = cutEdges1[nearest * 2 + 0];
* cutEdges1[next * 2 + 1] = cutEdges1[nearest * 2 + 1];
*
* cutEdges1[nearest * 2 + 0] = n0;
* cutEdges1[nearest * 2 + 1] = n1;
* }
* //尝试解决半圆缝合问题2020.04.07
* //else
* //{
* // //两件事 加点 加边
* // cutEdges1.Add(cutEdges2[current]);
* // cutEdges1.Add(cutEdges2[start]);
* //}
* }
*
*
*
* //切割边数量大于1
* if (points.Count > 0) //调用triangulator
* {
* // Triangulate the outline
* int[] newEdges, newTriangles, newTriangleEdges;
*
* ITriangulator triangulator = new Triangulator(points, outline, localSplitPlaneNormal);
*
* triangulator.Fill(out newEdges, out newTriangles, out newTriangleEdges);
*
* // Add the new vertices
* int offsetA = newVertices1.Count;
* //int offsetB = newVertices2.Count;
*
* newVertices1.AddRange(points);
* //newVertices2.AddRange(points);
*
*
* Vector3 normalA = -localSplitPlaneNormal;
* Vector3 normalB = localSplitPlaneNormal;
*
* List<Vector3> tempNormal = new List<Vector3>();
*
*
* for (int i = 0; i < points.Count; i++)
* {
* newNormals1.Add(normalA);
* //newNormals2.Add(normalB);
*
* //t
* tempNormal.Add(normalA);
* }
*
*
* // Add the new triangles
* int newTriangleCount = newTriangles.Length / 3;
*
* for (int i = 0; i < newTriangleCount; i++)
* {
* newTriangles1.Add(offsetA + newTriangles[i * 3 + 0]);
* newTriangles1.Add(offsetA + newTriangles[i * 3 + 2]);
* newTriangles1.Add(offsetA + newTriangles[i * 3 + 1]);
*
* //newTriangles2.Add(offsetB + newTriangles[i * 3 + 0]);
* //newTriangles2.Add(offsetB + newTriangles[i * 3 + 1]);
* //newTriangles2.Add(offsetB + newTriangles[i * 3 + 2]);
* }
* //t
* GameObject patchingSurfaceA = new GameObject("patchingSurfaceA");
* patchingSurfaceA.AddComponent<MeshFilter>();
* Mesh A = patchingSurfaceA.GetComponent<MeshFilter>().mesh;
* A.vertices = points.ToArray();
* A.triangles = newTriangles;
* A.normals = tempNormal.ToArray();
* patchingSurfaceA.AddComponent<MeshRenderer>();
* }
*
*
*
*
*
* //--------------------------------------------------------------
* ///<summary>2020.04.07想法
* /// 此处可以做优化
* ///</summary>
* int edgeCount2 = cutEdges2.Count / 2;
*
* points = new List<Vector3>(edgeCount);
* outline = new List<int>(edgeCount * 2);
*
* start = 0;
*
* for (int current = 0; current < edgeCount; current++)
* {
* int next = current + 1;
*
* // Find the next edge
* int nearest = start;
* float nearestDistance = (cutEdges2[current * 2 + 1] - cutEdges2[start * 2 + 0]).sqrMagnitude;
*
* for (int other = next; other < edgeCount; other++)
* {
* float distance = (cutEdges2[current * 2 + 1] - cutEdges2[other * 2 + 0]).sqrMagnitude;
*
* if (distance < nearestDistance)
* {
* nearest = other;
* nearestDistance = distance;
* }
* }
*
* // Is the current edge the last edge in this edge loop?
* if (nearest == start && current > start)
* {
* int pointStart = points.Count;
* int pointCounter = pointStart;
*
* // Add this edge loop to the triangulation lists
* for (int edge = start; edge < current; edge++)
* {
* points.Add(cutEdges2[edge * 2 + 0]);
* outline.Add(pointCounter++);
* outline.Add(pointCounter);
* }
*
* points.Add(cutEdges2[current * 2 + 0]);
* outline.Add(pointCounter);
* outline.Add(pointStart);
*
* // Start a new edge loop
* start = next;
* }
* else if (next < edgeCount)
* {
* // Move the nearest edge so that it follows the current edge
* Vector3 n0 = cutEdges2[next * 2 + 0];
* Vector3 n1 = cutEdges2[next * 2 + 1];
*
* cutEdges2[next * 2 + 0] = cutEdges2[nearest * 2 + 0];
* cutEdges2[next * 2 + 1] = cutEdges2[nearest * 2 + 1];
*
* cutEdges2[nearest * 2 + 0] = n0;
* cutEdges2[nearest * 2 + 1] = n1;
* }
* //尝试解决半圆缝合问题2020.04.07
* //else
* //{
* // //两件事 加点 加边
* // cutEdges2.Add(cutEdges2[current]);
* // cutEdges2.Add(cutEdges2[start]);
* //}
* }
*
* if (points.Count > 0) //调用triangulator
* {
* // Triangulate the outline
* int[] newEdges, newTriangles, newTriangleEdges;
*
* ITriangulator triangulator = new Triangulator(points, outline, localSplitPlaneNormal);
*
* triangulator.Fill(out newEdges, out newTriangles, out newTriangleEdges);
*
* // Add the new vertices
* //int offsetA = newVertices1.Count;
* int offsetB = newVertices1.Count;
*
* newVertices1.AddRange(points);
* //newVertices2.AddRange(points);
*
*
* Vector3 normalA = -localSplitPlaneNormal;
* Vector3 normalB = localSplitPlaneNormal;
*
* //t
* List<Vector3> tempNormal = new List<Vector3>();
*
*
* for (int i = 0; i < points.Count; i++)
* {
* //newNormals1.Add(normalA);
* newNormals1.Add(normalB);
*
* //t
* tempNormal.Add(normalB);
* }
*
*
* // Add the new triangles
* int newTriangleCount = newTriangles.Length / 3;
*
* for (int i = 0; i < newTriangleCount; i++)
* {
* //newTriangles1.Add(offsetA + newTriangles[i * 3 + 0]);
* //newTriangles1.Add(offsetA + newTriangles[i * 3 + 2]);
* //newTriangles1.Add(offsetA + newTriangles[i * 3 + 1]);
*
* newTriangles1.Add(offsetB + newTriangles[i * 3 + 0]);
* newTriangles1.Add(offsetB + newTriangles[i * 3 + 1]);
* newTriangles1.Add(offsetB + newTriangles[i * 3 + 2]);
* }
* //t
* GameObject patchingSurfaceA = new GameObject("patchingSurfaceA");
* patchingSurfaceA.AddComponent<MeshFilter>();
* Mesh A = patchingSurfaceA.GetComponent<MeshFilter>().mesh;
* A.vertices = points.ToArray();
* A.triangles = newTriangles;
* A.normals = tempNormal.ToArray();
* patchingSurfaceA.AddComponent<MeshRenderer>();
* }
*/
int trianglationOverTime = System.Environment.TickCount;
//GameObject part1 = new GameObject(beCutThing.name + "(1)");
//GameObject part2 = new GameObject(beCutThing.name + "(2)");
//part1.AddComponent<MeshFilter>();
//part1.AddComponent<MeshRenderer>();
//part2.AddComponent<MeshFilter>();
//part2.AddComponent<MeshRenderer>();
//part1.GetComponent<MeshRenderer>().material = beCutThing.GetComponent<MeshRenderer>().material;
//part2.GetComponent<MeshRenderer>().material = beCutThing.GetComponent<MeshRenderer>().material;
//GameObject part1 = Instantiate(beCutThing, null);
//part1.name = beCutThing.name + "A";
//GameObject part2 = Instantiate(beCutThing, null);
//part2.name = beCutThing.name + "B";
beCutThing.GetComponent <MeshFilter>().mesh.Clear();
beCutThing.GetComponent <MeshFilter>().mesh.vertices = newVertices1.ToArray();
beCutThing.GetComponent <MeshFilter>().mesh.normals = newNormals1.ToArray();
beCutThing.GetComponent <MeshFilter>().mesh.triangles = newTriangles1.ToArray();
//part1.GetComponent<MeshFilter>().mesh.Clear();
//part1.GetComponent<MeshFilter>().mesh.vertices = newVertices1.ToArray();
//part1.GetComponent<MeshFilter>().mesh.normals = newNormals1.ToArray();
//part1.GetComponent<MeshFilter>().mesh.triangles = newTriangles1.ToArray();
//part2.GetComponent<MeshFilter>().mesh.Clear();
//part2.GetComponent<MeshFilter>().mesh.vertices = newVertices2.ToArray();
//part2.GetComponent<MeshFilter>().mesh.normals = newNormals2.ToArray();
//part2.GetComponent<MeshFilter>().mesh.triangles = newTriangles2.ToArray();
//part1.AddComponent<MeshCollider>();
//part1.GetComponent<MeshCollider>().convex = true;
//part1.GetComponent<MeshCollider>().cookingOptions = MeshColliderCookingOptions.InflateConvexMesh;
//part1.AddComponent<Interactable>();
//part1.AddComponent<Choosable>();
//part2.AddComponent<MeshCollider>();
//part2.GetComponent<MeshCollider>().convex = true;
//part2.GetComponent<MeshCollider>().cookingOptions = MeshColliderCookingOptions.InflateConvexMesh;
//part2.AddComponent<Interactable>();
//part2.AddComponent<Choosable>();
//beCutThing.SetActive(false);
//part1.transform.position = beCutThing.transform.position + cutPlane.normal * 0.01f;
//part2.transform.position = beCutThing.transform.position - cutPlane.normal * 0.01f;
//part1.transform.localScale = beCutThing.transform.localScale;
//part2.transform.localScale = beCutThing.transform.localScale;
//part1.transform.rotation = beCutThing.transform.rotation;
//part2.transform.rotation = beCutThing.transform.rotation;
int isolateStartTime = System.Environment.TickCount;
Isolate.IsolateMesh(beCutThing);
//Isolate.IsolateMesh(part2);
//part1.tag = "Objects";
//part2.tag = "Objects";
int overTime = System.Environment.TickCount;
//Debug.Log("切割总耗时：" + (overTime - startTime) + " 三角面分割耗时：" + (cutOverTime - startTime) + " 缝补耗时：" + (trianglationOverTime - cutOverTime) + " 分离耗时：" + (overTime - trianglationOverTime));
}