| 228 | } |
| 229 | |
| 230 | void addEdge(s32 i0, s32 i1) |
| 231 | { |
| 232 | const size_t count = s_edges.size(); |
| 233 | TriEdge* edge = s_edges.data(); |
| 234 | for (size_t e = 0; e < count; e++, edge++) |
| 235 | { |
| 236 | if ((edge->idx[0] == i0 && edge->idx[1] == i1) || (edge->idx[0] == i1 && edge->idx[1] == i0)) |
| 237 | { |
| 238 | edge->refCount++; |
| 239 | return; |
| 240 | } |
| 241 | } |
| 242 | s_edges.push_back({ i0, i1, 0 }); |
| 243 | } |
| 244 | |
| 245 | void deleteTriangle(Triangle* tri) |
| 246 | { |