- }
-
- // When the orientation is correct or the edges looped through
- // the first element, create new face and remove unnecessary edges.
- TopoDS_Face aPatch;
- createFace(*aVertIter, anEdgeIter, aProcEdges.end(), aPlane, aPatch);
- if (!aPatch.IsNull()) {
- std::shared_ptr<GeomAPI_Shape> aFace(new GeomAPI_Shape);
- aFace->setImpl(new TopoDS_Face(aPatch));
- theResultFaces.push_back(aFace);
- }
- // push the edges used in the loop to the map
- std::list<TopoDS_Edge>::iterator anIter;
- for (anIter = anEdgeIter; anIter != aProcEdges.end(); anIter++)
- anEdgesInLoops.insert(&(*anIter));
- // remove unnecessary edges
- std::list<TopoDS_Vertex>::iterator aCopyVLoop = aVertIter;
- std::list<TopoDS_Edge>::iterator aCopyELoop = anEdgeIter;
- removeWasteEdges(aVertIter, anEdgeIter, aProcVertexes.end(), aProcEdges.end(), aMapVE);
-
- // revert the list of remaining edges
- std::list<TopoDS_Vertex> aRemainVertexes;
- for (; aVertIter != aProcVertexes.end(); aVertIter++)
- aRemainVertexes.push_front(*aVertIter);
- std::list<TopoDS_Edge> aRemainEdges;
- for (; anEdgeIter != aProcEdges.end(); anEdgeIter++)
- aRemainEdges.push_front(*anEdgeIter);
- // remove edges and vertexes used in the loop and add remaining ones
- if (aCopyVLoop != aProcVertexes.begin()) {
- aVertIter = aCopyVLoop;
- aVertIter--;
- } else
- aVertIter = aProcVertexes.end();
- aProcVertexes.erase(aCopyVLoop, aProcVertexes.end());
- aProcVertexes.insert(aProcVertexes.end(), aRemainVertexes.begin(), aRemainVertexes.end());
- if (aCopyELoop != aProcEdges.begin()) {
- anEdgeIter = aCopyELoop;
- anEdgeIter--;
- } else
- anEdgeIter = aProcEdges.end();
- aProcEdges.erase(aCopyELoop, aProcEdges.end());
- aProcEdges.insert(aProcEdges.end(), aRemainEdges.begin(), aRemainEdges.end());
-
- if (aVertIter == aProcVertexes.end())
- aVertIter = aProcVertexes.begin();
- else
- aVertIter++;
- if (anEdgeIter == aProcEdges.end())
- anEdgeIter = aProcEdges.begin();
- else
- anEdgeIter++;
- aCopyVLoop = aVertIter;
- aCopyELoop = anEdgeIter;
-
- if (aVertIter != aProcVertexes.end() &&
- aMapVE.Contains(*aVertIter) && aMapVE.FindFromKey(*aVertIter).Extent() <= 1)
- removeWasteEdges(aVertIter, anEdgeIter, aProcVertexes.end(), aProcEdges.end(), aMapVE);
- if (aCopyVLoop != aVertIter)
- aProcVertexes.erase(aCopyVLoop, aVertIter);
- if (aCopyELoop != anEdgeIter)
- aProcEdges.erase(aCopyELoop, anEdgeIter);
-
- // Check whether the next vertex already exists
- if (aVertIter != aProcVertexes.end())
- aVertIter++;
- if (aVertIter != aProcVertexes.end() && anEdgeIter != aProcEdges.end()) {
- aNextVertex = *aVertIter;
- aNextDir = getOuterEdgeDirection(*anEdgeIter, aNextVertex);
- aProcVertexes.erase(++aVertIter, aProcVertexes.end());
- aProcEdges.erase(++anEdgeIter, aProcEdges.end());
- } else {
- // Recalculate current vertex and current direction
- aProcEdges.clear();
- aProcVertexes.clear();
- if (aMapVE.Extent() > 0) {
- aNextVertex = findStartVertex(aMapVE, aDirX, aDirY);
- aProcVertexes.push_back(aNextVertex);
- }
- aNextDir = aDirY.Reversed();
- aCurNorm = aNorm.Reversed();
- }
- }
-
- // if next vertex connected only to alone edge, this is a part of wire (not a closed loop),
- // we need to go back through the list of already checked edges to find a branching vertex
- if (!aMapVE.IsEmpty() && aMapVE.Contains(aNextVertex)
- && aMapVE.FindFromKey(aNextVertex).Size() == 1) {
- std::list<TopoDS_Vertex>::reverse_iterator aVRIter = aProcVertexes.rbegin();
- std::list<TopoDS_Edge>::reverse_iterator aERIter = aProcEdges.rbegin();
- if (aVRIter != aProcVertexes.rend())
- aVRIter++;
- if (aERIter != aProcEdges.rend())
- aERIter++;
-
- for (; aERIter != aProcEdges.rend(); aERIter++, aVRIter++)
- if (aMapVE.FindFromKey(*aVRIter).Size() > 2)
- break;
- if (aERIter != aProcEdges.rend()
- || (aVRIter != aProcVertexes.rend() && aMapVE.FindFromKey(*aVRIter).Size() == 1)) { // the branching vertex was found or current list of edges is a wire without branches
- std::list<TopoDS_Edge>::iterator aEIter;
- TopoDS_Edge aCurEdge;
- if (aERIter != aProcEdges.rend()) {
- aEIter = aERIter.base();
- aCurEdge = *aERIter;
- } else
- aEIter = aProcEdges.begin();
- std::list<TopoDS_Wire> aTail;
- createWireList(*aVRIter, aEIter, aProcEdges.end(), anEdgesInLoops, aTail);
- std::list<TopoDS_Wire>::const_iterator aTailIter = aTail.begin();
- for (; aTailIter != aTail.end(); aTailIter++)
- if (!aTailIter->IsNull()) {
- std::shared_ptr<GeomAPI_Shape> aWire(new GeomAPI_Shape);
- aWire->setImpl(new TopoDS_Shape(*aTailIter));
- theResultWires.push_back(aWire);
- }
- std::list<TopoDS_Vertex>::iterator aVIter = aVRIter.base();
- std::list<TopoDS_Edge>::iterator aEItCopy = aEIter;
- removeWasteEdges(--aVIter, aEItCopy, aProcVertexes.end(), aProcEdges.end(), aMapVE);
-
- aProcEdges.erase(aEIter, aProcEdges.end());
- aVIter = aVRIter.base();
- aProcVertexes.erase(aVIter, aProcVertexes.end());
-
- if (!aProcVertexes.empty()) {
- aNextVertex = aProcVertexes.back();
- if (!aCurEdge.IsNull())
- aNextDir = getOuterEdgeDirection(aCurEdge, aNextVertex);
- }
- } else { // there is no branching vertex in the list of proceeded,
- // so we should revert the list and go the opposite way
- aProcVertexes.reverse();
- aProcEdges.reverse();
- aNextVertex = aProcVertexes.back();
- aNextDir =
- aProcEdges.empty() ? aDirY : getOuterEdgeDirection(aProcEdges.back(), aNextVertex);
- }
- }