X-Git-Url: http://git.salome-platform.org/gitweb/?a=blobdiff_plain;f=src%2FGeomAlgoAPI%2FGeomAlgoAPI_SketchBuilder.h;h=4ebeb902963fb0b195ad643300835980eb9f1436;hb=f0cec241aae9ca16d86e166f45cb5c4987d2c792;hp=a4da606b137a52c7dbdd99e3df8af420d288efa4;hpb=fc1a9c802c59a0e853dc43125362e513b6f6358f;p=modules%2Fshaper.git diff --git a/src/GeomAlgoAPI/GeomAlgoAPI_SketchBuilder.h b/src/GeomAlgoAPI/GeomAlgoAPI_SketchBuilder.h index a4da606b1..4ebeb9029 100644 --- a/src/GeomAlgoAPI/GeomAlgoAPI_SketchBuilder.h +++ b/src/GeomAlgoAPI/GeomAlgoAPI_SketchBuilder.h @@ -23,49 +23,35 @@ class GEOMALGOAPI_EXPORT GeomAlgoAPI_SketchBuilder { public: - /** \brief Creates list of faces and unclosed wires on basis of the features of the sketch + /** \brief Creates list of faces based on the features of the sketch * \param[in] theOrigin origin point of the sketch * \param[in] theDirX x-direction of the sketch - * \param[in] theDirY y-direction of the sketch * \param[in] theNorm normal of the sketch * \param[in] theFeatures initial features of the sketch * \param[out] theResultFaces faces based on closed wires - * \param[out] theResultWires unclosed wires of the sketch * - * 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. + * The algorithm searches all loops of edges surrounding lesser areas. */ static void createFaces(const std::shared_ptr& theOrigin, const std::shared_ptr& theDirX, const std::shared_ptr& theNorm, const std::list >& theFeatures, - std::list >& theResultFaces, - std::list >& theResultWires); + std::list >& theResultFaces); /** \brief Creates list of faces and unclosed wires on basis of the features of the sketch * \param[in] theOrigin origin point of the sketch * \param[in] theDirX x-direction of the sketch - * \param[in] theDirY y-direction of the sketch * \param[in] theNorm normal of the sketch * \param[in] theWire a wire which contains all edges * \param[out] theResultFaces faces based on closed wires * - * 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. + * The algorithm searches all loops of edges surrounding lesser areas. */ static void createFaces(const std::shared_ptr& theOrigin, const std::shared_ptr& theDirX, const std::shared_ptr& theNorm, const std::shared_ptr& theWire, std::list >& 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 - */ - static void fixIntersections(std::list >& theFaces); }; #endif