Fix triangles crossing over in tube mesh builder

master
Jeremy HU 2022-10-15 22:52:10 +11:00
parent 978c2bf744
commit 2a602a031f
1 changed files with 16 additions and 1 deletions

View File

@ -144,12 +144,27 @@ void TubeMeshBuilder::build()
size_t i = (j + cutFaceIndices.size() - 1) % cutFaceIndices.size(); size_t i = (j + cutFaceIndices.size() - 1) % cutFaceIndices.size();
const auto &cutFaceI = cutFaceIndices[i]; const auto &cutFaceI = cutFaceIndices[i];
const auto &cutFaceJ = cutFaceIndices[j]; const auto &cutFaceJ = cutFaceIndices[j];
for (size_t m = 0; m < cutFaceI.size(); ++m) { size_t halfSize = cutFaceI.size() / 2;
for (size_t m = 0; m < halfSize; ++m) {
size_t n = (m + 1) % cutFaceI.size(); size_t n = (m + 1) % cutFaceI.size();
// KEEP QUAD ORDER TO MAKE THE TRIANLES NO CROSSING OVER ON EACH SIDE (1)
// The following quad vertices should follow the order strictly,
// This will group two points from I, and one point from J as a triangle in the later quad to triangles processing.
// If not follow this order, the front triangle and back triangle maybe cross over because of not be parallel.
m_generatedFaces.emplace_back(std::vector<size_t> { m_generatedFaces.emplace_back(std::vector<size_t> {
cutFaceI[m], cutFaceI[n], cutFaceJ[n], cutFaceJ[m] cutFaceI[m], cutFaceI[n], cutFaceJ[n], cutFaceJ[m]
}); });
} }
for (size_t m = halfSize; m < cutFaceI.size(); ++m) {
size_t n = (m + 1) % cutFaceI.size();
// KEEP QUAD ORDER TO MAKE THE TRIANLES NO CROSSING OVER ON EACH SIDE (2)
// The following quad vertices should follow the order strictly,
// This will group two points from I, and one point from J as a triangle in the later quad to triangles processing.
// If not follow this order, the front triangle and back triangle maybe cross over because of not be parallel.
m_generatedFaces.emplace_back(std::vector<size_t> {
cutFaceJ[m], cutFaceI[m], cutFaceI[n], cutFaceJ[n]
});
}
} }
if (!m_isCircle) { if (!m_isCircle) {
m_generatedFaces.emplace_back(cutFaceIndices.back()); m_generatedFaces.emplace_back(cutFaceIndices.back());