X-Git-Url: http://git.salome-platform.org/gitweb/?a=blobdiff_plain;f=src%2FGeomAlgoAPI%2FGeomAlgoAPI_SketchBuilder.h;h=4ebeb902963fb0b195ad643300835980eb9f1436;hb=87f348fe7ec3805441bd5524536736eeb2e87501;hp=0d471dd0f3591bbdea4b70c4bb1d6294f2017d63;hpb=3874b57fe5aba25ff5aee2a07654fc23c1ee8eb0;p=modules%2Fshaper.git

diff --git a/src/GeomAlgoAPI/GeomAlgoAPI_SketchBuilder.h b/src/GeomAlgoAPI/GeomAlgoAPI_SketchBuilder.h
index 0d471dd0f..4ebeb9029 100644
--- a/src/GeomAlgoAPI/GeomAlgoAPI_SketchBuilder.h
+++ b/src/GeomAlgoAPI/GeomAlgoAPI_SketchBuilder.h
@@ -23,51 +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<GeomAPI_Pnt>& theOrigin,
                           const std::shared_ptr<GeomAPI_Dir>& theDirX,
-                          const std::shared_ptr<GeomAPI_Dir>& theDirY,
                           const std::shared_ptr<GeomAPI_Dir>& theNorm,
                           const std::list<std::shared_ptr<GeomAPI_Shape> >& theFeatures,
-                          std::list<std::shared_ptr<GeomAPI_Shape> >& theResultFaces,
-                          std::list<std::shared_ptr<GeomAPI_Shape> >& theResultWires);
+                          std::list<std::shared_ptr<GeomAPI_Shape> >& 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<GeomAPI_Pnt>& theOrigin,
                           const std::shared_ptr<GeomAPI_Dir>& theDirX,
-                          const std::shared_ptr<GeomAPI_Dir>& theDirY,
                           const std::shared_ptr<GeomAPI_Dir>& theNorm,
                           const std::shared_ptr<GeomAPI_Shape>& theWire,
                           std::list<std::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
-   */
-  static void fixIntersections(std::list<std::shared_ptr<GeomAPI_Shape> >& theFaces);
 };
 
 #endif