elif status == HYP_CONCURENT :
reason = "there are concurrent hypotheses on sub-shapes"
elif status == HYP_BAD_SUBSHAPE :
- reason = "the shape is neither the main one, nor its subshape, nor a valid group"
+ reason = "the shape is neither the main one, nor its sub-shape, nor a valid group"
elif status == HYP_BAD_GEOMETRY:
reason = "geometry mismatches the expectation of the algorithm"
elif status == HYP_HIDDEN_ALGO:
mesh.geompyD.addToStudyInFather( mesh.geom, geom, name )
return
+## Return the first vertex of a geomertical edge by ignoring orienation
+def FirstVertexOnCurve(edge):
+ from geompy import SubShapeAll, ShapeType, KindOfShape, PointCoordinates
+ vv = SubShapeAll( edge, ShapeType["VERTEX"])
+ if not vv:
+ raise TypeError, "Given object has no vertices"
+ if len( vv ) == 1: return vv[0]
+ info = KindOfShape(edge)
+ xyz = info[1:4] # coords of the first vertex
+ xyz1 = PointCoordinates( vv[0] )
+ xyz2 = PointCoordinates( vv[1] )
+ dist1, dist2 = 0,0
+ for i in range(3):
+ dist1 += abs( xyz[i] - xyz1[i] )
+ dist2 += abs( xyz[i] - xyz2[i] )
+ if dist1 < dist2:
+ return vv[0]
+ else:
+ return vv[1]
+
# end of l1_auxiliary
## @}
aMeshes.append(aMesh)
return aMeshes, aStatus
+ ## Creates a Mesh object(s) importing data from the given SAUV file
+ # @return a list of Mesh class instances
+ # @ingroup l2_impexp
+ def CreateMeshesFromSAUV( self,theFileName ):
+ aSmeshMeshes, aStatus = SMESH._objref_SMESH_Gen.CreateMeshesFromSAUV(self,theFileName)
+ aMeshes = []
+ for iMesh in range(len(aSmeshMeshes)) :
+ aMesh = Mesh(self, self.geompyD, aSmeshMeshes[iMesh])
+ aMeshes.append(aMesh)
+ return aMeshes, aStatus
+
## Creates a Mesh object importing data from the given STL file
# @return an instance of Mesh class
# @ingroup l2_impexp
print "Error: The threshold value should be of SALOMEDS.Color type"
return None
pass
- elif CritType in [FT_FreeBorders, FT_FreeEdges, FT_BadOrientedVolume, FT_FreeNodes,
- FT_FreeFaces, FT_LinearOrQuadratic,
+ elif CritType in [FT_FreeBorders, FT_FreeEdges, FT_FreeNodes, FT_FreeFaces,
+ FT_LinearOrQuadratic, FT_BadOrientedVolume,
FT_BareBorderFace, FT_BareBorderVolume,
- FT_OverConstrainedFace, FT_OverConstrainedVolume]:
+ FT_OverConstrainedFace, FT_OverConstrainedVolume,
+ FT_EqualNodes,FT_EqualEdges,FT_EqualFaces,FT_EqualVolumes ]:
# At this point the treshold is unnecessary
if aTreshold == FT_LogicalNOT:
aCriterion.UnaryOp = self.EnumToLong(FT_LogicalNOT)
# @param Treshold the threshold value (range of id ids as string, shape, numeric)
# @param UnaryOp FT_LogicalNOT or FT_Undefined
# @param Tolerance the tolerance used by FT_BelongToGeom, FT_BelongToSurface,
- # FT_LyingOnGeom, FT_CoplanarFaces criteria
+ # FT_LyingOnGeom, FT_CoplanarFaces and FT_EqualNodes criteria
# @return SMESH_Filter
#
# <a href="../tui_filters_page.html#tui_filters">Example of Filters usage</a>
self.mesh = self.smeshpyD.CreateMesh(geom)
## Returns true if the hypotheses are defined well
- # @param theSubObject a subshape of a mesh shape
+ # @param theSubObject a sub-shape of a mesh shape
# @return True or False
# @ingroup l2_construct
def IsReadyToCompute(self, theSubObject):
## Returns errors of hypotheses definition.
# The list of errors is empty if everything is OK.
- # @param theSubObject a subshape of a mesh shape
+ # @param theSubObject a sub-shape of a mesh shape
# @return a list of errors
# @ingroup l2_construct
def GetAlgoState(self, theSubObject):
## Creates a segment discretization 1D algorithm.
# If the optional \a algo parameter is not set, this algorithm is REGULAR.
# \n If the optional \a geom parameter is not set, this algorithm is global.
- # Otherwise, this algorithm defines a submesh based on \a geom subshape.
+ # Otherwise, this algorithm defines a submesh based on \a geom sub-shape.
# @param algo the type of the required algorithm. Possible values are:
# - smesh.REGULAR,
# - smesh.PYTHON for discretization via a python function,
# - smesh.COMPOSITE for meshing a set of edges on one face side as a whole.
- # @param geom If defined is the subshape to be meshed
+ # @param geom If defined is the sub-shape to be meshed
# @return an instance of Mesh_Segment or Mesh_Segment_Python, or Mesh_CompositeSegment class
# @ingroup l3_algos_basic
def Segment(self, algo=REGULAR, geom=0):
## Creates 1D algorithm importing segments conatined in groups of other mesh.
# If the optional \a geom parameter is not set, this algorithm is global.
- # Otherwise, this algorithm defines a submesh based on \a geom subshape.
+ # Otherwise, this algorithm defines a submesh based on \a geom sub-shape.
# @param geom If defined the subshape is to be meshed
# @return an instance of Mesh_UseExistingElements class
# @ingroup l3_algos_basic
## Creates 2D algorithm importing faces conatined in groups of other mesh.
# If the optional \a geom parameter is not set, this algorithm is global.
# Otherwise, this algorithm defines a submesh based on \a geom subshape.
- # @param geom If defined the subshape is to be meshed
+ # @param geom If defined the sub-shape is to be meshed
# @return an instance of Mesh_UseExistingElements class
# @ingroup l3_algos_basic
def UseExisting2DElements(self, geom=0):
# The added nodes and segments must be bound to edges and vertices by
# SetNodeOnVertex(), SetNodeOnEdge() and SetMeshElementOnShape()
# If the optional \a geom parameter is not set, this algorithm is global.
- # \n Otherwise, this algorithm defines a submesh based on \a geom subshape.
- # @param geom the subshape to be manually meshed
+ # \n Otherwise, this algorithm defines a submesh based on \a geom sub-shape.
+ # @param geom the sub-shape to be manually meshed
# @return StdMeshers_UseExisting_1D algorithm that generates nothing
# @ingroup l3_algos_basic
def UseExistingSegments(self, geom=0):
# The added nodes and faces must be bound to geom faces by SetNodeOnFace()
# and SetMeshElementOnShape()
# If the optional \a geom parameter is not set, this algorithm is global.
- # \n Otherwise, this algorithm defines a submesh based on \a geom subshape.
- # @param geom the subshape to be manually meshed
+ # \n Otherwise, this algorithm defines a submesh based on \a geom sub-shape.
+ # @param geom the sub-shape to be manually meshed
# @return StdMeshers_UseExisting_2D algorithm that generates nothing
# @ingroup l3_algos_basic
def UseExistingFaces(self, geom=0):
## Creates a triangle 2D algorithm for faces.
# If the optional \a geom parameter is not set, this algorithm is global.
- # \n Otherwise, this algorithm defines a submesh based on \a geom subshape.
+ # \n Otherwise, this algorithm defines a submesh based on \a geom sub-shape.
# @param algo values are: smesh.MEFISTO || smesh.NETGEN_1D2D || smesh.NETGEN_2D || smesh.BLSURF
- # @param geom If defined, the subshape to be meshed (GEOM_Object)
+ # @param geom If defined, the sub-shape to be meshed (GEOM_Object)
# @return an instance of Mesh_Triangle algorithm
# @ingroup l3_algos_basic
def Triangle(self, algo=MEFISTO, geom=0):
## Creates a quadrangle 2D algorithm for faces.
# If the optional \a geom parameter is not set, this algorithm is global.
- # \n Otherwise, this algorithm defines a submesh based on \a geom subshape.
- # @param geom If defined, the subshape to be meshed (GEOM_Object)
+ # \n Otherwise, this algorithm defines a submesh based on \a geom sub-shape.
+ # @param geom If defined, the sub-shape to be meshed (GEOM_Object)
# @param algo values are: smesh.QUADRANGLE || smesh.RADIAL_QUAD
# @return an instance of Mesh_Quadrangle algorithm
# @ingroup l3_algos_basic
## Creates a tetrahedron 3D algorithm for solids.
# The parameter \a algo permits to choose the algorithm: NETGEN or GHS3D
# If the optional \a geom parameter is not set, this algorithm is global.
- # \n Otherwise, this algorithm defines a submesh based on \a geom subshape.
+ # \n Otherwise, this algorithm defines a submesh based on \a geom sub-shape.
# @param algo values are: smesh.NETGEN, smesh.GHS3D, smesh.GHS3DPRL, smesh.FULL_NETGEN
- # @param geom If defined, the subshape to be meshed (GEOM_Object)
+ # @param geom If defined, the sub-shape to be meshed (GEOM_Object)
# @return an instance of Mesh_Tetrahedron algorithm
# @ingroup l3_algos_basic
def Tetrahedron(self, algo=NETGEN, geom=0):
## Creates a hexahedron 3D algorithm for solids.
# If the optional \a geom parameter is not set, this algorithm is global.
- # \n Otherwise, this algorithm defines a submesh based on \a geom subshape.
+ # \n Otherwise, this algorithm defines a submesh based on \a geom sub-shape.
# @param algo possible values are: smesh.Hexa, smesh.Hexotic
- # @param geom If defined, the subshape to be meshed (GEOM_Object)
+ # @param geom If defined, the sub-shape to be meshed (GEOM_Object)
# @return an instance of Mesh_Hexahedron algorithm
# @ingroup l3_algos_basic
def Hexahedron(self, algo=Hexa, geom=0):
## Creates a projection 1D algorithm for edges.
# If the optional \a geom parameter is not set, this algorithm is global.
- # Otherwise, this algorithm defines a submesh based on \a geom subshape.
- # @param geom If defined, the subshape to be meshed
+ # Otherwise, this algorithm defines a submesh based on \a geom sub-shape.
+ # @param geom If defined, the sub-shape to be meshed
# @return an instance of Mesh_Projection1D algorithm
# @ingroup l3_algos_proj
def Projection1D(self, geom=0):
return Mesh_Projection1D(self, geom)
+ ## Creates a projection 1D-2D algorithm for faces.
+ # If the optional \a geom parameter is not set, this algorithm is global.
+ # Otherwise, this algorithm defines a submesh based on \a geom sub-shape.
+ # @param geom If defined, the sub-shape to be meshed
+ # @return an instance of Mesh_Projection2D algorithm
+ # @ingroup l3_algos_proj
+ def Projection1D2D(self, geom=0):
+ return Mesh_Projection2D(self, geom, "Projection_1D2D")
+
## Creates a projection 2D algorithm for faces.
# If the optional \a geom parameter is not set, this algorithm is global.
- # Otherwise, this algorithm defines a submesh based on \a geom subshape.
- # @param geom If defined, the subshape to be meshed
+ # Otherwise, this algorithm defines a submesh based on \a geom sub-shape.
+ # @param geom If defined, the sub-shape to be meshed
# @return an instance of Mesh_Projection2D algorithm
# @ingroup l3_algos_proj
def Projection2D(self, geom=0):
- return Mesh_Projection2D(self, geom)
+ return Mesh_Projection2D(self, geom, "Projection_2D")
## Creates a projection 3D algorithm for solids.
# If the optional \a geom parameter is not set, this algorithm is global.
- # Otherwise, this algorithm defines a submesh based on \a geom subshape.
- # @param geom If defined, the subshape to be meshed
+ # Otherwise, this algorithm defines a submesh based on \a geom sub-shape.
+ # @param geom If defined, the sub-shape to be meshed
# @return an instance of Mesh_Projection3D algorithm
# @ingroup l3_algos_proj
def Projection3D(self, geom=0):
## Creates a 3D extrusion (Prism 3D) or RadialPrism 3D algorithm for solids.
# If the optional \a geom parameter is not set, this algorithm is global.
- # Otherwise, this algorithm defines a submesh based on \a geom subshape.
- # @param geom If defined, the subshape to be meshed
+ # Otherwise, this algorithm defines a submesh based on \a geom sub-shape.
+ # @param geom If defined, the sub-shape to be meshed
# @return an instance of Mesh_Prism3D or Mesh_RadialPrism3D algorithm
# @ingroup l3_algos_radialp l3_algos_3dextr
def Prism(self, geom=0):
return Mesh_Prism3D(self, geom)
return Mesh_RadialPrism3D(self, geom)
+ ## Creates a "Body Fitted" 3D algorithm for solids, which generates
+ # 3D structured Cartesian mesh in the internal part of a solid shape
+ # and polyhedral volumes near the shape boundary.
+ # If the optional \a geom parameter is not set, this algorithm is global.
+ # Otherwise, this algorithm defines a submesh based on \a geom sub-shape.
+ # The algorithm does not support submeshes.
+ # Generally usage of this algorithm as a local one is useless since
+ # it does not discretize 1D and 2D sub-shapes in a usual way acceptable
+ # for other algorithms.
+ # @param geom If defined, the sub-shape to be meshed
+ # @return an instance of Mesh_Cartesian_3D algorithm
+ # @ingroup l3_algos_basic
+ def BodyFitted(self, geom=0):
+ return Mesh_Cartesian_3D(self, geom)
+
## Evaluates size of prospective mesh on a shape
# @return a list where i-th element is a number of elements of i-th SMESH.EntityType
# To know predicted number of e.g. edges, inquire it this way
TreatHypoStatus( status, hyp_name, geom_name, isAlgo )
return status
+ ## Return True if an algorithm of hypothesis is assigned to a given shape
+ # @param hyp a hypothesis to check
+ # @param geom a subhape of mesh geometry
+ # @return True of False
+ # @ingroup l2_hypotheses
+ def IsUsedHypothesis(self, hyp, geom):
+ if not hyp or not geom:
+ return False
+ if isinstance( hyp, Mesh_Algorithm ):
+ hyp = hyp.GetAlgorithm()
+ pass
+ hyps = self.GetHypothesisList(geom)
+ for h in hyps:
+ if h.GetId() == hyp.GetId():
+ return True
+ return False
+
## Unassigns a hypothesis
# @param hyp a hypothesis to unassign
- # @param geom a subshape of mesh geometry
+ # @param geom a sub-shape of mesh geometry
# @return SMESH.Hypothesis_Status
# @ingroup l2_hypotheses
def RemoveHypothesis(self, hyp, geom=0):
return status
## Gets the list of hypotheses added on a geometry
- # @param geom a subshape of mesh geometry
+ # @param geom a sub-shape of mesh geometry
# @return the sequence of SMESH_Hypothesis
# @ingroup l2_hypotheses
def GetHypothesisList(self, geom):
else:
self.mesh.ExportToMEDX(f, auto_groups, version, overwrite)
+ ## Exports the mesh in a file in SAUV format
+ # @param f is the file name
+ # @param auto_groups boolean parameter for creating/not creating
+ # the groups Group_On_All_Nodes, Group_On_All_Faces, ... ;
+ # the typical use is auto_groups=false.
+ # @ingroup l2_impexp
+ def ExportSAUV(self, f, auto_groups=0):
+ self.mesh.ExportSAUV(f, auto_groups)
+
## Exports the mesh in a file in DAT format
# @param f the file name
# @param meshPart a part of mesh (group, sub-mesh) to export instead of the mesh
def NbQuadranglesOfOrder(self, elementOrder):
return self.mesh.NbQuadranglesOfOrder(elementOrder)
+ ## Returns the number of biquadratic quadrangles in the mesh
+ # @return an integer value
+ # @ingroup l1_meshinfo
+ def NbBiQuadQuadrangles(self):
+ return self.mesh.NbBiQuadQuadrangles()
+
## Returns the number of polygons in the mesh
# @return an integer value
# @ingroup l1_meshinfo
def NbHexasOfOrder(self, elementOrder):
return self.mesh.NbHexasOfOrder(elementOrder)
+ ## Returns the number of triquadratic hexahedrons in the mesh
+ # @return an integer value
+ # @ingroup l1_meshinfo
+ def NbTriQuadraticHexas(self):
+ return self.mesh.NbTriQuadraticHexas()
+
## Returns the number of pyramids in the mesh
# @return an integer value
# @ingroup l1_meshinfo
def NbPrismsOfOrder(self, elementOrder):
return self.mesh.NbPrismsOfOrder(elementOrder)
+ ## Returns the number of hexagonal prisms in the mesh
+ # @return an integer value
+ # @ingroup l1_meshinfo
+ def NbHexagonalPrisms(self):
+ return self.mesh.NbHexagonalPrisms()
+
## Returns the number of polyhedrons in the mesh
# @return an integer value
# @ingroup l1_meshinfo
return self.mesh.GetElementGeomType(id)
## Returns the list of submesh elements IDs
- # @param Shape a geom object(subshape) IOR
- # Shape must be the subshape of a ShapeToMesh()
+ # @param Shape a geom object(sub-shape) IOR
+ # Shape must be the sub-shape of a ShapeToMesh()
# @return the list of integer values
# @ingroup l1_meshinfo
def GetSubMeshElementsId(self, Shape):
return self.mesh.GetSubMeshElementsId(ShapeID)
## Returns the list of submesh nodes IDs
- # @param Shape a geom object(subshape) IOR
- # Shape must be the subshape of a ShapeToMesh()
+ # @param Shape a geom object(sub-shape) IOR
+ # Shape must be the sub-shape of a ShapeToMesh()
# @param all If true, gives all nodes of submesh elements, otherwise gives only submesh nodes
# @return the list of integer values
# @ingroup l1_meshinfo
return self.mesh.GetSubMeshNodesId(ShapeID, all)
## Returns type of elements on given shape
- # @param Shape a geom object(subshape) IOR
- # Shape must be a subshape of a ShapeToMesh()
+ # @param Shape a geom object(sub-shape) IOR
+ # Shape must be a sub-shape of a ShapeToMesh()
# @return element type
# @ingroup l1_meshinfo
def GetSubMeshElementType(self, Shape):
hypo = self.mesh.smeshpyD.CreateHypothesis(hyp, so)
a = ""
s = "="
- i = 0
- n = len(args)
- while i<n:
- a = a + s + str(args[i])
+ for arg in args:
+ argStr = str(arg)
+ if isinstance( arg, geompyDC.GEOM._objref_GEOM_Object ):
+ argStr = arg.GetStudyEntry()
+ if not argStr: argStr = "GEOM_Obj_%s", arg.GetEntry()
+ if len( argStr ) > 10:
+ argStr = argStr[:7]+"..."
+ if argStr[0] == '[': argStr += ']'
+ a = a + s + argStr
s = ","
- i = i + 1
pass
+ if len(a) > 50:
+ a = a[:47]+"..."
self.mesh.smeshpyD.SetName(hypo, hyp + a)
pass
geomName=""
hyp.SetIgnoreFaces(ignoreFaces)
return hyp
+ ## Transform a list of ether edges or tuples (edge 1st_vertex_of_edge)
+ # into a list acceptable to SetReversedEdges() of some 1D hypotheses
+ # @ingroup l3_hypos_1dhyps
+ def ReversedEdgeIndices(self, reverseList):
+ resList = []
+ geompy = self.mesh.geompyD
+ for i in reverseList:
+ if isinstance( i, int ):
+ s = geompy.SubShapes(self.mesh.geom, [i])[0]
+ if s.GetShapeType() != geompyDC.GEOM.EDGE:
+ raise TypeError, "Not EDGE index given"
+ resList.append( i )
+ elif isinstance( i, geompyDC.GEOM._objref_GEOM_Object ):
+ if i.GetShapeType() != geompyDC.GEOM.EDGE:
+ raise TypeError, "Not an EDGE given"
+ resList.append( geompy.GetSubShapeID(self.mesh.geom, i ))
+ elif len( i ) > 1:
+ e = i[0]
+ v = i[1]
+ if not isinstance( e, geompyDC.GEOM._objref_GEOM_Object ) or \
+ not isinstance( v, geompyDC.GEOM._objref_GEOM_Object ):
+ raise TypeError, "A list item must be a tuple (edge 1st_vertex_of_edge)"
+ if v.GetShapeType() == geompyDC.GEOM.EDGE and \
+ e.GetShapeType() == geompyDC.GEOM.VERTEX:
+ v,e = e,v
+ if e.GetShapeType() != geompyDC.GEOM.EDGE or \
+ v.GetShapeType() != geompyDC.GEOM.VERTEX:
+ raise TypeError, "A list item must be a tuple (edge 1st_vertex_of_edge)"
+ vFirst = FirstVertexOnCurve( e )
+ tol = geompy.Tolerance( vFirst )[-1]
+ if geompy.MinDistance( v, vFirst ) > 1.5*tol:
+ resList.append( geompy.GetSubShapeID(self.mesh.geom, e ))
+ else:
+ raise TypeError, "Item must be either an edge or tuple (edge 1st_vertex_of_edge)"
+ return resList
+
# Public class: Mesh_Segment
# --------------------------
## Defines "NumberOfSegments" hypothesis to cut an edge in a fixed number of segments
# @param n for the number of segments that cut an edge
# @param s for the scale factor (optional)
- # @param reversedEdges is a list of edges to mesh using reversed orientation
+ # @param reversedEdges is a list of edges to mesh using reversed orientation.
+ # A list item can also be a tuple (edge 1st_vertex_of_edge)
# @param UseExisting if ==true - searches for an existing hypothesis created with
# the same parameters, else (default) - create a new one
# @return an instance of StdMeshers_NumberOfSegments hypothesis
if not isinstance(reversedEdges,list): #old version script, before adding reversedEdges
reversedEdges, UseExisting = [], reversedEdges
entry = self.MainShapeEntry()
- if reversedEdges and isinstance(reversedEdges[0],geompyDC.GEOM._objref_GEOM_Object):
- reversedEdges = [ self.mesh.geompyD.GetSubShapeID(self.mesh.geom, e) for e in reversedEdges ]
+ reversedEdgeInd = self.ReversedEdgeIndices(reversedEdges)
if s == []:
- hyp = self.Hypothesis("NumberOfSegments", [n, reversedEdges, entry],
+ hyp = self.Hypothesis("NumberOfSegments", [n, reversedEdgeInd, entry],
UseExisting=UseExisting,
CompareMethod=self.CompareNumberOfSegments)
else:
- hyp = self.Hypothesis("NumberOfSegments", [n,s, reversedEdges, entry],
+ hyp = self.Hypothesis("NumberOfSegments", [n,s, reversedEdgeInd, entry],
UseExisting=UseExisting,
CompareMethod=self.CompareNumberOfSegments)
hyp.SetDistrType( 1 )
hyp.SetScaleFactor(s)
hyp.SetNumberOfSegments(n)
- hyp.SetReversedEdges( reversedEdges )
+ hyp.SetReversedEdges( reversedEdgeInd )
hyp.SetObjectEntry( entry )
return hyp
## Defines "Arithmetic1D" hypothesis to cut an edge in several segments with increasing arithmetic length
# @param start defines the length of the first segment
# @param end defines the length of the last segment
- # @param reversedEdges is a list of edges to mesh using reversed orientation
+ # @param reversedEdges is a list of edges to mesh using reversed orientation.
+ # A list item can also be a tuple (edge 1st_vertex_of_edge)
# @param UseExisting if ==true - searches for an existing hypothesis created with
# the same parameters, else (default) - creates a new one
# @return an instance of StdMeshers_Arithmetic1D hypothesis
def Arithmetic1D(self, start, end, reversedEdges=[], UseExisting=0):
if not isinstance(reversedEdges,list): #old version script, before adding reversedEdges
reversedEdges, UseExisting = [], reversedEdges
- if reversedEdges and isinstance(reversedEdges[0],geompyDC.GEOM._objref_GEOM_Object):
- reversedEdges = [ self.mesh.geompyD.GetSubShapeID(self.mesh.geom, e) for e in reversedEdges ]
+ reversedEdgeInd = self.ReversedEdgeIndices(reversedEdges)
entry = self.MainShapeEntry()
- hyp = self.Hypothesis("Arithmetic1D", [start, end, reversedEdges, entry],
+ hyp = self.Hypothesis("Arithmetic1D", [start, end, reversedEdgeInd, entry],
UseExisting=UseExisting,
CompareMethod=self.CompareArithmetic1D)
hyp.SetStartLength(start)
hyp.SetEndLength(end)
- hyp.SetReversedEdges( reversedEdges )
+ hyp.SetReversedEdges( reversedEdgeInd )
hyp.SetObjectEntry( entry )
return hyp
# values are equals 1
# @param points defines the list of parameters on curve
# @param nbSegs defines the list of numbers of segments
- # @param reversedEdges is a list of edges to mesh using reversed orientation
+ # @param reversedEdges is a list of edges to mesh using reversed orientation.
+ # A list item can also be a tuple (edge 1st_vertex_of_edge)
# @param UseExisting if ==true - searches for an existing hypothesis created with
# the same parameters, else (default) - creates a new one
# @return an instance of StdMeshers_Arithmetic1D hypothesis
def FixedPoints1D(self, points, nbSegs=[1], reversedEdges=[], UseExisting=0):
if not isinstance(reversedEdges,list): #old version script, before adding reversedEdges
reversedEdges, UseExisting = [], reversedEdges
- if reversedEdges and isinstance(reversedEdges[0],geompyDC.GEOM._objref_GEOM_Object):
- reversedEdges = [ self.mesh.geompyD.GetSubShapeID(self.mesh.geom, e) for e in reversedEdges ]
+ reversedEdgeInd = self.ReversedEdgeIndices(reversedEdges)
entry = self.MainShapeEntry()
- hyp = self.Hypothesis("FixedPoints1D", [points, nbSegs, reversedEdges, entry],
+ hyp = self.Hypothesis("FixedPoints1D", [points, nbSegs, reversedEdgeInd, entry],
UseExisting=UseExisting,
CompareMethod=self.CompareFixedPoints1D)
hyp.SetPoints(points)
hyp.SetNbSegments(nbSegs)
- hyp.SetReversedEdges(reversedEdges)
+ hyp.SetReversedEdges(reversedEdgeInd)
hyp.SetObjectEntry(entry)
return hyp
## Defines "StartEndLength" hypothesis to cut an edge in several segments with increasing geometric length
# @param start defines the length of the first segment
# @param end defines the length of the last segment
- # @param reversedEdges is a list of edges to mesh using reversed orientation
+ # @param reversedEdges is a list of edges to mesh using reversed orientation.
+ # A list item can also be a tuple (edge 1st_vertex_of_edge)
# @param UseExisting if ==true - searches for an existing hypothesis created with
# the same parameters, else (default) - creates a new one
# @return an instance of StdMeshers_StartEndLength hypothesis
def StartEndLength(self, start, end, reversedEdges=[], UseExisting=0):
if not isinstance(reversedEdges,list): #old version script, before adding reversedEdges
reversedEdges, UseExisting = [], reversedEdges
- if reversedEdges and isinstance(reversedEdges[0],geompyDC.GEOM._objref_GEOM_Object):
- reversedEdges = [ self.mesh.geompyD.GetSubShapeID(self.mesh.geom, e) for e in reversedEdges ]
+ reversedEdgeInd = self.ReversedEdgeIndices(reversedEdges)
entry = self.MainShapeEntry()
- hyp = self.Hypothesis("StartEndLength", [start, end, reversedEdges, entry],
+ hyp = self.Hypothesis("StartEndLength", [start, end, reversedEdgeInd, entry],
UseExisting=UseExisting,
CompareMethod=self.CompareStartEndLength)
hyp.SetStartLength(start)
hyp.SetEndLength(end)
- hyp.SetReversedEdges( reversedEdges )
+ hyp.SetReversedEdges( reversedEdgeInd )
hyp.SetObjectEntry( entry )
return hyp
## Sets topology usage way.
# @param way defines how mesh conformity is assured <ul>
# <li>FromCAD - mesh conformity is assured by conformity of a shape</li>
- # <li>PreProcess or PreProcessPlus - by pre-processing a CAD model</li></ul>
+ # <li>PreProcess or PreProcessPlus - by pre-processing a CAD model</li>
# <li>PreCAD - by pre-processing with PreCAD a CAD model</li></ul>
# @ingroup l3_hypos_blsurf
def SetTopology(self, way):
class Mesh_Projection2D(Mesh_Algorithm):
## Private constructor.
- def __init__(self, mesh, geom=0):
+ def __init__(self, mesh, geom=0, algoName="Projection_2D"):
Mesh_Algorithm.__init__(self)
- self.Create(mesh, geom, "Projection_2D")
+ self.Create(mesh, geom, algoName)
## Defines "Source Face" hypothesis, specifying a meshed face, from where
# a mesh pattern is taken, and, optionally, the association of vertices
# @param UseExisting if ==true - searches for the existing hypothesis created with
# the same parameters, else (default) - creates a new one
def SourceEdges(self, groups, toCopyMesh=False, toCopyGroups=False, UseExisting=False):
- if self.algo.GetName() == "Import_2D":
+ if self.algo.GetName() != "Import_1D":
raise ValueError, "algoritm dimension mismatch"
for group in groups:
AssureGeomPublished( self.mesh, group )
return entries == entries2
return False
+# Public class: Mesh_Cartesian_3D
+# --------------------------------------
+## Defines a Body Fitting 3D algorithm
+# @ingroup l3_algos_basic
+#
+class Mesh_Cartesian_3D(Mesh_Algorithm):
+
+ def __init__(self, mesh, geom=0):
+ self.Create(mesh, geom, "Cartesian_3D")
+ self.hyp = None
+ return
+
+ ## Defines "Body Fitting parameters" hypothesis
+ # @param xGridDef is definition of the grid along the X asix.
+ # It can be in either of two following forms:
+ # - Explicit coordinates of nodes, e.g. [-1.5, 0.0, 3.1] or range( -100,200,10)
+ # - Functions f(t) defining grid spacing at each point on grid axis. If there are
+ # several functions, they must be accompanied by relative coordinates of
+ # points dividing the whole shape into ranges where the functions apply; points
+ # coodrinates should vary within (0.0, 1.0) range. Parameter \a t of the spacing
+ # function f(t) varies from 0.0 to 1.0 witin a shape range.
+ # Examples:
+ # - "10.5" - defines a grid with a constant spacing
+ # - [["1", "1+10*t", "11"] [0.1, 0.6]] - defines different spacing in 3 ranges.
+ # @param yGridDef defines the grid along the Y asix the same way as \a xGridDef does
+ # @param zGridDef defines the grid along the Z asix the same way as \a xGridDef does
+ # @param sizeThreshold (> 1.0) defines a minimal size of a polyhedron so that
+ # a polyhedron of size less than hexSize/sizeThreshold is not created
+ # @param UseExisting if ==true - searches for the existing hypothesis created with
+ # the same parameters, else (default) - creates a new one
+ def SetGrid(self, xGridDef, yGridDef, zGridDef, sizeThreshold=4.0, UseExisting=False):
+ if not self.hyp:
+ self.hyp = self.Hypothesis("CartesianParameters3D",
+ [xGridDef, yGridDef, zGridDef, sizeThreshold],
+ UseExisting=UseExisting, CompareMethod=self._compareHyp)
+ if not self.mesh.IsUsedHypothesis( self.hyp, self.geom ):
+ self.mesh.AddHypothesis( self.hyp, self.geom )
+
+ for axis, gridDef in enumerate( [xGridDef, yGridDef, zGridDef]):
+ if not gridDef: raise ValueError, "Empty grid definition"
+ if isinstance( gridDef, str ):
+ self.hyp.SetGridSpacing( [gridDef], [], axis )
+ elif isinstance( gridDef[0], str ):
+ self.hyp.SetGridSpacing( gridDef, [], axis )
+ elif isinstance( gridDef[0], int ) or \
+ isinstance( gridDef[0], float ):
+ self.hyp.SetGrid(gridDef, axis )
+ else:
+ self.hyp.SetGridSpacing( gridDef[0], gridDef[1], axis )
+ self.hyp.SetSizeThreshold( sizeThreshold )
+ return self.hyp
+
+ def _compareHyp(self,hyp,args):
+ # not implemented yet
+ return False
-# Private class: Mesh_UseExisting
+# Public class: Mesh_UseExisting
# -------------------------------
class Mesh_UseExisting(Mesh_Algorithm):
