#include #include #include #include #include #include #include #include #include #include "meshgenerator.h" #include "util.h" #include "trianglesourcenoderesolve.h" #include "cutface.h" #include "parttarget.h" #include "theme.h" #include "partbase.h" MeshGenerator::MeshGenerator(Snapshot *snapshot) : m_snapshot(snapshot) { } MeshGenerator::~MeshGenerator() { for (auto &it: m_partPreviewMeshes) delete it.second; delete m_resultMesh; delete m_snapshot; delete m_outcome; delete m_cutFaceTransforms; delete m_nodesCutFaces; } bool MeshGenerator::isSucceed() { return m_isSucceed; } MeshLoader *MeshGenerator::takeResultMesh() { MeshLoader *resultMesh = m_resultMesh; m_resultMesh = nullptr; return resultMesh; } MeshLoader *MeshGenerator::takePartPreviewMesh(const QUuid &partId) { MeshLoader *resultMesh = m_partPreviewMeshes[partId]; m_partPreviewMeshes[partId] = nullptr; return resultMesh; } const std::set &MeshGenerator::generatedPreviewPartIds() { return m_generatedPreviewPartIds; } Outcome *MeshGenerator::takeOutcome() { Outcome *outcome = m_outcome; m_outcome = nullptr; return outcome; } std::map *MeshGenerator::takeCutFaceTransforms() { auto cutFaceTransforms = m_cutFaceTransforms; m_cutFaceTransforms = nullptr; return cutFaceTransforms; } std::map> *MeshGenerator::takeNodesCutFaces() { auto nodesCutFaces = m_nodesCutFaces; m_nodesCutFaces = nullptr; return nodesCutFaces; } void MeshGenerator::collectParts() { for (const auto &node: m_snapshot->nodes) { QString partId = valueOfKeyInMapOrEmpty(node.second, "partId"); if (partId.isEmpty()) continue; m_partNodeIds[partId].insert(node.first); } for (const auto &edge: m_snapshot->edges) { QString partId = valueOfKeyInMapOrEmpty(edge.second, "partId"); if (partId.isEmpty()) continue; m_partEdgeIds[partId].insert(edge.first); } } bool MeshGenerator::checkIsPartDirty(const QString &partIdString) { auto findPart = m_snapshot->parts.find(partIdString); if (findPart == m_snapshot->parts.end()) { qDebug() << "Find part failed:" << partIdString; return false; } return isTrueValueString(valueOfKeyInMapOrEmpty(findPart->second, "dirty")); } bool MeshGenerator::checkIsPartDependencyDirty(const QString &partIdString) { auto findPart = m_snapshot->parts.find(partIdString); if (findPart == m_snapshot->parts.end()) { qDebug() << "Find part failed:" << partIdString; return false; } QString cutFaceString = valueOfKeyInMapOrEmpty(findPart->second, "cutFace"); QUuid cutFaceLinkedPartId = QUuid(cutFaceString); if (cutFaceLinkedPartId.isNull()) return false; return checkIsPartDirty(cutFaceString); } bool MeshGenerator::checkIsComponentDirty(const QString &componentIdString) { bool isDirty = false; const std::map *component = &m_snapshot->rootComponent; if (componentIdString != QUuid().toString()) { auto findComponent = m_snapshot->components.find(componentIdString); if (findComponent == m_snapshot->components.end()) { qDebug() << "Component not found:" << componentIdString; return isDirty; } component = &findComponent->second; } if (isTrueValueString(valueOfKeyInMapOrEmpty(*component, "dirty"))) { isDirty = true; } QString linkDataType = valueOfKeyInMapOrEmpty(*component, "linkDataType"); if ("partId" == linkDataType) { QString partId = valueOfKeyInMapOrEmpty(*component, "linkData"); if (checkIsPartDirty(partId)) { m_dirtyPartIds.insert(partId); isDirty = true; } if (!isDirty) { if (checkIsPartDependencyDirty(partId)) { isDirty = true; } } } for (const auto &childId: valueOfKeyInMapOrEmpty(*component, "children").split(",")) { if (childId.isEmpty()) continue; if (checkIsComponentDirty(childId)) { isDirty = true; } } if (isDirty) m_dirtyComponentIds.insert(componentIdString); return isDirty; } void MeshGenerator::checkDirtyFlags() { checkIsComponentDirty(QUuid().toString()); } nodemesh::Combiner::Mesh *MeshGenerator::combinePartMesh(const QString &partIdString) { auto findPart = m_snapshot->parts.find(partIdString); if (findPart == m_snapshot->parts.end()) { qDebug() << "Find part failed:" << partIdString; return nullptr; } QUuid partId = QUuid(partIdString); auto &part = findPart->second; bool isDisabled = isTrueValueString(valueOfKeyInMapOrEmpty(part, "disabled")); bool xMirrored = isTrueValueString(valueOfKeyInMapOrEmpty(part, "xMirrored")); bool subdived = isTrueValueString(valueOfKeyInMapOrEmpty(part, "subdived")); bool rounded = isTrueValueString(valueOfKeyInMapOrEmpty(part, "rounded")); bool chamfered = isTrueValueString(valueOfKeyInMapOrEmpty(part, "chamfered")); QString colorString = valueOfKeyInMapOrEmpty(part, "color"); QColor partColor = colorString.isEmpty() ? m_defaultPartColor : QColor(colorString); float deformThickness = 1.0; float deformWidth = 1.0; float cutRotation = 0.0; auto target = PartTargetFromString(valueOfKeyInMapOrEmpty(part, "target").toUtf8().constData()); auto base = PartBaseFromString(valueOfKeyInMapOrEmpty(part, "base").toUtf8().constData()); std::map cutTemplateMapByName; std::vector cutTemplate; QString cutFaceString = valueOfKeyInMapOrEmpty(part, "cutFace"); QUuid cutFaceLinkedPartId = QUuid(cutFaceString); if (!cutFaceLinkedPartId.isNull()) { std::map> cutFaceNodeMap; auto findCutFaceLinkedPart = m_snapshot->parts.find(cutFaceString); if (findCutFaceLinkedPart == m_snapshot->parts.end()) { qDebug() << "Find cut face linked part failed:" << cutFaceString; } else { // Build node info map for (const auto &nodeIdString: m_partNodeIds[cutFaceString]) { auto findNode = m_snapshot->nodes.find(nodeIdString); if (findNode == m_snapshot->nodes.end()) { qDebug() << "Find node failed:" << nodeIdString; continue; } auto &node = findNode->second; float radius = valueOfKeyInMapOrEmpty(node, "radius").toFloat(); float x = (valueOfKeyInMapOrEmpty(node, "x").toFloat() - m_mainProfileMiddleX); float y = (m_mainProfileMiddleY - valueOfKeyInMapOrEmpty(node, "y").toFloat()); cutFaceNodeMap.insert({nodeIdString, std::make_tuple(radius, x, y)}); } // Build edge link std::map> cutFaceNodeLinkMap; for (const auto &edgeIdString: m_partEdgeIds[cutFaceString]) { auto findEdge = m_snapshot->edges.find(edgeIdString); if (findEdge == m_snapshot->edges.end()) { qDebug() << "Find edge failed:" << edgeIdString; continue; } auto &edge = findEdge->second; QString fromNodeIdString = valueOfKeyInMapOrEmpty(edge, "from"); QString toNodeIdString = valueOfKeyInMapOrEmpty(edge, "to"); cutFaceNodeLinkMap[fromNodeIdString].push_back(toNodeIdString); cutFaceNodeLinkMap[toNodeIdString].push_back(fromNodeIdString); } // Find endpoint QString endPointNodeIdString; std::vector>> endpointNodes; for (const auto &it: cutFaceNodeLinkMap) { if (1 == it.second.size()) { const auto &findNode = cutFaceNodeMap.find(it.first); if (findNode != cutFaceNodeMap.end()) endpointNodes.push_back({it.first, findNode->second}); } } bool isRing = endpointNodes.empty(); if (endpointNodes.empty()) { for (const auto &it: cutFaceNodeMap) { endpointNodes.push_back({it.first, it.second}); } } if (!endpointNodes.empty()) { std::sort(endpointNodes.begin(), endpointNodes.end(), []( const std::pair> &first, const std::pair> &second) { const auto &firstX = std::get<1>(first.second); const auto &secondX = std::get<1>(second.second); if (firstX < secondX) { return true; } else if (firstX > secondX) { return false; } else { const auto &firstY = std::get<2>(first.second); const auto &secondY = std::get<2>(second.second); if (firstY > secondY) { return true; } else if (firstY < secondY) { return false; } else { const auto &firstRadius = std::get<0>(first.second); const auto &secondRadius = std::get<0>(second.second); if (firstRadius < secondRadius) { return true; } else if (firstRadius > secondRadius) { return false; } else { return false; } } } }); endPointNodeIdString = endpointNodes[0].first; } // Loop all linked nodes std::vector> cutFaceNodes; std::set cutFaceVisitedNodeIds; std::function loopNodeLink; loopNodeLink = [&](const QString &fromNodeIdString) { auto findCutFaceNode = cutFaceNodeMap.find(fromNodeIdString); if (findCutFaceNode == cutFaceNodeMap.end()) return; if (cutFaceVisitedNodeIds.find(fromNodeIdString) != cutFaceVisitedNodeIds.end()) return; cutFaceVisitedNodeIds.insert(fromNodeIdString); cutFaceNodes.push_back({std::get<0>(findCutFaceNode->second), std::get<1>(findCutFaceNode->second), std::get<2>(findCutFaceNode->second), fromNodeIdString}); auto findNeighbor = cutFaceNodeLinkMap.find(fromNodeIdString); if (findNeighbor == cutFaceNodeLinkMap.end()) return; for (const auto &it: findNeighbor->second) { if (cutFaceVisitedNodeIds.find(it) == cutFaceVisitedNodeIds.end()) { loopNodeLink(it); break; } } }; if (!endPointNodeIdString.isEmpty()) { loopNodeLink(endPointNodeIdString); } // Fetch points from linked nodes std::vector cutTemplateNames; cutFacePointsFromNodes(cutTemplate, cutFaceNodes, isRing, &cutTemplateNames); for (size_t i = 0; i < cutTemplateNames.size(); ++i) { cutTemplateMapByName.insert({cutTemplateNames[i], cutTemplate[i]}); } } } if (cutTemplate.size() < 3) { CutFace cutFace = CutFaceFromString(cutFaceString.toUtf8().constData()); cutTemplate = CutFaceToPoints(cutFace); cutTemplateMapByName.clear(); for (size_t i = 0; i < cutTemplate.size(); ++i) { cutTemplateMapByName.insert({cutFaceString + "/" + QString::number(i + 1), cutTemplate[i]}); } } if (chamfered) nodemesh::chamferFace2D(&cutTemplate); QString cutRotationString = valueOfKeyInMapOrEmpty(part, "cutRotation"); if (!cutRotationString.isEmpty()) { cutRotation = cutRotationString.toFloat(); } QString thicknessString = valueOfKeyInMapOrEmpty(part, "deformThickness"); if (!thicknessString.isEmpty()) { deformThickness = thicknessString.toFloat(); } QString widthString = valueOfKeyInMapOrEmpty(part, "deformWidth"); if (!widthString.isEmpty()) { deformWidth = widthString.toFloat(); } QUuid materialId; QString materialIdString = valueOfKeyInMapOrEmpty(part, "materialId"); if (!materialIdString.isEmpty()) materialId = QUuid(materialIdString); float colorSolubility = 0; QString colorSolubilityString = valueOfKeyInMapOrEmpty(part, "colorSolubility"); if (!colorSolubilityString.isEmpty()) colorSolubility = colorSolubilityString.toFloat(); auto &partCache = m_cacheContext->parts[partIdString]; partCache.outcomeNodes.clear(); partCache.outcomeNodeVertices.clear(); partCache.vertices.clear(); partCache.faces.clear(); partCache.previewTriangles.clear(); partCache.isSucceed = false; delete partCache.mesh; partCache.mesh = nullptr; struct NodeInfo { float radius = 0; QVector3D position; BoneMark boneMark = BoneMark::None; }; std::map nodeInfos; for (const auto &nodeIdString: m_partNodeIds[partIdString]) { auto findNode = m_snapshot->nodes.find(nodeIdString); if (findNode == m_snapshot->nodes.end()) { qDebug() << "Find node failed:" << nodeIdString; continue; } auto &node = findNode->second; float radius = valueOfKeyInMapOrEmpty(node, "radius").toFloat(); float x = (valueOfKeyInMapOrEmpty(node, "x").toFloat() - m_mainProfileMiddleX); float y = (m_mainProfileMiddleY - valueOfKeyInMapOrEmpty(node, "y").toFloat()); float z = (m_sideProfileMiddleX - valueOfKeyInMapOrEmpty(node, "z").toFloat()); BoneMark boneMark = BoneMarkFromString(valueOfKeyInMapOrEmpty(node, "boneMark").toUtf8().constData()); auto &nodeInfo = nodeInfos[nodeIdString]; nodeInfo.position = QVector3D(x, y, z); nodeInfo.radius = radius; nodeInfo.boneMark = boneMark; } std::set> edges; for (const auto &edgeIdString: m_partEdgeIds[partIdString]) { auto findEdge = m_snapshot->edges.find(edgeIdString); if (findEdge == m_snapshot->edges.end()) { qDebug() << "Find edge failed:" << edgeIdString; continue; } auto &edge = findEdge->second; QString fromNodeIdString = valueOfKeyInMapOrEmpty(edge, "from"); QString toNodeIdString = valueOfKeyInMapOrEmpty(edge, "to"); const auto &findFromNodeInfo = nodeInfos.find(fromNodeIdString); if (findFromNodeInfo == nodeInfos.end()) { qDebug() << "Find from-node info failed:" << fromNodeIdString; continue; } const auto &findToNodeInfo = nodeInfos.find(toNodeIdString); if (findToNodeInfo == nodeInfos.end()) { qDebug() << "Find to-node info failed:" << toNodeIdString; continue; } edges.insert({fromNodeIdString, toNodeIdString}); } std::map nodeIdStringToIndexMap; std::map nodeIndexToIdStringMap; nodemesh::Modifier *modifier = new nodemesh::Modifier; QString mirroredPartIdString; QUuid mirroredPartId; if (xMirrored) { mirroredPartId = QUuid().createUuid(); mirroredPartIdString = mirroredPartId.toString(); m_cacheContext->partMirrorIdMap[mirroredPartIdString] = partIdString; } for (const auto &nodeIt: nodeInfos) { const auto &nodeIdString = nodeIt.first; const auto &nodeInfo = nodeIt.second; size_t nodeIndex = modifier->addNode(nodeInfo.position, nodeInfo.radius, cutTemplate); nodeIdStringToIndexMap[nodeIdString] = nodeIndex; nodeIndexToIdStringMap[nodeIndex] = nodeIdString; OutcomeNode outcomeNode; outcomeNode.partId = QUuid(partIdString); outcomeNode.nodeId = QUuid(nodeIdString); outcomeNode.origin = nodeInfo.position; outcomeNode.radius = nodeInfo.radius; outcomeNode.color = partColor; outcomeNode.materialId = materialId; outcomeNode.colorSolubility = colorSolubility; outcomeNode.boneMark = nodeInfo.boneMark; outcomeNode.mirroredByPartId = mirroredPartIdString; partCache.outcomeNodes.push_back(outcomeNode); if (xMirrored) { outcomeNode.partId = mirroredPartId; outcomeNode.mirrorFromPartId = QUuid(partId); outcomeNode.mirroredByPartId = QUuid(); outcomeNode.origin.setX(-nodeInfo.position.x()); partCache.outcomeNodes.push_back(outcomeNode); } } for (const auto &edgeIt: edges) { const QString &fromNodeIdString = edgeIt.first; const QString &toNodeIdString = edgeIt.second; auto findFromNodeIndex = nodeIdStringToIndexMap.find(fromNodeIdString); if (findFromNodeIndex == nodeIdStringToIndexMap.end()) { qDebug() << "Find from-node failed:" << fromNodeIdString; continue; } auto findToNodeIndex = nodeIdStringToIndexMap.find(toNodeIdString); if (findToNodeIndex == nodeIdStringToIndexMap.end()) { qDebug() << "Find to-node failed:" << toNodeIdString; continue; } modifier->addEdge(findFromNodeIndex->second, findToNodeIndex->second); } if (subdived) modifier->subdivide(); if (rounded) modifier->roundEnd(); modifier->finalize(); nodemesh::Builder *builder = new nodemesh::Builder; builder->setDeformThickness(deformThickness); builder->setDeformWidth(deformWidth); builder->setCutRotation(cutRotation); if (PartBase::YZ == base) { builder->enableBaseNormalOnX(false); } else if (PartBase::Average == base) { builder->enableBaseNormalAverage(true); } else if (PartBase::XY == base) { builder->enableBaseNormalOnZ(false); } else if (PartBase::ZX == base) { builder->enableBaseNormalOnY(false); } std::vector builderNodeIndices; for (const auto &node: modifier->nodes()) builderNodeIndices.push_back(builder->addNode(node.position, node.radius, node.cutTemplate)); for (const auto &edge: modifier->edges()) builder->addEdge(edge.firstNodeIndex, edge.secondNodeIndex); bool buildSucceed = builder->build(); for (size_t i = 0; i < modifier->nodes().size(); ++i) { const auto &node = modifier->nodes()[i]; if (!node.isOriginal) continue; const QString &nodeIdString = nodeIndexToIdStringMap[node.originNodeIndex]; const nodemesh::Builder::CutFaceTransform *cutFaceTransform = builder->nodeAdjustableCutFaceTransform(builderNodeIndices[i]); if (nullptr != cutFaceTransform && PartTarget::Model == target) { QUuid nodeId = QUuid(nodeIdString); m_cutFaceTransforms->insert({nodeId, *cutFaceTransform}); m_nodesCutFaces->insert({nodeId, cutTemplateMapByName}); } } partCache.vertices = builder->generatedVertices(); partCache.faces = builder->generatedFaces(); for (size_t i = 0; i < partCache.vertices.size(); ++i) { const auto &position = partCache.vertices[i]; const auto &source = builder->generatedVerticesSourceNodeIndices()[i]; size_t nodeIndex = modifier->nodes()[source].originNodeIndex; const auto &nodeIdString = nodeIndexToIdStringMap[nodeIndex]; partCache.outcomeNodeVertices.push_back({position, {partIdString, nodeIdString}}); } bool hasMeshError = false; nodemesh::Combiner::Mesh *mesh = nullptr; if (buildSucceed) { mesh = new nodemesh::Combiner::Mesh(partCache.vertices, partCache.faces); if (!mesh->isNull()) { if (xMirrored) { std::vector xMirroredVertices; std::vector> xMirroredFaces; makeXmirror(partCache.vertices, partCache.faces, &xMirroredVertices, &xMirroredFaces); for (size_t i = 0; i < xMirroredVertices.size(); ++i) { const auto &position = xMirroredVertices[i]; const auto &source = builder->generatedVerticesSourceNodeIndices()[i]; size_t nodeIndex = modifier->nodes()[source].originNodeIndex; const auto &nodeIdString = nodeIndexToIdStringMap[nodeIndex]; partCache.outcomeNodeVertices.push_back({position, {mirroredPartIdString, nodeIdString}}); } size_t xMirrorStart = partCache.vertices.size(); for (const auto &vertex: xMirroredVertices) partCache.vertices.push_back(vertex); for (const auto &face: xMirroredFaces) { std::vector newFace = face; for (auto &it: newFace) it += xMirrorStart; partCache.faces.push_back(newFace); } nodemesh::Combiner::Mesh *xMirroredMesh = new nodemesh::Combiner::Mesh(xMirroredVertices, xMirroredFaces); nodemesh::Combiner::Mesh *newMesh = combineTwoMeshes(*mesh, *xMirroredMesh, nodemesh::Combiner::Method::Union); delete xMirroredMesh; if (newMesh && !newMesh->isNull()) { delete mesh; mesh = newMesh; } else { hasMeshError = true; qDebug() << "Xmirrored mesh generate failed"; delete newMesh; } } } else { hasMeshError = true; qDebug() << "Mesh built is uncombinable"; } } else { hasMeshError = true; qDebug() << "Mesh build failed"; } m_partPreviewMeshes[partId] = nullptr; m_generatedPreviewPartIds.insert(partId); std::vector partPreviewVertices; QColor partPreviewColor = partColor; if (nullptr != mesh) { partCache.mesh = new nodemesh::Combiner::Mesh(*mesh); mesh->fetch(partPreviewVertices, partCache.previewTriangles); partCache.isSucceed = true; } if (partCache.previewTriangles.empty()) { partPreviewVertices = partCache.vertices; nodemesh::triangulate(partPreviewVertices, partCache.faces, partCache.previewTriangles); partPreviewColor = Qt::red; partCache.isSucceed = false; } nodemesh::trim(&partPreviewVertices, true); for (auto &it: partPreviewVertices) { it *= 2.0; } std::vector partPreviewTriangleNormals; for (const auto &face: partCache.previewTriangles) { partPreviewTriangleNormals.push_back(QVector3D::normal( partPreviewVertices[face[0]], partPreviewVertices[face[1]], partPreviewVertices[face[2]] )); } std::vector> partPreviewTriangleVertexNormals; generateSmoothTriangleVertexNormals(partPreviewVertices, partCache.previewTriangles, partPreviewTriangleNormals, &partPreviewTriangleVertexNormals); if (!partCache.previewTriangles.empty()) { if (target == PartTarget::CutFace) partPreviewColor = Theme::red; m_partPreviewMeshes[partId] = new MeshLoader(partPreviewVertices, partCache.previewTriangles, partPreviewTriangleVertexNormals, partPreviewColor); } delete builder; delete modifier; if (mesh && mesh->isNull()) { delete mesh; mesh = nullptr; } if (isDisabled) { delete mesh; mesh = nullptr; } if (target != PartTarget::Model) { delete mesh; mesh = nullptr; } if (hasMeshError && target == PartTarget::Model) { m_isSucceed = false; } return mesh; } const std::map *MeshGenerator::findComponent(const QString &componentIdString) { const std::map *component = &m_snapshot->rootComponent; if (componentIdString != QUuid().toString()) { auto findComponent = m_snapshot->components.find(componentIdString); if (findComponent == m_snapshot->components.end()) { qDebug() << "Component not found:" << componentIdString; return nullptr; } return &findComponent->second; } return component; } CombineMode MeshGenerator::componentCombineMode(const std::map *component) { if (nullptr == component) return CombineMode::Normal; CombineMode combineMode = CombineModeFromString(valueOfKeyInMapOrEmpty(*component, "combineMode").toUtf8().constData()); if (combineMode == CombineMode::Normal) { if (isTrueValueString(valueOfKeyInMapOrEmpty(*component, "inverse"))) combineMode = CombineMode::Inversion; } return combineMode; } QString MeshGenerator::componentColorName(const std::map *component) { if (nullptr == component) return QString(); QString linkDataType = valueOfKeyInMapOrEmpty(*component, "linkDataType"); if ("partId" == linkDataType) { QString partIdString = valueOfKeyInMapOrEmpty(*component, "linkData"); auto findPart = m_snapshot->parts.find(partIdString); if (findPart == m_snapshot->parts.end()) { qDebug() << "Find part failed:" << partIdString; return QString(); } auto &part = findPart->second; QString colorSolubility = valueOfKeyInMapOrEmpty(part, "colorSolubility"); if (!colorSolubility.isEmpty()) { return QString("+"); } QString colorName = valueOfKeyInMapOrEmpty(part, "color"); if (colorName.isEmpty()) return QString("-"); return colorName; } return QString(); } nodemesh::Combiner::Mesh *MeshGenerator::combineComponentMesh(const QString &componentIdString, CombineMode *combineMode) { nodemesh::Combiner::Mesh *mesh = nullptr; QUuid componentId; const std::map *component = &m_snapshot->rootComponent; if (componentIdString != QUuid().toString()) { componentId = QUuid(componentIdString); auto findComponent = m_snapshot->components.find(componentIdString); if (findComponent == m_snapshot->components.end()) { qDebug() << "Component not found:" << componentIdString; return nullptr; } component = &findComponent->second; } *combineMode = componentCombineMode(component); auto &componentCache = m_cacheContext->components[componentIdString]; if (m_cacheEnabled) { if (m_dirtyComponentIds.find(componentIdString) == m_dirtyComponentIds.end()) { if (nullptr != componentCache.mesh) return new nodemesh::Combiner::Mesh(*componentCache.mesh); } } componentCache.sharedQuadEdges.clear(); componentCache.noneSeamVertices.clear(); componentCache.outcomeNodes.clear(); componentCache.outcomeNodeVertices.clear(); delete componentCache.mesh; componentCache.mesh = nullptr; QString linkDataType = valueOfKeyInMapOrEmpty(*component, "linkDataType"); if ("partId" == linkDataType) { QString partIdString = valueOfKeyInMapOrEmpty(*component, "linkData"); mesh = combinePartMesh(partIdString); const auto &partCache = m_cacheContext->parts[partIdString]; for (const auto &vertex: partCache.vertices) componentCache.noneSeamVertices.insert(vertex); collectSharedQuadEdges(partCache.vertices, partCache.faces, &componentCache.sharedQuadEdges); for (const auto &it: partCache.outcomeNodes) componentCache.outcomeNodes.push_back(it); for (const auto &it: partCache.outcomeNodeVertices) componentCache.outcomeNodeVertices.push_back(it); } else { std::vector>>> combineGroups; // Firstly, group by combine mode int currentGroupIndex = -1; auto lastCombineMode = CombineMode::Count; bool foundColorSolubilitySetting = false; for (const auto &childIdString: valueOfKeyInMapOrEmpty(*component, "children").split(",")) { if (childIdString.isEmpty()) continue; const auto &child = findComponent(childIdString); QString colorName = componentColorName(child); if (colorName == "+") { foundColorSolubilitySetting = true; } auto combineMode = componentCombineMode(child); if (lastCombineMode != combineMode || lastCombineMode == CombineMode::Inversion) { qDebug() << "New group[" << currentGroupIndex << "] for combine mode[" << CombineModeToString(combineMode) << "]"; combineGroups.push_back({combineMode, {}}); ++currentGroupIndex; lastCombineMode = combineMode; } if (-1 == currentGroupIndex) { qDebug() << "Should not happen: -1 == currentGroupIndex"; continue; } combineGroups[currentGroupIndex].second.push_back({childIdString, colorName}); } // Secondly, sub group by color std::vector> groupMeshes; for (const auto &group: combineGroups) { std::set used; std::vector> componentIdStrings; int currentSubGroupIndex = -1; auto lastColorName = QString(); for (size_t i = 0; i < group.second.size(); ++i) { if (used.find(i) != used.end()) continue; const auto &colorName = group.second[i].second; if (lastColorName != colorName || lastColorName.isEmpty()) { qDebug() << "New sub group[" << currentSubGroupIndex << "] for color[" << colorName << "]"; componentIdStrings.push_back({}); ++currentSubGroupIndex; lastColorName = colorName; } if (-1 == currentSubGroupIndex) { qDebug() << "Should not happen: -1 == currentSubGroupIndex"; continue; } used.insert(i); componentIdStrings[currentSubGroupIndex].push_back(group.second[i].first); if (colorName.isEmpty()) continue; for (size_t j = i + 1; j < group.second.size(); ++j) { if (used.find(j) != used.end()) continue; const auto &otherColorName = group.second[j].second; if (otherColorName.isEmpty()) continue; if (otherColorName != colorName) continue; used.insert(j); componentIdStrings[currentSubGroupIndex].push_back(group.second[j].first); } } std::vector> multipleMeshes; for (const auto &it: componentIdStrings) { nodemesh::Combiner::Mesh *childMesh = combineComponentChildGroupMesh(it, componentCache); if (nullptr == childMesh) continue; if (childMesh->isNull()) { delete childMesh; continue; } multipleMeshes.push_back({childMesh, CombineMode::Normal}); } nodemesh::Combiner::Mesh *subGroupMesh = combineMultipleMeshes(multipleMeshes, foundColorSolubilitySetting); if (nullptr == subGroupMesh) continue; groupMeshes.push_back({subGroupMesh, group.first}); } mesh = combineMultipleMeshes(groupMeshes, false); } if (nullptr != mesh) componentCache.mesh = new nodemesh::Combiner::Mesh(*mesh); if (nullptr != mesh && mesh->isNull()) { delete mesh; mesh = nullptr; } return mesh; } nodemesh::Combiner::Mesh *MeshGenerator::combineMultipleMeshes(const std::vector> &multipleMeshes, bool recombine) { nodemesh::Combiner::Mesh *mesh = nullptr; for (const auto &it: multipleMeshes) { const auto &childCombineMode = it.second; nodemesh::Combiner::Mesh *subMesh = it.first; //qDebug() << "Combine mode:" << CombineModeToString(childCombineMode); if (nullptr == subMesh) { qDebug() << "Child mesh is null"; continue; } if (subMesh->isNull()) { qDebug() << "Child mesh is uncombinable"; delete subMesh; continue; } if (nullptr == mesh) { //if (childCombineMode == CombineMode::Inversion) { // delete subMesh; //} else { mesh = subMesh; //} } else { nodemesh::Combiner::Mesh *newMesh = combineTwoMeshes(*mesh, *subMesh, childCombineMode == CombineMode::Inversion ? nodemesh::Combiner::Method::Diff : nodemesh::Combiner::Method::Union, recombine); delete subMesh; if (newMesh && !newMesh->isNull()) { delete mesh; mesh = newMesh; } else { m_isSucceed = false; qDebug() << "Mesh combine failed"; delete newMesh; } } } if (nullptr != mesh && mesh->isNull()) { delete mesh; mesh = nullptr; } return mesh; } nodemesh::Combiner::Mesh *MeshGenerator::combineComponentChildGroupMesh(const std::vector &componentIdStrings, GeneratedComponent &componentCache) { std::vector> multipleMeshes; for (const auto &childIdString: componentIdStrings) { CombineMode childCombineMode = CombineMode::Normal; nodemesh::Combiner::Mesh *subMesh = combineComponentMesh(childIdString, &childCombineMode); if (CombineMode::Uncombined == childCombineMode) { delete subMesh; continue; } const auto &childComponentCache = m_cacheContext->components[childIdString]; for (const auto &vertex: childComponentCache.noneSeamVertices) componentCache.noneSeamVertices.insert(vertex); for (const auto &it: childComponentCache.sharedQuadEdges) componentCache.sharedQuadEdges.insert(it); for (const auto &it: childComponentCache.outcomeNodes) componentCache.outcomeNodes.push_back(it); for (const auto &it: childComponentCache.outcomeNodeVertices) componentCache.outcomeNodeVertices.push_back(it); if (nullptr == subMesh || subMesh->isNull()) { delete subMesh; continue; } multipleMeshes.push_back({subMesh, childCombineMode}); } return combineMultipleMeshes(multipleMeshes); } nodemesh::Combiner::Mesh *MeshGenerator::combineTwoMeshes(const nodemesh::Combiner::Mesh &first, const nodemesh::Combiner::Mesh &second, nodemesh::Combiner::Method method, bool recombine) { if (first.isNull() || second.isNull()) return nullptr; std::vector> combinedVerticesSources; nodemesh::Combiner::Mesh *newMesh = nodemesh::Combiner::combine(first, second, method, &combinedVerticesSources); if (nullptr == newMesh) return nullptr; if (!newMesh->isNull() && recombine) { nodemesh::Recombiner recombiner; std::vector combinedVertices; std::vector> combinedFaces; newMesh->fetch(combinedVertices, combinedFaces); recombiner.setVertices(&combinedVertices, &combinedVerticesSources); recombiner.setFaces(&combinedFaces); if (recombiner.recombine()) { if (nodemesh::isManifold(recombiner.regeneratedFaces())) { nodemesh::Combiner::Mesh *reMesh = new nodemesh::Combiner::Mesh(recombiner.regeneratedVertices(), recombiner.regeneratedFaces(), false); if (!reMesh->isNull() && !reMesh->isSelfIntersected()) { delete newMesh; newMesh = reMesh; } else { delete reMesh; } } } } return newMesh; } void MeshGenerator::makeXmirror(const std::vector &sourceVertices, const std::vector> &sourceFaces, std::vector *destVertices, std::vector> *destFaces) { for (const auto &mirrorFrom: sourceVertices) { destVertices->push_back(QVector3D(-mirrorFrom.x(), mirrorFrom.y(), mirrorFrom.z())); } std::vector> newFaces; for (const auto &mirrorFrom: sourceFaces) { auto newFace = mirrorFrom; std::reverse(newFace.begin(), newFace.end()); destFaces->push_back(newFace); } } void MeshGenerator::collectSharedQuadEdges(const std::vector &vertices, const std::vector> &faces, std::set> *sharedQuadEdges) { for (const auto &face: faces) { if (face.size() != 4) continue; sharedQuadEdges->insert({ nodemesh::PositionKey(vertices[face[0]]), nodemesh::PositionKey(vertices[face[2]]) }); sharedQuadEdges->insert({ nodemesh::PositionKey(vertices[face[1]]), nodemesh::PositionKey(vertices[face[3]]) }); } } void MeshGenerator::setGeneratedCacheContext(GeneratedCacheContext *cacheContext) { m_cacheContext = cacheContext; } void MeshGenerator::setSmoothShadingThresholdAngleDegrees(float degrees) { m_smoothShadingThresholdAngleDegrees = degrees; } void MeshGenerator::process() { generate(); this->moveToThread(QGuiApplication::instance()->thread()); emit finished(); } void MeshGenerator::generate() { if (nullptr == m_snapshot) return; m_isSucceed = true; QElapsedTimer countTimeConsumed; countTimeConsumed.start(); m_outcome = new Outcome; m_cutFaceTransforms = new std::map; m_nodesCutFaces = new std::map>; bool needDeleteCacheContext = false; if (nullptr == m_cacheContext) { m_cacheContext = new GeneratedCacheContext; needDeleteCacheContext = true; } else { m_cacheEnabled = true; for (auto it = m_cacheContext->parts.begin(); it != m_cacheContext->parts.end(); ) { if (m_snapshot->parts.find(it->first) == m_snapshot->parts.end()) { auto mirrorFrom = m_cacheContext->partMirrorIdMap.find(it->first); if (mirrorFrom != m_cacheContext->partMirrorIdMap.end()) { if (m_snapshot->parts.find(mirrorFrom->second) != m_snapshot->parts.end()) { it++; continue; } m_cacheContext->partMirrorIdMap.erase(mirrorFrom); } it = m_cacheContext->parts.erase(it); continue; } it++; } for (auto it = m_cacheContext->components.begin(); it != m_cacheContext->components.end(); ) { if (m_snapshot->components.find(it->first) == m_snapshot->components.end()) { it = m_cacheContext->components.erase(it); continue; } it++; } } collectParts(); checkDirtyFlags(); m_dirtyComponentIds.insert(QUuid().toString()); m_mainProfileMiddleX = valueOfKeyInMapOrEmpty(m_snapshot->canvas, "originX").toFloat(); m_mainProfileMiddleY = valueOfKeyInMapOrEmpty(m_snapshot->canvas, "originY").toFloat(); m_sideProfileMiddleX = valueOfKeyInMapOrEmpty(m_snapshot->canvas, "originZ").toFloat(); CombineMode combineMode; auto combinedMesh = combineComponentMesh(QUuid().toString(), &combineMode); const auto &componentCache = m_cacheContext->components[QUuid().toString()]; std::vector combinedVertices; std::vector> combinedFaces; if (nullptr != combinedMesh) { combinedMesh->fetch(combinedVertices, combinedFaces); size_t totalAffectedNum = 0; size_t affectedNum = 0; do { std::vector weldedVertices; std::vector> weldedFaces; affectedNum = nodemesh::weldSeam(combinedVertices, combinedFaces, 0.025, componentCache.noneSeamVertices, weldedVertices, weldedFaces); combinedVertices = weldedVertices; combinedFaces = weldedFaces; totalAffectedNum += affectedNum; } while (affectedNum > 0); qDebug() << "Total weld affected triangles:" << totalAffectedNum; recoverQuads(combinedVertices, combinedFaces, componentCache.sharedQuadEdges, m_outcome->triangleAndQuads); m_outcome->nodes = componentCache.outcomeNodes; m_outcome->nodeVertices = componentCache.outcomeNodeVertices; m_outcome->vertices = combinedVertices; m_outcome->triangles = combinedFaces; } // Recursively check uncombined components collectUncombinedComponent(QUuid().toString()); auto postprocessOutcome = [this](Outcome *outcome) { std::vector combinedFacesNormals; for (const auto &face: outcome->triangles) { combinedFacesNormals.push_back(QVector3D::normal( outcome->vertices[face[0]], outcome->vertices[face[1]], outcome->vertices[face[2]] )); } outcome->triangleNormals = combinedFacesNormals; std::vector> sourceNodes; triangleSourceNodeResolve(*outcome, sourceNodes); outcome->setTriangleSourceNodes(sourceNodes); std::map, QColor> sourceNodeToColorMap; for (const auto &node: outcome->nodes) sourceNodeToColorMap.insert({{node.partId, node.nodeId}, node.color}); outcome->triangleColors.resize(outcome->triangles.size(), Qt::white); const std::vector> *triangleSourceNodes = outcome->triangleSourceNodes(); if (nullptr != triangleSourceNodes) { for (size_t triangleIndex = 0; triangleIndex < outcome->triangles.size(); triangleIndex++) { const auto &source = (*triangleSourceNodes)[triangleIndex]; outcome->triangleColors[triangleIndex] = sourceNodeToColorMap[source]; } } std::vector> triangleVertexNormals; generateSmoothTriangleVertexNormals(outcome->vertices, outcome->triangles, outcome->triangleNormals, &triangleVertexNormals); outcome->setTriangleVertexNormals(triangleVertexNormals); }; postprocessOutcome(m_outcome); m_resultMesh = new MeshLoader(*m_outcome); delete combinedMesh; if (needDeleteCacheContext) { delete m_cacheContext; m_cacheContext = nullptr; } qDebug() << "The mesh generation took" << countTimeConsumed.elapsed() << "milliseconds"; } void MeshGenerator::collectUncombinedComponent(const QString &componentIdString) { const auto &component = findComponent(componentIdString); if (CombineMode::Uncombined == componentCombineMode(component)) { const auto &componentCache = m_cacheContext->components[componentIdString]; if (nullptr == componentCache.mesh || componentCache.mesh->isNull()) { qDebug() << "Uncombined mesh is null"; return; } m_outcome->nodes.insert(m_outcome->nodes.end(), componentCache.outcomeNodes.begin(), componentCache.outcomeNodes.end()); m_outcome->nodeVertices.insert(m_outcome->nodeVertices.end(), componentCache.outcomeNodeVertices.begin(), componentCache.outcomeNodeVertices.end()); std::vector uncombinedVertices; std::vector> uncombinedFaces; componentCache.mesh->fetch(uncombinedVertices, uncombinedFaces); std::vector> uncombinedTriangleAndQuads; recoverQuads(uncombinedVertices, uncombinedFaces, componentCache.sharedQuadEdges, uncombinedTriangleAndQuads); auto vertexStartIndex = m_outcome->vertices.size(); auto updateVertexIndices = [=](std::vector> &faces) { for (auto &it: faces) { for (auto &subIt: it) subIt += vertexStartIndex; } }; updateVertexIndices(uncombinedFaces); updateVertexIndices(uncombinedTriangleAndQuads); m_outcome->vertices.insert(m_outcome->vertices.end(), uncombinedVertices.begin(), uncombinedVertices.end()); m_outcome->triangles.insert(m_outcome->triangles.end(), uncombinedFaces.begin(), uncombinedFaces.end()); m_outcome->triangleAndQuads.insert(m_outcome->triangleAndQuads.end(), uncombinedTriangleAndQuads.begin(), uncombinedTriangleAndQuads.end()); return; } for (const auto &childIdString: valueOfKeyInMapOrEmpty(*component, "children").split(",")) { if (childIdString.isEmpty()) continue; collectUncombinedComponent(childIdString); } } void MeshGenerator::generateSmoothTriangleVertexNormals(const std::vector &vertices, const std::vector> &triangles, const std::vector &triangleNormals, std::vector> *triangleVertexNormals) { std::vector smoothNormals; nodemesh::angleSmooth(vertices, triangles, triangleNormals, m_smoothShadingThresholdAngleDegrees, smoothNormals); triangleVertexNormals->resize(triangles.size(), { QVector3D(), QVector3D(), QVector3D() }); size_t index = 0; for (size_t i = 0; i < triangles.size(); ++i) { auto &normals = (*triangleVertexNormals)[i]; for (size_t j = 0; j < 3; ++j) { if (index < smoothNormals.size()) normals[j] = smoothNormals[index]; ++index; } } } void MeshGenerator::setDefaultPartColor(const QColor &color) { m_defaultPartColor = color; }