- }
-
- // 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();
- }
- }