- * The algorithm searches all loops of edges surrounding lesser squares.
- * It finds the vertex with minimal coordinates along X axis (theDirX) and then
- * goes through the edges passing the surrounding area on the left.
- */
- static void createFaces(const boost::shared_ptr<GeomAPI_Pnt>& theOrigin,
- const boost::shared_ptr<GeomAPI_Dir>& theDirX,
- const boost::shared_ptr<GeomAPI_Dir>& theDirY,
- const boost::shared_ptr<GeomAPI_Dir>& theNorm,
- const boost::shared_ptr<GeomAPI_Shape>& theWire,
- std::list<boost::shared_ptr<GeomAPI_Shape> >& theResultFaces);
-
- /** \brief Searches intersections between the faces in the list
- * and make holes in the faces to avoid intersections
- * \param[in,out] theFaces list of faces to proccess