MuHua/MuHua-Core
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

1

Browse Source
This commit is contained in:
MuHua-123
2024-11-29 18:10:02 +08:00
parent 84243e75a8
commit 698464b9d7
81 changed files with 3073 additions and 671 deletions
Download Patch File Download Diff File Expand all files Collapse all files
Assets/ModuleUnit/UnitAlgorithm/UnitAlgorithmRhombus.cs
+40 -37
View File
@@ -5,55 +5,58 @@ using UnityEngine;
/// <summary>
/// 菱形绘制三角形算法
/// </summary>
public class UnitAlgorithmRhombus : UnitAlgorithm<DataPlate> {
public class UnitAlgorithmRhombus : UnitAlgorithm<DataPlateBaking> {
public void Compute(DataPlate data) {
public void Compute(DataPlateBaking plateBaking) {
List<DataTriangle> triangles = new List<DataTriangle>();
data.vertexGrid.Loop((x, y) => {
DataVertex vertex = data.vertexGrid.Get(x, y);
if (!vertex.isValid) { return; }
List<DataPlateVertex> vertexs = new List<DataPlateVertex>();
//plateBaking.grid.Loop((x, y) => {
// DataPlateVertex vertex = plateBaking.grid.Get(x, y);
// if (!vertex.isValid) { return; }
TryGet(data.vertexGrid, x, y + 1, ref vertex.above);
TryGet(data.vertexGrid, x, y - 1, ref vertex.below);
TryGet(data.vertexGrid, x - 1, y, ref vertex.left);
TryGet(data.vertexGrid, x + 1, y, ref vertex.right);
// TryGet(plateBaking.grid, x, y + 1, ref vertex.above);
// TryGet(plateBaking.grid, x, y - 1, ref vertex.below);
// TryGet(plateBaking.grid, x - 1, y, ref vertex.left);
// TryGet(plateBaking.grid, x + 1, y, ref vertex.right);
TryGet(data.vertexGrid, x - 1, y + 1, ref vertex.leftAbove);
TryGet(data.vertexGrid, x - 1, y - 1, ref vertex.leftBelow);
TryGet(data.vertexGrid, x + 1, y + 1, ref vertex.rightAbove);
TryGet(data.vertexGrid, x + 1, y - 1, ref vertex.rightBelow);
//默认绘制左上角
if (vertex.above != null && vertex.left != null) {
triangles.Add(CreateDataTriangle(vertex, vertex.left, vertex.above));
}
//默认绘制右下角
if (vertex.below != null && vertex.right != null) {
triangles.Add(CreateDataTriangle(vertex, vertex.right, vertex.below));
}
//如果右上角点不存在，则尝试绘制右上角
if (vertex.rightAbove == null && vertex.above != null && vertex.right != null) {
triangles.Add(CreateDataTriangle(vertex, vertex.above, vertex.right));
}
//如果左下角点不存在，则尝试绘制左下角
if (vertex.leftBelow == null && vertex.below != null && vertex.left != null) {
triangles.Add(CreateDataTriangle(vertex, vertex.below, vertex.left));
}
});
data.triangles = triangles;
// TryGet(plateBaking.grid, x - 1, y + 1, ref vertex.leftAbove);
// TryGet(plateBaking.grid, x - 1, y - 1, ref vertex.leftBelow);
// TryGet(plateBaking.grid, x + 1, y + 1, ref vertex.rightAbove);
// TryGet(plateBaking.grid, x + 1, y - 1, ref vertex.rightBelow);
// //默认绘制左上角
// if (vertex.above != null && vertex.left != null) {
// triangles.Add(CreateDataTriangle(vertex, vertex.left, vertex.above));
// }
// //默认绘制右下角
// if (vertex.below != null && vertex.right != null) {
// triangles.Add(CreateDataTriangle(vertex, vertex.right, vertex.below));
// }
// //如果右上角点不存在，则尝试绘制右上角
// if (vertex.rightAbove == null && vertex.above != null && vertex.right != null) {
// triangles.Add(CreateDataTriangle(vertex, vertex.above, vertex.right));
// }
// //如果左下角点不存在，则尝试绘制左下角
// if (vertex.leftBelow == null && vertex.below != null && vertex.left != null) {
// triangles.Add(CreateDataTriangle(vertex, vertex.below, vertex.left));
// }
// vertexs.Add(vertex);
//});
//plateBaking.triangles = triangles;
//plateBaking.vertexs = vertexs.ToArray();
}
/// <summary> 校验性获取网格上的点 </summary>
private void TryGet(GridTool<DataVertex> grid, int x, int y, ref DataVertex vertex) {
private void TryGet(GridTool<DataPlateVertex> grid, int x, int y, ref DataPlateVertex vertex) {
vertex = null;
if (!grid.TryGet(x, y, out DataVertex data)) { return; }
if (!grid.TryGet(x, y, out DataPlateVertex data)) { return; }
if (data.isValid) { vertex = data; }
}
/// <summary> 创建三角形 </summary>
private DataTriangle CreateDataTriangle(DataVertex a, DataVertex b, DataVertex c) {
private DataTriangle CreateDataTriangle(DataPlateVertex a, DataPlateVertex b, DataPlateVertex c) {
DataTriangle triangle = new DataTriangle();
triangle.b = a.design;
triangle.c = b.design;
triangle.a = c.design;
triangle.b = a.position;
triangle.c = b.position;
triangle.a = c.position;
return triangle;
}
}