| 55 | void deleteTriangle(Triangle* tri); |
| 56 | |
| 57 | s32 computeAdjacency(s32 i0, s32 i1, s32 id) |
| 58 | { |
| 59 | s32 adj = -1; |
| 60 | |
| 61 | const size_t count = s_triangles.size(); |
| 62 | Triangle* tri = s_triangles.data(); |
| 63 | for (size_t t = 0; t < count; t++, tri++) |
| 64 | { |
| 65 | if (t == id || !tri->allocated) { continue; } |
| 66 | if ((tri->idx[0] == i1 && tri->idx[1] == i0) || (tri->idx[0] == i0 && tri->idx[1] == i1)) |
| 67 | { |
| 68 | adj = (s32)t; |
| 69 | tri->adj[0] = id; |
| 70 | break; |
| 71 | } |
| 72 | else if ((tri->idx[1] == i1 && tri->idx[2] == i0) || (tri->idx[1] == i0 && tri->idx[2] == i1)) |
| 73 | { |
| 74 | adj = (s32)t; |
| 75 | tri->adj[1] = id; |
| 76 | break; |
| 77 | } |
| 78 | else if ((tri->idx[2] == i1 && tri->idx[0] == i0) || (tri->idx[2] == i0 && tri->idx[0] == i1)) |
| 79 | { |
| 80 | adj = (s32)t; |
| 81 | tri->adj[2] = id; |
| 82 | break; |
| 83 | } |
| 84 | } |
| 85 | return adj; |
| 86 | } |
| 87 | |
| 88 | void addTriangle(s32 i0, s32 i1, s32 i2) |
| 89 | { |
no test coverage detected