2016-03-18 22:10:20 +05:00
|
|
|
# Copyright (C) 2007-2016 CEA/DEN, EDF R&D, OPEN CASCADE
|
2012-08-09 16:03:55 +06:00
|
|
|
#
|
|
|
|
# This library is free software; you can redistribute it and/or
|
|
|
|
# modify it under the terms of the GNU Lesser General Public
|
|
|
|
# License as published by the Free Software Foundation; either
|
2014-02-20 18:25:37 +06:00
|
|
|
# version 2.1 of the License, or (at your option) any later version.
|
2012-08-09 16:03:55 +06:00
|
|
|
#
|
|
|
|
# This library is distributed in the hope that it will be useful,
|
|
|
|
# but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
|
|
# Lesser General Public License for more details.
|
|
|
|
#
|
|
|
|
# You should have received a copy of the GNU Lesser General Public
|
|
|
|
# License along with this library; if not, write to the Free Software
|
|
|
|
# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
|
|
|
#
|
|
|
|
# See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
|
|
|
|
#
|
|
|
|
|
2012-10-08 17:56:59 +06:00
|
|
|
##
|
2013-04-04 13:08:19 +06:00
|
|
|
# @package StdMeshersBuilder
|
2012-10-08 17:56:59 +06:00
|
|
|
# Python API for the standard meshing plug-in module.
|
|
|
|
|
2016-09-07 16:43:02 +05:00
|
|
|
LIBRARY = "libStdMeshersEngine.so"
|
|
|
|
|
2013-04-04 13:08:19 +06:00
|
|
|
from salome.smesh.smesh_algorithm import Mesh_Algorithm
|
2013-11-20 17:31:08 +06:00
|
|
|
import StdMeshers
|
2012-08-09 16:03:55 +06:00
|
|
|
|
2012-10-08 17:56:59 +06:00
|
|
|
#----------------------------
|
|
|
|
# Mesh algo type identifiers
|
|
|
|
#----------------------------
|
|
|
|
|
2013-04-04 13:08:19 +06:00
|
|
|
## Algorithm type: Regular 1D algorithm, see StdMeshersBuilder_Segment
|
2012-08-09 16:03:55 +06:00
|
|
|
REGULAR = "Regular_1D"
|
2013-04-04 13:08:19 +06:00
|
|
|
## Algorithm type: Python 1D algorithm, see StdMeshersBuilder_Segment_Python
|
2012-08-09 16:03:55 +06:00
|
|
|
PYTHON = "Python_1D"
|
2013-04-04 13:08:19 +06:00
|
|
|
## Algorithm type: Composite segment 1D algorithm, see StdMeshersBuilder_CompositeSegment
|
2012-08-09 16:03:55 +06:00
|
|
|
COMPOSITE = "CompositeSegment_1D"
|
2013-04-04 13:08:19 +06:00
|
|
|
## Algorithm type: Triangle MEFISTO 2D algorithm, see StdMeshersBuilder_Triangle_MEFISTO
|
2012-08-09 16:03:55 +06:00
|
|
|
MEFISTO = "MEFISTO_2D"
|
2013-04-04 13:08:19 +06:00
|
|
|
## Algorithm type: Hexahedron 3D (i-j-k) algorithm, see StdMeshersBuilder_Hexahedron
|
2012-08-09 16:03:55 +06:00
|
|
|
Hexa = "Hexa_3D"
|
2013-04-04 13:08:19 +06:00
|
|
|
## Algorithm type: Quadrangle 2D algorithm, see StdMeshersBuilder_Quadrangle
|
2012-08-09 16:03:55 +06:00
|
|
|
QUADRANGLE = "Quadrangle_2D"
|
2013-04-04 13:08:19 +06:00
|
|
|
## Algorithm type: Radial Quadrangle 1D-2D algorithm, see StdMeshersBuilder_RadialQuadrangle1D2D
|
2012-08-09 16:03:55 +06:00
|
|
|
RADIAL_QUAD = "RadialQuadrangle_1D2D"
|
2015-06-15 23:31:23 +05:00
|
|
|
## Algorithm type: Quadrangle (Medial Axis Projection) 1D-2D algorithm, see StdMeshersBuilder_QuadMA_1D2D
|
|
|
|
QUAD_MA_PROJ = "QuadFromMedialAxis_1D2D"
|
2015-06-30 17:14:46 +05:00
|
|
|
## Algorithm type: Polygon Per Face 2D algorithm, see StdMeshersBuilder_PolygonPerFace
|
|
|
|
POLYGON = "PolygonPerFace_2D"
|
2012-08-09 16:03:55 +06:00
|
|
|
|
2015-02-10 16:14:01 +05:00
|
|
|
# import items of enums
|
2012-08-09 16:03:55 +06:00
|
|
|
for e in StdMeshers.QuadType._items: exec('%s = StdMeshers.%s'%(e,e))
|
2015-02-10 16:14:01 +05:00
|
|
|
for e in StdMeshers.VLExtrusionMethod._items: exec('%s = StdMeshers.%s'%(e,e))
|
2012-08-09 16:03:55 +06:00
|
|
|
|
2012-10-08 17:56:59 +06:00
|
|
|
#----------------------
|
|
|
|
# Algorithms
|
|
|
|
#----------------------
|
2012-08-09 16:03:55 +06:00
|
|
|
|
2012-10-08 17:56:59 +06:00
|
|
|
## Defines segment 1D algorithm for edges discretization.
|
|
|
|
#
|
2013-04-05 15:00:43 +06:00
|
|
|
# It can be created by calling smeshBuilder.Mesh.Segment(geom=0)
|
2012-08-09 16:03:55 +06:00
|
|
|
#
|
|
|
|
# @ingroup l3_algos_basic
|
2013-04-04 13:08:19 +06:00
|
|
|
class StdMeshersBuilder_Segment(Mesh_Algorithm):
|
2012-08-09 16:03:55 +06:00
|
|
|
|
2013-04-05 15:00:43 +06:00
|
|
|
## name of the dynamic method in smeshBuilder.Mesh class
|
2012-10-08 17:56:59 +06:00
|
|
|
# @internal
|
2012-08-09 16:03:55 +06:00
|
|
|
meshMethod = "Segment"
|
2013-04-05 15:00:43 +06:00
|
|
|
## type of algorithm used with helper function in smeshBuilder.Mesh class
|
2012-10-08 17:56:59 +06:00
|
|
|
# @internal
|
2012-08-09 16:03:55 +06:00
|
|
|
algoType = REGULAR
|
2015-06-30 17:14:46 +05:00
|
|
|
## flag pointing whether this algorithm should be used by default in dynamic method
|
2013-04-05 15:00:43 +06:00
|
|
|
# of smeshBuilder.Mesh class
|
2012-10-08 17:56:59 +06:00
|
|
|
# @internal
|
2012-08-09 16:03:55 +06:00
|
|
|
isDefault = True
|
2012-10-08 17:56:59 +06:00
|
|
|
## doc string of the method
|
|
|
|
# @internal
|
|
|
|
docHelper = "Creates segment 1D algorithm for edges"
|
2012-08-09 16:03:55 +06:00
|
|
|
|
|
|
|
## Private constructor.
|
2012-10-08 17:56:59 +06:00
|
|
|
# @param mesh parent mesh object algorithm is assigned to
|
|
|
|
# @param geom geometry (shape/sub-shape) algorithm is assigned to;
|
|
|
|
# if it is @c 0 (default), the algorithm is assigned to the main shape
|
2012-08-09 16:03:55 +06:00
|
|
|
def __init__(self, mesh, geom=0):
|
|
|
|
Mesh_Algorithm.__init__(self)
|
|
|
|
self.Create(mesh, geom, self.algoType)
|
2012-10-08 17:56:59 +06:00
|
|
|
pass
|
2012-08-09 16:03:55 +06:00
|
|
|
|
|
|
|
## Defines "LocalLength" hypothesis to cut an edge in several segments with the same length
|
|
|
|
# @param l for the length of segments that cut an edge
|
|
|
|
# @param UseExisting if ==true - searches for an existing hypothesis created with
|
|
|
|
# the same parameters, else (default) - creates a new one
|
|
|
|
# @param p precision, used for calculation of the number of segments.
|
|
|
|
# The precision should be a positive, meaningful value within the range [0,1].
|
|
|
|
# In general, the number of segments is calculated with the formula:
|
|
|
|
# nb = ceil((edge_length / l) - p)
|
|
|
|
# Function ceil rounds its argument to the higher integer.
|
|
|
|
# So, p=0 means rounding of (edge_length / l) to the higher integer,
|
|
|
|
# p=0.5 means rounding of (edge_length / l) to the nearest integer,
|
|
|
|
# p=1 means rounding of (edge_length / l) to the lower integer.
|
|
|
|
# Default value is 1e-07.
|
|
|
|
# @return an instance of StdMeshers_LocalLength hypothesis
|
|
|
|
# @ingroup l3_hypos_1dhyps
|
|
|
|
def LocalLength(self, l, UseExisting=0, p=1e-07):
|
2013-11-22 18:36:27 +06:00
|
|
|
from salome.smesh.smeshBuilder import IsEqual
|
2012-08-09 16:03:55 +06:00
|
|
|
comFun=lambda hyp, args: IsEqual(hyp.GetLength(), args[0]) and IsEqual(hyp.GetPrecision(), args[1])
|
|
|
|
hyp = self.Hypothesis("LocalLength", [l,p], UseExisting=UseExisting, CompareMethod=comFun)
|
|
|
|
hyp.SetLength(l)
|
|
|
|
hyp.SetPrecision(p)
|
|
|
|
return hyp
|
|
|
|
|
|
|
|
## Defines "MaxSize" hypothesis to cut an edge into segments not longer than given value
|
|
|
|
# @param length is optional maximal allowed length of segment, if it is omitted
|
|
|
|
# the preestimated length is used that depends on geometry size
|
|
|
|
# @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_MaxLength hypothesis
|
|
|
|
# @ingroup l3_hypos_1dhyps
|
|
|
|
def MaxSize(self, length=0.0, UseExisting=0):
|
|
|
|
hyp = self.Hypothesis("MaxLength", [length], UseExisting=UseExisting)
|
|
|
|
if length > 0.0:
|
|
|
|
# set given length
|
|
|
|
hyp.SetLength(length)
|
|
|
|
if not UseExisting:
|
|
|
|
# set preestimated length
|
|
|
|
gen = self.mesh.smeshpyD
|
|
|
|
initHyp = gen.GetHypothesisParameterValues("MaxLength", "libStdMeshersEngine.so",
|
|
|
|
self.mesh.GetMesh(), self.mesh.GetShape(),
|
|
|
|
False) # <- byMesh
|
|
|
|
preHyp = initHyp._narrow(StdMeshers.StdMeshers_MaxLength)
|
|
|
|
if preHyp:
|
|
|
|
hyp.SetPreestimatedLength( preHyp.GetPreestimatedLength() )
|
|
|
|
pass
|
|
|
|
pass
|
|
|
|
hyp.SetUsePreestimatedLength( length == 0.0 )
|
|
|
|
return hyp
|
|
|
|
|
|
|
|
## 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.
|
|
|
|
# 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
|
|
|
|
# @ingroup l3_hypos_1dhyps
|
|
|
|
def NumberOfSegments(self, n, s=[], reversedEdges=[], UseExisting=0):
|
|
|
|
if not isinstance(reversedEdges,list): #old version script, before adding reversedEdges
|
|
|
|
reversedEdges, UseExisting = [], reversedEdges
|
|
|
|
entry = self.MainShapeEntry()
|
|
|
|
reversedEdgeInd = self.ReversedEdgeIndices(reversedEdges)
|
2015-02-17 18:23:19 +05:00
|
|
|
if not s:
|
2012-08-09 16:03:55 +06:00
|
|
|
hyp = self.Hypothesis("NumberOfSegments", [n, reversedEdgeInd, entry],
|
|
|
|
UseExisting=UseExisting,
|
|
|
|
CompareMethod=self._compareNumberOfSegments)
|
|
|
|
else:
|
|
|
|
hyp = self.Hypothesis("NumberOfSegments", [n,s, reversedEdgeInd, entry],
|
|
|
|
UseExisting=UseExisting,
|
|
|
|
CompareMethod=self._compareNumberOfSegments)
|
|
|
|
hyp.SetScaleFactor(s)
|
|
|
|
hyp.SetNumberOfSegments(n)
|
|
|
|
hyp.SetReversedEdges( reversedEdgeInd )
|
|
|
|
hyp.SetObjectEntry( entry )
|
|
|
|
return hyp
|
|
|
|
|
|
|
|
## Private method
|
2012-10-08 17:56:59 +06:00
|
|
|
#
|
|
|
|
# Checks if the given "NumberOfSegments" hypothesis has the same parameters as the given arguments
|
2012-08-09 16:03:55 +06:00
|
|
|
def _compareNumberOfSegments(self, hyp, args):
|
|
|
|
if hyp.GetNumberOfSegments() == args[0]:
|
|
|
|
if len(args) == 3:
|
|
|
|
if hyp.GetReversedEdges() == args[1]:
|
|
|
|
if not args[1] or hyp.GetObjectEntry() == args[2]:
|
|
|
|
return True
|
|
|
|
else:
|
2013-11-22 18:36:27 +06:00
|
|
|
from salome.smesh.smeshBuilder import IsEqual
|
2012-08-09 16:03:55 +06:00
|
|
|
if hyp.GetReversedEdges() == args[2]:
|
|
|
|
if not args[2] or hyp.GetObjectEntry() == args[3]:
|
|
|
|
if hyp.GetDistrType() == 1:
|
|
|
|
if IsEqual(hyp.GetScaleFactor(), args[1]):
|
|
|
|
return True
|
|
|
|
return False
|
|
|
|
|
2013-11-11 17:07:44 +06:00
|
|
|
## Defines "Adaptive" hypothesis to cut an edge into segments keeping segment size
|
|
|
|
# within the given range and considering (1) deflection of segments from the edge
|
|
|
|
# and (2) distance from segments to closest edges and faces to have segment length
|
|
|
|
# not longer than two times shortest distances to edges and faces.
|
|
|
|
# @param minSize defines the minimal allowed segment length
|
|
|
|
# @param maxSize defines the maximal allowed segment length
|
|
|
|
# @param deflection defines the maximal allowed distance from a segment to an 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_Adaptive1D hypothesis
|
|
|
|
# @ingroup l3_hypos_1dhyps
|
2014-07-16 19:43:58 +06:00
|
|
|
def Adaptive(self, minSize, maxSize, deflection, UseExisting=False):
|
2013-11-22 18:36:27 +06:00
|
|
|
from salome.smesh.smeshBuilder import IsEqual
|
2013-11-11 17:07:44 +06:00
|
|
|
compFun = lambda hyp, args: ( IsEqual(hyp.GetMinSize(), args[0]) and \
|
|
|
|
IsEqual(hyp.GetMaxSize(), args[1]) and \
|
2014-07-16 19:43:58 +06:00
|
|
|
IsEqual(hyp.GetDeflection(), args[2]))
|
|
|
|
hyp = self.Hypothesis("Adaptive1D", [minSize, maxSize, deflection],
|
2013-11-11 17:07:44 +06:00
|
|
|
UseExisting=UseExisting, CompareMethod=compFun)
|
|
|
|
hyp.SetMinSize(minSize)
|
|
|
|
hyp.SetMaxSize(maxSize)
|
|
|
|
hyp.SetDeflection(deflection)
|
|
|
|
return hyp
|
|
|
|
|
2014-01-15 15:41:17 +06:00
|
|
|
## Defines "Arithmetic1D" hypothesis to cut an edge in several segments with a length
|
|
|
|
# that changes in arithmetic progression
|
2012-08-09 16:03:55 +06:00
|
|
|
# @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.
|
|
|
|
# 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
|
|
|
|
# @ingroup l3_hypos_1dhyps
|
|
|
|
def Arithmetic1D(self, start, end, reversedEdges=[], UseExisting=0):
|
|
|
|
if not isinstance(reversedEdges,list): #old version script, before adding reversedEdges
|
|
|
|
reversedEdges, UseExisting = [], reversedEdges
|
|
|
|
reversedEdgeInd = self.ReversedEdgeIndices(reversedEdges)
|
|
|
|
entry = self.MainShapeEntry()
|
2013-11-22 18:36:27 +06:00
|
|
|
from salome.smesh.smeshBuilder import IsEqual
|
2012-08-09 16:03:55 +06:00
|
|
|
compFun = lambda hyp, args: ( IsEqual(hyp.GetLength(1), args[0]) and \
|
|
|
|
IsEqual(hyp.GetLength(0), args[1]) and \
|
|
|
|
hyp.GetReversedEdges() == args[2] and \
|
|
|
|
(not args[2] or hyp.GetObjectEntry() == args[3]))
|
|
|
|
hyp = self.Hypothesis("Arithmetic1D", [start, end, reversedEdgeInd, entry],
|
|
|
|
UseExisting=UseExisting, CompareMethod=compFun)
|
|
|
|
hyp.SetStartLength(start)
|
|
|
|
hyp.SetEndLength(end)
|
|
|
|
hyp.SetReversedEdges( reversedEdgeInd )
|
|
|
|
hyp.SetObjectEntry( entry )
|
|
|
|
return hyp
|
|
|
|
|
2014-01-15 15:41:17 +06:00
|
|
|
## Defines "GeometricProgression" hypothesis to cut an edge in several
|
|
|
|
# segments with a length that changes in Geometric progression
|
|
|
|
# @param start defines the length of the first segment
|
|
|
|
# @param ratio defines the common ratio of the geometric progression
|
|
|
|
# @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_Geometric1D hypothesis
|
|
|
|
# @ingroup l3_hypos_1dhyps
|
|
|
|
def GeometricProgression(self, start, ratio, reversedEdges=[], UseExisting=0):
|
|
|
|
reversedEdgeInd = self.ReversedEdgeIndices(reversedEdges)
|
|
|
|
entry = self.MainShapeEntry()
|
|
|
|
from salome.smesh.smeshBuilder import IsEqual
|
|
|
|
compFun = lambda hyp, args: ( IsEqual(hyp.GetLength(1), args[0]) and \
|
|
|
|
IsEqual(hyp.GetLength(0), args[1]) and \
|
|
|
|
hyp.GetReversedEdges() == args[2] and \
|
|
|
|
(not args[2] or hyp.GetObjectEntry() == args[3]))
|
|
|
|
hyp = self.Hypothesis("GeometricProgression", [start, ratio, reversedEdgeInd, entry],
|
|
|
|
UseExisting=UseExisting, CompareMethod=compFun)
|
|
|
|
hyp.SetStartLength( start )
|
|
|
|
hyp.SetCommonRatio( ratio )
|
|
|
|
hyp.SetReversedEdges( reversedEdgeInd )
|
|
|
|
hyp.SetObjectEntry( entry )
|
|
|
|
return hyp
|
|
|
|
|
2012-08-09 16:03:55 +06:00
|
|
|
## Defines "FixedPoints1D" hypothesis to cut an edge using parameter
|
|
|
|
# on curve from 0 to 1 (additionally it is neecessary to check
|
|
|
|
# orientation of edges and create list of reversed edges if it is
|
|
|
|
# needed) and sets numbers of segments between given points (default
|
2016-11-25 19:24:41 +05:00
|
|
|
# values are 1)
|
2012-08-09 16:03:55 +06:00
|
|
|
# @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.
|
|
|
|
# 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
|
2014-01-15 15:41:17 +06:00
|
|
|
# @return an instance of StdMeshers_FixedPoints1D hypothesis
|
2012-08-09 16:03:55 +06:00
|
|
|
# @ingroup l3_hypos_1dhyps
|
|
|
|
def FixedPoints1D(self, points, nbSegs=[1], reversedEdges=[], UseExisting=0):
|
|
|
|
if not isinstance(reversedEdges,list): #old version script, before adding reversedEdges
|
|
|
|
reversedEdges, UseExisting = [], reversedEdges
|
|
|
|
reversedEdgeInd = self.ReversedEdgeIndices(reversedEdges)
|
|
|
|
entry = self.MainShapeEntry()
|
|
|
|
compFun = lambda hyp, args: ( hyp.GetPoints() == args[0] and \
|
|
|
|
hyp.GetNbSegments() == args[1] and \
|
|
|
|
hyp.GetReversedEdges() == args[2] and \
|
|
|
|
(not args[2] or hyp.GetObjectEntry() == args[3]))
|
|
|
|
hyp = self.Hypothesis("FixedPoints1D", [points, nbSegs, reversedEdgeInd, entry],
|
|
|
|
UseExisting=UseExisting, CompareMethod=compFun)
|
|
|
|
hyp.SetPoints(points)
|
|
|
|
hyp.SetNbSegments(nbSegs)
|
|
|
|
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.
|
|
|
|
# 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
|
|
|
|
# @ingroup l3_hypos_1dhyps
|
|
|
|
def StartEndLength(self, start, end, reversedEdges=[], UseExisting=0):
|
|
|
|
if not isinstance(reversedEdges,list): #old version script, before adding reversedEdges
|
|
|
|
reversedEdges, UseExisting = [], reversedEdges
|
|
|
|
reversedEdgeInd = self.ReversedEdgeIndices(reversedEdges)
|
|
|
|
entry = self.MainShapeEntry()
|
2013-11-22 18:36:27 +06:00
|
|
|
from salome.smesh.smeshBuilder import IsEqual
|
2012-08-09 16:03:55 +06:00
|
|
|
compFun = lambda hyp, args: ( IsEqual(hyp.GetLength(1), args[0]) and \
|
|
|
|
IsEqual(hyp.GetLength(0), args[1]) and \
|
|
|
|
hyp.GetReversedEdges() == args[2] and \
|
|
|
|
(not args[2] or hyp.GetObjectEntry() == args[3]))
|
|
|
|
hyp = self.Hypothesis("StartEndLength", [start, end, reversedEdgeInd, entry],
|
|
|
|
UseExisting=UseExisting, CompareMethod=compFun)
|
|
|
|
hyp.SetStartLength(start)
|
|
|
|
hyp.SetEndLength(end)
|
|
|
|
hyp.SetReversedEdges( reversedEdgeInd )
|
|
|
|
hyp.SetObjectEntry( entry )
|
|
|
|
return hyp
|
|
|
|
|
|
|
|
## Defines "Deflection1D" hypothesis
|
|
|
|
# @param d for the deflection
|
|
|
|
# @param UseExisting if ==true - searches for an existing hypothesis created with
|
|
|
|
# the same parameters, else (default) - create a new one
|
|
|
|
# @ingroup l3_hypos_1dhyps
|
|
|
|
def Deflection1D(self, d, UseExisting=0):
|
2013-11-22 18:36:27 +06:00
|
|
|
from salome.smesh.smeshBuilder import IsEqual
|
2012-08-09 16:03:55 +06:00
|
|
|
compFun = lambda hyp, args: IsEqual(hyp.GetDeflection(), args[0])
|
|
|
|
hyp = self.Hypothesis("Deflection1D", [d], UseExisting=UseExisting, CompareMethod=compFun)
|
|
|
|
hyp.SetDeflection(d)
|
|
|
|
return hyp
|
|
|
|
|
2014-01-15 15:41:17 +06:00
|
|
|
## Defines "Propagation" hypothesis that propagates 1D hypotheses
|
|
|
|
# from an edge where this hypothesis is assigned to
|
|
|
|
# on all other edges that are at the opposite side in case of quadrangular faces
|
|
|
|
# This hypothesis should be assigned to an edge to propagate a hypothesis from.
|
2012-08-09 16:03:55 +06:00
|
|
|
# @ingroup l3_hypos_additi
|
|
|
|
def Propagation(self):
|
|
|
|
return self.Hypothesis("Propagation", UseExisting=1, CompareMethod=self.CompareEqualHyp)
|
|
|
|
|
2014-01-15 15:41:17 +06:00
|
|
|
## Defines "Propagation of Node Distribution" hypothesis that propagates
|
|
|
|
# distribution of nodes from an edge where this hypothesis is assigned to,
|
|
|
|
# to opposite edges of quadrangular faces, so that number of segments on all these
|
|
|
|
# edges will be the same, as well as relations between segment lengths.
|
|
|
|
# @ingroup l3_hypos_additi
|
|
|
|
def PropagationOfDistribution(self):
|
|
|
|
return self.Hypothesis("PropagOfDistribution", UseExisting=1,
|
|
|
|
CompareMethod=self.CompareEqualHyp)
|
|
|
|
|
2012-08-09 16:03:55 +06:00
|
|
|
## Defines "AutomaticLength" hypothesis
|
|
|
|
# @param fineness for the fineness [0-1]
|
|
|
|
# @param UseExisting if ==true - searches for an existing hypothesis created with the
|
|
|
|
# same parameters, else (default) - create a new one
|
|
|
|
# @ingroup l3_hypos_1dhyps
|
|
|
|
def AutomaticLength(self, fineness=0, UseExisting=0):
|
2013-11-22 18:36:27 +06:00
|
|
|
from salome.smesh.smeshBuilder import IsEqual
|
2012-08-09 16:03:55 +06:00
|
|
|
compFun = lambda hyp, args: IsEqual(hyp.GetFineness(), args[0])
|
|
|
|
hyp = self.Hypothesis("AutomaticLength",[fineness],UseExisting=UseExisting,
|
|
|
|
CompareMethod=compFun)
|
|
|
|
hyp.SetFineness( fineness )
|
|
|
|
return hyp
|
|
|
|
|
|
|
|
## Defines "SegmentLengthAroundVertex" hypothesis
|
|
|
|
# @param length for the segment length
|
|
|
|
# @param vertex for the length localization: the vertex index [0,1] | vertex object.
|
|
|
|
# Any other integer value means that the hypothesis will be set on the
|
|
|
|
# whole 1D shape, where Mesh_Segment algorithm is assigned.
|
|
|
|
# @param UseExisting if ==true - searches for an existing hypothesis created with
|
|
|
|
# the same parameters, else (default) - creates a new one
|
|
|
|
# @ingroup l3_algos_segmarv
|
|
|
|
def LengthNearVertex(self, length, vertex=0, UseExisting=0):
|
|
|
|
import types
|
|
|
|
store_geom = self.geom
|
|
|
|
if type(vertex) is types.IntType:
|
|
|
|
if vertex == 0 or vertex == 1:
|
2013-04-17 16:15:09 +06:00
|
|
|
from salome.geom import geomBuilder
|
|
|
|
vertex = self.mesh.geompyD.ExtractShapes(self.geom, geomBuilder.geomBuilder.ShapeType["VERTEX"],True)[vertex]
|
2012-08-09 16:03:55 +06:00
|
|
|
self.geom = vertex
|
|
|
|
pass
|
|
|
|
pass
|
|
|
|
else:
|
|
|
|
self.geom = vertex
|
|
|
|
pass
|
2012-10-08 17:56:59 +06:00
|
|
|
# 0D algorithm
|
2012-08-09 16:03:55 +06:00
|
|
|
if self.geom is None:
|
|
|
|
raise RuntimeError, "Attemp to create SegmentAroundVertex_0D algoritm on None shape"
|
2013-11-22 18:36:27 +06:00
|
|
|
from salome.smesh.smeshBuilder import AssureGeomPublished, GetName, TreatHypoStatus
|
2012-08-09 16:03:55 +06:00
|
|
|
AssureGeomPublished( self.mesh, self.geom )
|
|
|
|
name = GetName(self.geom)
|
|
|
|
|
|
|
|
algo = self.FindAlgorithm("SegmentAroundVertex_0D", self.mesh.smeshpyD)
|
|
|
|
if algo is None:
|
|
|
|
algo = self.mesh.smeshpyD.CreateHypothesis("SegmentAroundVertex_0D", "libStdMeshersEngine.so")
|
|
|
|
pass
|
|
|
|
status = self.mesh.mesh.AddHypothesis(self.geom, algo)
|
2014-08-26 17:58:38 +06:00
|
|
|
TreatHypoStatus(status, "SegmentAroundVertex_0D", name, True, self.mesh)
|
2012-10-08 17:56:59 +06:00
|
|
|
#
|
2013-11-22 18:36:27 +06:00
|
|
|
from salome.smesh.smeshBuilder import IsEqual
|
2012-08-09 16:03:55 +06:00
|
|
|
comFun = lambda hyp, args: IsEqual(hyp.GetLength(), args[0])
|
|
|
|
hyp = self.Hypothesis("SegmentLengthAroundVertex", [length], UseExisting=UseExisting,
|
|
|
|
CompareMethod=comFun)
|
|
|
|
self.geom = store_geom
|
|
|
|
hyp.SetLength( length )
|
|
|
|
return hyp
|
|
|
|
|
|
|
|
## Defines "QuadraticMesh" hypothesis, forcing construction of quadratic edges.
|
|
|
|
# If the 2D mesher sees that all boundary edges are quadratic,
|
|
|
|
# it generates quadratic faces, else it generates linear faces using
|
|
|
|
# medium nodes as if they are vertices.
|
|
|
|
# The 3D mesher generates quadratic volumes only if all boundary faces
|
|
|
|
# are quadratic, else it fails.
|
|
|
|
#
|
|
|
|
# @ingroup l3_hypos_additi
|
|
|
|
def QuadraticMesh(self):
|
|
|
|
hyp = self.Hypothesis("QuadraticMesh", UseExisting=1, CompareMethod=self.CompareEqualHyp)
|
|
|
|
return hyp
|
|
|
|
|
2013-04-04 13:08:19 +06:00
|
|
|
pass # end of StdMeshersBuilder_Segment class
|
2012-08-09 16:03:55 +06:00
|
|
|
|
2012-10-08 17:56:59 +06:00
|
|
|
## Segment 1D algorithm for discretization of a set of adjacent edges as one edge.
|
|
|
|
#
|
2013-04-08 20:50:20 +06:00
|
|
|
# It is created by calling smeshBuilder.Mesh.Segment(smeshBuilder.COMPOSITE,geom=0)
|
2012-08-09 16:03:55 +06:00
|
|
|
#
|
|
|
|
# @ingroup l3_algos_basic
|
2013-04-04 13:08:19 +06:00
|
|
|
class StdMeshersBuilder_CompositeSegment(StdMeshersBuilder_Segment):
|
2012-08-09 16:03:55 +06:00
|
|
|
|
2013-04-05 15:00:43 +06:00
|
|
|
## name of the dynamic method in smeshBuilder.Mesh class
|
2012-10-08 17:56:59 +06:00
|
|
|
# @internal
|
2012-08-09 16:03:55 +06:00
|
|
|
meshMethod = "Segment"
|
2013-04-05 15:00:43 +06:00
|
|
|
## type of algorithm used with helper function in smeshBuilder.Mesh class
|
2012-10-08 17:56:59 +06:00
|
|
|
# @internal
|
2012-08-09 16:03:55 +06:00
|
|
|
algoType = COMPOSITE
|
2015-06-30 17:14:46 +05:00
|
|
|
## flag pointing whether this algorithm should be used by default in dynamic method
|
2013-04-05 15:00:43 +06:00
|
|
|
# of smeshBuilder.Mesh class
|
2012-10-08 17:56:59 +06:00
|
|
|
# @internal
|
2012-08-09 16:03:55 +06:00
|
|
|
isDefault = False
|
2012-10-08 17:56:59 +06:00
|
|
|
## doc string of the method
|
|
|
|
# @internal
|
|
|
|
docHelper = "Creates segment 1D algorithm for edges"
|
2012-08-09 16:03:55 +06:00
|
|
|
|
|
|
|
## Private constructor.
|
2012-10-08 17:56:59 +06:00
|
|
|
# @param mesh parent mesh object algorithm is assigned to
|
|
|
|
# @param geom geometry (shape/sub-shape) algorithm is assigned to;
|
|
|
|
# if it is @c 0 (default), the algorithm is assigned to the main shape
|
2012-08-09 16:03:55 +06:00
|
|
|
def __init__(self, mesh, geom=0):
|
|
|
|
self.Create(mesh, geom, self.algoType)
|
2012-10-08 17:56:59 +06:00
|
|
|
pass
|
2012-08-09 16:03:55 +06:00
|
|
|
|
2013-04-04 13:08:19 +06:00
|
|
|
pass # end of StdMeshersBuilder_CompositeSegment class
|
2012-08-09 16:03:55 +06:00
|
|
|
|
2012-10-08 17:56:59 +06:00
|
|
|
## Defines a segment 1D algorithm for discretization of edges with Python function
|
|
|
|
#
|
2013-04-08 20:50:20 +06:00
|
|
|
# It is created by calling smeshBuilder.Mesh.Segment(smeshBuilder.PYTHON,geom=0)
|
2012-08-09 16:03:55 +06:00
|
|
|
#
|
|
|
|
# @ingroup l3_algos_basic
|
2013-04-04 13:08:19 +06:00
|
|
|
class StdMeshersBuilder_Segment_Python(Mesh_Algorithm):
|
2012-08-09 16:03:55 +06:00
|
|
|
|
2013-04-05 15:00:43 +06:00
|
|
|
## name of the dynamic method in smeshBuilder.Mesh class
|
2012-10-08 17:56:59 +06:00
|
|
|
# @internal
|
2012-08-09 16:03:55 +06:00
|
|
|
meshMethod = "Segment"
|
2013-04-05 15:00:43 +06:00
|
|
|
## type of algorithm used with helper function in smeshBuilder.Mesh class
|
2012-10-08 17:56:59 +06:00
|
|
|
# @internal
|
2012-08-09 16:03:55 +06:00
|
|
|
algoType = PYTHON
|
2012-10-08 17:56:59 +06:00
|
|
|
## doc string of the method
|
|
|
|
# @internal
|
|
|
|
docHelper = "Creates segment 1D algorithm for edges"
|
2012-08-09 16:03:55 +06:00
|
|
|
|
|
|
|
## Private constructor.
|
2012-10-08 17:56:59 +06:00
|
|
|
# @param mesh parent mesh object algorithm is assigned to
|
|
|
|
# @param geom geometry (shape/sub-shape) algorithm is assigned to;
|
|
|
|
# if it is @c 0 (default), the algorithm is assigned to the main shape
|
2012-08-09 16:03:55 +06:00
|
|
|
def __init__(self, mesh, geom=0):
|
|
|
|
import Python1dPlugin
|
|
|
|
self.Create(mesh, geom, self.algoType, "libPython1dEngine.so")
|
2012-10-08 17:56:59 +06:00
|
|
|
pass
|
2012-08-09 16:03:55 +06:00
|
|
|
|
|
|
|
## Defines "PythonSplit1D" hypothesis
|
|
|
|
# @param n for the number of segments that cut an edge
|
|
|
|
# @param func for the python function that calculates the length of all segments
|
|
|
|
# @param UseExisting if ==true - searches for the existing hypothesis created with
|
|
|
|
# the same parameters, else (default) - creates a new one
|
|
|
|
# @ingroup l3_hypos_1dhyps
|
|
|
|
def PythonSplit1D(self, n, func, UseExisting=0):
|
|
|
|
compFun = lambda hyp, args: False
|
|
|
|
hyp = self.Hypothesis("PythonSplit1D", [n], "libPython1dEngine.so",
|
|
|
|
UseExisting=UseExisting, CompareMethod=compFun)
|
|
|
|
hyp.SetNumberOfSegments(n)
|
|
|
|
hyp.SetPythonLog10RatioFunction(func)
|
|
|
|
return hyp
|
|
|
|
|
2013-04-04 13:08:19 +06:00
|
|
|
pass # end of StdMeshersBuilder_Segment_Python class
|
2012-08-09 16:03:55 +06:00
|
|
|
|
|
|
|
## Triangle MEFISTO 2D algorithm
|
2012-10-08 17:56:59 +06:00
|
|
|
#
|
2013-04-08 20:50:20 +06:00
|
|
|
# It is created by calling smeshBuilder.Mesh.Triangle(smeshBuilder.MEFISTO,geom=0)
|
2012-08-09 16:03:55 +06:00
|
|
|
#
|
|
|
|
# @ingroup l3_algos_basic
|
2013-04-04 13:08:19 +06:00
|
|
|
class StdMeshersBuilder_Triangle_MEFISTO(Mesh_Algorithm):
|
2012-08-09 16:03:55 +06:00
|
|
|
|
2013-04-05 15:00:43 +06:00
|
|
|
## name of the dynamic method in smeshBuilder.Mesh class
|
2012-10-08 17:56:59 +06:00
|
|
|
# @internal
|
2012-08-09 16:03:55 +06:00
|
|
|
meshMethod = "Triangle"
|
2013-04-05 15:00:43 +06:00
|
|
|
## type of algorithm used with helper function in smeshBuilder.Mesh class
|
2012-10-08 17:56:59 +06:00
|
|
|
# @internal
|
2012-08-09 16:03:55 +06:00
|
|
|
algoType = MEFISTO
|
2015-06-30 17:14:46 +05:00
|
|
|
## flag pointing whether this algorithm should be used by default in dynamic method
|
2013-04-05 15:00:43 +06:00
|
|
|
# of smeshBuilder.Mesh class
|
2012-10-08 17:56:59 +06:00
|
|
|
# @internal
|
2012-08-09 16:03:55 +06:00
|
|
|
isDefault = True
|
2012-10-08 17:56:59 +06:00
|
|
|
## doc string of the method
|
|
|
|
# @internal
|
|
|
|
docHelper = "Creates triangle 2D algorithm for faces"
|
2012-08-09 16:03:55 +06:00
|
|
|
|
|
|
|
## Private constructor.
|
2012-10-08 17:56:59 +06:00
|
|
|
# @param mesh parent mesh object algorithm is assigned to
|
|
|
|
# @param geom geometry (shape/sub-shape) algorithm is assigned to;
|
|
|
|
# if it is @c 0 (default), the algorithm is assigned to the main shape
|
2012-08-09 16:03:55 +06:00
|
|
|
def __init__(self, mesh, geom=0):
|
|
|
|
Mesh_Algorithm.__init__(self)
|
|
|
|
self.Create(mesh, geom, self.algoType)
|
2012-10-08 17:56:59 +06:00
|
|
|
pass
|
2012-08-09 16:03:55 +06:00
|
|
|
|
|
|
|
## Defines "MaxElementArea" hypothesis basing on the definition of the maximum area of each triangle
|
|
|
|
# @param area for the maximum area of each triangle
|
|
|
|
# @param UseExisting if ==true - searches for an existing hypothesis created with the
|
|
|
|
# same parameters, else (default) - creates a new one
|
|
|
|
#
|
|
|
|
# @ingroup l3_hypos_2dhyps
|
|
|
|
def MaxElementArea(self, area, UseExisting=0):
|
2013-11-22 18:36:27 +06:00
|
|
|
from salome.smesh.smeshBuilder import IsEqual
|
2012-08-09 16:03:55 +06:00
|
|
|
comparator = lambda hyp, args: IsEqual(hyp.GetMaxElementArea(), args[0])
|
|
|
|
hyp = self.Hypothesis("MaxElementArea", [area], UseExisting=UseExisting,
|
|
|
|
CompareMethod=comparator)
|
|
|
|
hyp.SetMaxElementArea(area)
|
|
|
|
return hyp
|
|
|
|
|
|
|
|
## Defines "LengthFromEdges" hypothesis to build triangles
|
|
|
|
# based on the length of the edges taken from the wire
|
|
|
|
#
|
|
|
|
# @ingroup l3_hypos_2dhyps
|
|
|
|
def LengthFromEdges(self):
|
|
|
|
hyp = self.Hypothesis("LengthFromEdges", UseExisting=1, CompareMethod=self.CompareEqualHyp)
|
|
|
|
return hyp
|
|
|
|
|
2013-04-04 13:08:19 +06:00
|
|
|
pass # end of StdMeshersBuilder_Triangle_MEFISTO class
|
2012-08-09 16:03:55 +06:00
|
|
|
|
|
|
|
## Defines a quadrangle 2D algorithm
|
2012-10-08 17:56:59 +06:00
|
|
|
#
|
2013-04-05 15:00:43 +06:00
|
|
|
# It is created by calling smeshBuilder.Mesh.Quadrangle(geom=0)
|
2012-08-09 16:03:55 +06:00
|
|
|
#
|
|
|
|
# @ingroup l3_algos_basic
|
2013-04-04 13:08:19 +06:00
|
|
|
class StdMeshersBuilder_Quadrangle(Mesh_Algorithm):
|
2012-08-09 16:03:55 +06:00
|
|
|
|
2013-04-05 15:00:43 +06:00
|
|
|
## name of the dynamic method in smeshBuilder.Mesh class
|
2012-10-08 17:56:59 +06:00
|
|
|
# @internal
|
2012-08-09 16:03:55 +06:00
|
|
|
meshMethod = "Quadrangle"
|
2013-04-05 15:00:43 +06:00
|
|
|
## type of algorithm used with helper function in smeshBuilder.Mesh class
|
2012-10-08 17:56:59 +06:00
|
|
|
# @internal
|
2012-08-09 16:03:55 +06:00
|
|
|
algoType = QUADRANGLE
|
2015-06-30 17:14:46 +05:00
|
|
|
## flag pointing whether this algorithm should be used by default in dynamic method
|
2013-04-05 15:00:43 +06:00
|
|
|
# of smeshBuilder.Mesh class
|
2012-10-08 17:56:59 +06:00
|
|
|
# @internal
|
2012-08-09 16:03:55 +06:00
|
|
|
isDefault = True
|
2012-10-08 17:56:59 +06:00
|
|
|
## doc string of the method
|
|
|
|
# @internal
|
|
|
|
docHelper = "Creates quadrangle 2D algorithm for faces"
|
|
|
|
## hypothesis associated with algorithm
|
|
|
|
# @internal
|
|
|
|
params = 0
|
2012-08-09 16:03:55 +06:00
|
|
|
|
|
|
|
## Private constructor.
|
2012-10-08 17:56:59 +06:00
|
|
|
# @param mesh parent mesh object algorithm is assigned to
|
|
|
|
# @param geom geometry (shape/sub-shape) algorithm is assigned to;
|
|
|
|
# if it is @c 0 (default), the algorithm is assigned to the main shape
|
2012-08-09 16:03:55 +06:00
|
|
|
def __init__(self, mesh, geom=0):
|
|
|
|
Mesh_Algorithm.__init__(self)
|
|
|
|
self.Create(mesh, geom, self.algoType)
|
2012-10-08 17:56:59 +06:00
|
|
|
pass
|
2012-08-09 16:03:55 +06:00
|
|
|
|
|
|
|
## Defines "QuadrangleParameters" hypothesis
|
|
|
|
# @param quadType defines the algorithm of transition between differently descretized
|
|
|
|
# sides of a geometrical face:
|
|
|
|
# - QUAD_STANDARD - both triangles and quadrangles are possible in the transition
|
|
|
|
# area along the finer meshed sides.
|
|
|
|
# - QUAD_TRIANGLE_PREF - only triangles are built in the transition area along the
|
|
|
|
# finer meshed sides.
|
|
|
|
# - QUAD_QUADRANGLE_PREF - only quadrangles are built in the transition area along
|
|
|
|
# the finer meshed sides, iff the total quantity of segments on
|
|
|
|
# all four sides of the face is even (divisible by 2).
|
|
|
|
# - QUAD_QUADRANGLE_PREF_REVERSED - same as QUAD_QUADRANGLE_PREF but the transition
|
|
|
|
# area is located along the coarser meshed sides.
|
|
|
|
# - QUAD_REDUCED - only quadrangles are built and the transition between the sides
|
|
|
|
# is made gradually, layer by layer. This type has a limitation on
|
|
|
|
# the number of segments: one pair of opposite sides must have the
|
|
|
|
# same number of segments, the other pair must have an even difference
|
|
|
|
# between the numbers of segments on the sides.
|
|
|
|
# @param triangleVertex: vertex of a trilateral geometrical face, around which triangles
|
2014-01-15 15:41:17 +06:00
|
|
|
# will be created while other elements will be quadrangles.
|
|
|
|
# Vertex can be either a GEOM_Object or a vertex ID within the
|
|
|
|
# shape to mesh
|
|
|
|
# @param enfVertices: list of shapes defining positions where nodes (enforced nodes)
|
|
|
|
# must be created by the mesher. Shapes can be of any type,
|
|
|
|
# vertices of given shapes define positions of enforced nodes.
|
|
|
|
# Only vertices successfully projected to the face are used.
|
2014-02-04 19:02:26 +06:00
|
|
|
# @param enfPoints: list of points giving positions of enforced nodes.
|
2014-01-15 15:41:17 +06:00
|
|
|
# Point can be defined either as SMESH.PointStruct's
|
|
|
|
# ([SMESH.PointStruct(x1,y1,z1), SMESH.PointStruct(x2,y2,z2),...])
|
|
|
|
# or triples of values ([[x1,y1,z1], [x2,y2,z2], ...]).
|
|
|
|
# In the case if the defined QuadrangleParameters() refer to a sole face,
|
|
|
|
# all given points must lie on this face, else the mesher fails.
|
|
|
|
# @param UseExisting: if \c True - searches for the existing hypothesis created with
|
|
|
|
# the same parameters, else (default) - creates a new one
|
2012-08-09 16:03:55 +06:00
|
|
|
# @ingroup l3_hypos_quad
|
2014-01-15 15:41:17 +06:00
|
|
|
def QuadrangleParameters(self, quadType=StdMeshers.QUAD_STANDARD, triangleVertex=0,
|
|
|
|
enfVertices=[],enfPoints=[],UseExisting=0):
|
|
|
|
import GEOM, SMESH
|
2012-08-09 16:03:55 +06:00
|
|
|
vertexID = triangleVertex
|
|
|
|
if isinstance( triangleVertex, GEOM._objref_GEOM_Object ):
|
|
|
|
vertexID = self.mesh.geompyD.GetSubShapeID( self.mesh.geom, triangleVertex )
|
2014-01-15 15:41:17 +06:00
|
|
|
if isinstance( enfVertices, int ) and not enfPoints and not UseExisting:
|
|
|
|
# a call of old syntax, before inserting enfVertices and enfPoints before UseExisting
|
|
|
|
UseExisting, enfVertices = enfVertices, []
|
|
|
|
pStructs, xyz = [], []
|
|
|
|
for p in enfPoints:
|
|
|
|
if isinstance( p, SMESH.PointStruct ):
|
|
|
|
xyz.append(( p.x, p.y, p.z ))
|
|
|
|
pStructs.append( p )
|
|
|
|
else:
|
|
|
|
xyz.append(( p[0], p[1], p[2] ))
|
|
|
|
pStructs.append( SMESH.PointStruct( p[0], p[1], p[2] ))
|
2012-08-09 16:03:55 +06:00
|
|
|
if not self.params:
|
|
|
|
compFun = lambda hyp,args: \
|
|
|
|
hyp.GetQuadType() == args[0] and \
|
2014-01-15 15:41:17 +06:00
|
|
|
(hyp.GetTriaVertex()==args[1] or ( hyp.GetTriaVertex()<1 and args[1]<1)) and \
|
|
|
|
((hyp.GetEnforcedNodes()) == (args[2],args[3])) # True w/o enfVertices only
|
|
|
|
entries = [ shape.GetStudyEntry() for shape in enfVertices ]
|
|
|
|
self.params = self.Hypothesis("QuadrangleParams", [quadType,vertexID,entries,xyz],
|
2012-08-09 16:03:55 +06:00
|
|
|
UseExisting = UseExisting, CompareMethod=compFun)
|
|
|
|
pass
|
|
|
|
if self.params.GetQuadType() != quadType:
|
|
|
|
self.params.SetQuadType(quadType)
|
|
|
|
if vertexID > 0:
|
|
|
|
self.params.SetTriaVertex( vertexID )
|
2014-01-15 15:41:17 +06:00
|
|
|
from salome.smesh.smeshBuilder import AssureGeomPublished
|
|
|
|
for v in enfVertices:
|
|
|
|
AssureGeomPublished( self.mesh, v )
|
|
|
|
self.params.SetEnforcedNodes( enfVertices, pStructs )
|
2012-08-09 16:03:55 +06:00
|
|
|
return self.params
|
|
|
|
|
|
|
|
## Defines "QuadrangleParams" hypothesis with a type of quadrangulation that only
|
|
|
|
# quadrangles are built in the transition area along the finer meshed sides,
|
|
|
|
# iff the total quantity of segments on all four sides of the face is even.
|
|
|
|
# @param reversed if True, transition area is located along the coarser meshed sides.
|
|
|
|
# @param UseExisting: if ==true - searches for the existing hypothesis created with
|
|
|
|
# the same parameters, else (default) - creates a new one
|
|
|
|
# @ingroup l3_hypos_quad
|
|
|
|
def QuadranglePreference(self, reversed=False, UseExisting=0):
|
|
|
|
if reversed:
|
|
|
|
return self.QuadrangleParameters(QUAD_QUADRANGLE_PREF_REVERSED,UseExisting=UseExisting)
|
|
|
|
return self.QuadrangleParameters(QUAD_QUADRANGLE_PREF,UseExisting=UseExisting)
|
|
|
|
|
|
|
|
## Defines "QuadrangleParams" hypothesis with a type of quadrangulation that only
|
|
|
|
# triangles are built in the transition area along the finer meshed sides.
|
|
|
|
# @param UseExisting: if ==true - searches for the existing hypothesis created with
|
|
|
|
# the same parameters, else (default) - creates a new one
|
|
|
|
# @ingroup l3_hypos_quad
|
|
|
|
def TrianglePreference(self, UseExisting=0):
|
|
|
|
return self.QuadrangleParameters(QUAD_TRIANGLE_PREF,UseExisting=UseExisting)
|
|
|
|
|
|
|
|
## Defines "QuadrangleParams" hypothesis with a type of quadrangulation that only
|
|
|
|
# quadrangles are built and the transition between the sides is made gradually,
|
|
|
|
# layer by layer. This type has a limitation on the number of segments: one pair
|
|
|
|
# of opposite sides must have the same number of segments, the other pair must
|
|
|
|
# have an even difference between the numbers of segments on the sides.
|
|
|
|
# @param UseExisting: if ==true - searches for the existing hypothesis created with
|
|
|
|
# the same parameters, else (default) - creates a new one
|
|
|
|
# @ingroup l3_hypos_quad
|
|
|
|
def Reduced(self, UseExisting=0):
|
|
|
|
return self.QuadrangleParameters(QUAD_REDUCED,UseExisting=UseExisting)
|
|
|
|
|
|
|
|
## Defines "QuadrangleParams" hypothesis with QUAD_STANDARD type of quadrangulation
|
|
|
|
# @param vertex: vertex of a trilateral geometrical face, around which triangles
|
|
|
|
# will be created while other elements will be quadrangles.
|
|
|
|
# Vertex can be either a GEOM_Object or a vertex ID within the
|
|
|
|
# shape to mesh
|
|
|
|
# @param UseExisting: if ==true - searches for the existing hypothesis created with
|
|
|
|
# the same parameters, else (default) - creates a new one
|
|
|
|
# @ingroup l3_hypos_quad
|
|
|
|
def TriangleVertex(self, vertex, UseExisting=0):
|
|
|
|
return self.QuadrangleParameters(QUAD_STANDARD,vertex,UseExisting)
|
|
|
|
|
2013-04-04 13:08:19 +06:00
|
|
|
pass # end of StdMeshersBuilder_Quadrangle class
|
2012-08-09 16:03:55 +06:00
|
|
|
|
|
|
|
## Defines a hexahedron 3D algorithm
|
2012-10-08 17:56:59 +06:00
|
|
|
#
|
2013-04-05 15:00:43 +06:00
|
|
|
# It is created by calling smeshBuilder.Mesh.Hexahedron(geom=0)
|
2012-08-09 16:03:55 +06:00
|
|
|
#
|
|
|
|
# @ingroup l3_algos_basic
|
2013-04-04 13:08:19 +06:00
|
|
|
class StdMeshersBuilder_Hexahedron(Mesh_Algorithm):
|
2012-08-09 16:03:55 +06:00
|
|
|
|
2013-04-05 15:00:43 +06:00
|
|
|
## name of the dynamic method in smeshBuilder.Mesh class
|
2012-10-08 17:56:59 +06:00
|
|
|
# @internal
|
2012-08-09 16:03:55 +06:00
|
|
|
meshMethod = "Hexahedron"
|
2013-04-05 15:00:43 +06:00
|
|
|
## type of algorithm used with helper function in smeshBuilder.Mesh class
|
2012-10-08 17:56:59 +06:00
|
|
|
# @internal
|
2012-08-09 16:03:55 +06:00
|
|
|
algoType = Hexa
|
2015-06-30 17:14:46 +05:00
|
|
|
## flag pointing whether this algorithm should be used by default in dynamic method
|
2013-04-05 15:00:43 +06:00
|
|
|
# of smeshBuilder.Mesh class
|
2012-10-08 17:56:59 +06:00
|
|
|
# @internal
|
2012-08-09 16:03:55 +06:00
|
|
|
isDefault = True
|
2012-10-08 17:56:59 +06:00
|
|
|
## doc string of the method
|
|
|
|
# @internal
|
|
|
|
docHelper = "Creates hexahedron 3D algorithm for volumes"
|
2012-08-09 16:03:55 +06:00
|
|
|
|
|
|
|
## Private constructor.
|
2012-10-08 17:56:59 +06:00
|
|
|
# @param mesh parent mesh object algorithm is assigned to
|
|
|
|
# @param geom geometry (shape/sub-shape) algorithm is assigned to;
|
|
|
|
# if it is @c 0 (default), the algorithm is assigned to the main shape
|
2012-08-09 16:03:55 +06:00
|
|
|
def __init__(self, mesh, geom=0):
|
|
|
|
Mesh_Algorithm.__init__(self)
|
|
|
|
self.Create(mesh, geom, Hexa)
|
|
|
|
pass
|
|
|
|
|
2013-04-04 13:08:19 +06:00
|
|
|
pass # end of StdMeshersBuilder_Hexahedron class
|
2012-08-09 16:03:55 +06:00
|
|
|
|
|
|
|
## Defines a projection 1D algorithm
|
2012-10-08 17:56:59 +06:00
|
|
|
#
|
2013-04-05 15:00:43 +06:00
|
|
|
# It is created by calling smeshBuilder.Mesh.Projection1D(geom=0)
|
2012-08-09 16:03:55 +06:00
|
|
|
#
|
2012-10-08 17:56:59 +06:00
|
|
|
# @ingroup l3_algos_proj
|
2013-04-04 13:08:19 +06:00
|
|
|
class StdMeshersBuilder_Projection1D(Mesh_Algorithm):
|
2012-08-09 16:03:55 +06:00
|
|
|
|
2013-04-05 15:00:43 +06:00
|
|
|
## name of the dynamic method in smeshBuilder.Mesh class
|
2012-10-08 17:56:59 +06:00
|
|
|
# @internal
|
2012-08-09 16:03:55 +06:00
|
|
|
meshMethod = "Projection1D"
|
2013-04-05 15:00:43 +06:00
|
|
|
## type of algorithm used with helper function in smeshBuilder.Mesh class
|
2012-10-08 17:56:59 +06:00
|
|
|
# @internal
|
2012-08-09 16:03:55 +06:00
|
|
|
algoType = "Projection_1D"
|
2015-06-30 17:14:46 +05:00
|
|
|
## flag pointing whether this algorithm should be used by default in dynamic method
|
2013-04-05 15:00:43 +06:00
|
|
|
# of smeshBuilder.Mesh class
|
2012-10-08 17:56:59 +06:00
|
|
|
# @internal
|
2012-08-09 16:03:55 +06:00
|
|
|
isDefault = True
|
2012-10-08 17:56:59 +06:00
|
|
|
## doc string of the method
|
|
|
|
# @internal
|
|
|
|
docHelper = "Creates projection 1D algorithm for edges"
|
2012-08-09 16:03:55 +06:00
|
|
|
|
|
|
|
## Private constructor.
|
2012-10-08 17:56:59 +06:00
|
|
|
# @param mesh parent mesh object algorithm is assigned to
|
|
|
|
# @param geom geometry (shape/sub-shape) algorithm is assigned to;
|
|
|
|
# if it is @c 0 (default), the algorithm is assigned to the main shape
|
2012-08-09 16:03:55 +06:00
|
|
|
def __init__(self, mesh, geom=0):
|
|
|
|
Mesh_Algorithm.__init__(self)
|
|
|
|
self.Create(mesh, geom, self.algoType)
|
2012-10-08 17:56:59 +06:00
|
|
|
pass
|
2012-08-09 16:03:55 +06:00
|
|
|
|
|
|
|
## Defines "Source Edge" hypothesis, specifying a meshed edge, from where
|
|
|
|
# a mesh pattern is taken, and, optionally, the association of vertices
|
|
|
|
# between the source edge and a target edge (to which a hypothesis is assigned)
|
|
|
|
# @param edge from which nodes distribution is taken
|
|
|
|
# @param mesh from which nodes distribution is taken (optional)
|
|
|
|
# @param srcV a vertex of \a edge to associate with \a tgtV (optional)
|
|
|
|
# @param tgtV a vertex of \a the edge to which the algorithm is assigned,
|
|
|
|
# to associate with \a srcV (optional)
|
|
|
|
# @param UseExisting if ==true - searches for the existing hypothesis created with
|
|
|
|
# the same parameters, else (default) - creates a new one
|
|
|
|
def SourceEdge(self, edge, mesh=None, srcV=None, tgtV=None, UseExisting=0):
|
2013-11-25 15:13:09 +06:00
|
|
|
from salome.smesh.smeshBuilder import AssureGeomPublished, Mesh
|
2012-08-09 16:03:55 +06:00
|
|
|
AssureGeomPublished( self.mesh, edge )
|
|
|
|
AssureGeomPublished( self.mesh, srcV )
|
|
|
|
AssureGeomPublished( self.mesh, tgtV )
|
|
|
|
hyp = self.Hypothesis("ProjectionSource1D", [edge,mesh,srcV,tgtV],
|
|
|
|
UseExisting=0)
|
|
|
|
# it does not seem to be useful to reuse the existing "SourceEdge" hypothesis
|
|
|
|
#UseExisting=UseExisting, CompareMethod=self.CompareSourceEdge)
|
|
|
|
hyp.SetSourceEdge( edge )
|
|
|
|
if not mesh is None and isinstance(mesh, Mesh):
|
|
|
|
mesh = mesh.GetMesh()
|
|
|
|
hyp.SetSourceMesh( mesh )
|
|
|
|
hyp.SetVertexAssociation( srcV, tgtV )
|
|
|
|
return hyp
|
|
|
|
|
2013-04-04 13:08:19 +06:00
|
|
|
pass # end of StdMeshersBuilder_Projection1D class
|
2012-08-09 16:03:55 +06:00
|
|
|
|
|
|
|
## Defines a projection 2D algorithm
|
2012-10-08 17:56:59 +06:00
|
|
|
#
|
2013-04-05 15:00:43 +06:00
|
|
|
# It is created by calling smeshBuilder.Mesh.Projection2D(geom=0)
|
2012-08-09 16:03:55 +06:00
|
|
|
#
|
2012-10-08 17:56:59 +06:00
|
|
|
# @ingroup l3_algos_proj
|
2013-04-04 13:08:19 +06:00
|
|
|
class StdMeshersBuilder_Projection2D(Mesh_Algorithm):
|
2012-08-09 16:03:55 +06:00
|
|
|
|
2013-04-05 15:00:43 +06:00
|
|
|
## name of the dynamic method in smeshBuilder.Mesh class
|
2012-10-08 17:56:59 +06:00
|
|
|
# @internal
|
2012-08-09 16:03:55 +06:00
|
|
|
meshMethod = "Projection2D"
|
2013-04-05 15:00:43 +06:00
|
|
|
## type of algorithm used with helper function in smeshBuilder.Mesh class
|
2012-10-08 17:56:59 +06:00
|
|
|
# @internal
|
2012-08-09 16:03:55 +06:00
|
|
|
algoType = "Projection_2D"
|
2015-06-30 17:14:46 +05:00
|
|
|
## flag pointing whether this algorithm should be used by default in dynamic method
|
2013-04-05 15:00:43 +06:00
|
|
|
# of smeshBuilder.Mesh class
|
2012-10-08 17:56:59 +06:00
|
|
|
# @internal
|
2012-08-09 16:03:55 +06:00
|
|
|
isDefault = True
|
2012-10-08 17:56:59 +06:00
|
|
|
## doc string of the method
|
|
|
|
# @internal
|
|
|
|
docHelper = "Creates projection 2D algorithm for faces"
|
2012-08-09 16:03:55 +06:00
|
|
|
|
|
|
|
## Private constructor.
|
2012-10-08 17:56:59 +06:00
|
|
|
# @param mesh parent mesh object algorithm is assigned to
|
|
|
|
# @param geom geometry (shape/sub-shape) algorithm is assigned to;
|
|
|
|
# if it is @c 0 (default), the algorithm is assigned to the main shape
|
2012-08-09 16:03:55 +06:00
|
|
|
def __init__(self, mesh, geom=0):
|
|
|
|
Mesh_Algorithm.__init__(self)
|
|
|
|
self.Create(mesh, geom, self.algoType)
|
2012-10-08 17:56:59 +06:00
|
|
|
pass
|
2012-08-09 16:03:55 +06:00
|
|
|
|
|
|
|
## Defines "Source Face" hypothesis, specifying a meshed face, from where
|
|
|
|
# a mesh pattern is taken, and, optionally, the association of vertices
|
|
|
|
# between the source face and the target face (to which a hypothesis is assigned)
|
|
|
|
# @param face from which the mesh pattern is taken
|
|
|
|
# @param mesh from which the mesh pattern is taken (optional)
|
|
|
|
# @param srcV1 a vertex of \a face to associate with \a tgtV1 (optional)
|
|
|
|
# @param tgtV1 a vertex of \a the face to which the algorithm is assigned,
|
|
|
|
# to associate with \a srcV1 (optional)
|
|
|
|
# @param srcV2 a vertex of \a face to associate with \a tgtV1 (optional)
|
|
|
|
# @param tgtV2 a vertex of \a the face to which the algorithm is assigned,
|
|
|
|
# to associate with \a srcV2 (optional)
|
|
|
|
# @param UseExisting if ==true - forces the search for the existing hypothesis created with
|
|
|
|
# the same parameters, else (default) - forces the creation a new one
|
|
|
|
#
|
|
|
|
# Note: all association vertices must belong to one edge of a face
|
|
|
|
def SourceFace(self, face, mesh=None, srcV1=None, tgtV1=None,
|
|
|
|
srcV2=None, tgtV2=None, UseExisting=0):
|
2013-04-04 13:08:19 +06:00
|
|
|
from salome.smesh.smeshBuilder import Mesh
|
2012-08-09 16:03:55 +06:00
|
|
|
if isinstance(mesh, Mesh):
|
|
|
|
mesh = mesh.GetMesh()
|
|
|
|
for geom in [ face, srcV1, tgtV1, srcV2, tgtV2 ]:
|
2013-11-22 18:36:27 +06:00
|
|
|
from salome.smesh.smeshBuilder import AssureGeomPublished
|
2012-08-09 16:03:55 +06:00
|
|
|
AssureGeomPublished( self.mesh, geom )
|
|
|
|
hyp = self.Hypothesis("ProjectionSource2D", [face,mesh,srcV1,tgtV1,srcV2,tgtV2],
|
2014-08-27 21:16:07 +06:00
|
|
|
UseExisting=0, toAdd=False)
|
2012-08-09 16:03:55 +06:00
|
|
|
# it does not seem to be useful to reuse the existing "SourceFace" hypothesis
|
|
|
|
#UseExisting=UseExisting, CompareMethod=self.CompareSourceFace)
|
|
|
|
hyp.SetSourceFace( face )
|
|
|
|
hyp.SetSourceMesh( mesh )
|
|
|
|
hyp.SetVertexAssociation( srcV1, srcV2, tgtV1, tgtV2 )
|
2014-08-27 21:16:07 +06:00
|
|
|
self.mesh.AddHypothesis(hyp, self.geom)
|
2012-08-09 16:03:55 +06:00
|
|
|
return hyp
|
|
|
|
|
2013-04-04 13:08:19 +06:00
|
|
|
pass # end of StdMeshersBuilder_Projection2D class
|
2012-08-09 16:03:55 +06:00
|
|
|
|
|
|
|
## Defines a projection 1D-2D algorithm
|
2012-10-08 17:56:59 +06:00
|
|
|
#
|
2013-04-05 15:00:43 +06:00
|
|
|
# It is created by calling smeshBuilder.Mesh.Projection1D2D(geom=0)
|
2012-08-09 16:03:55 +06:00
|
|
|
#
|
|
|
|
# @ingroup l3_algos_proj
|
2013-04-04 13:08:19 +06:00
|
|
|
class StdMeshersBuilder_Projection1D2D(StdMeshersBuilder_Projection2D):
|
2012-08-09 16:03:55 +06:00
|
|
|
|
2013-04-05 15:00:43 +06:00
|
|
|
## name of the dynamic method in smeshBuilder.Mesh class
|
2012-10-08 17:56:59 +06:00
|
|
|
# @internal
|
2012-08-09 16:03:55 +06:00
|
|
|
meshMethod = "Projection1D2D"
|
2013-04-05 15:00:43 +06:00
|
|
|
## type of algorithm used with helper function in smeshBuilder.Mesh class
|
2012-10-08 17:56:59 +06:00
|
|
|
# @internal
|
2012-08-09 16:03:55 +06:00
|
|
|
algoType = "Projection_1D2D"
|
2012-10-08 17:56:59 +06:00
|
|
|
## doc string of the method
|
|
|
|
# @internal
|
2015-06-15 23:31:23 +05:00
|
|
|
docHelper = "Creates projection 1D-2D algorithm for faces"
|
2012-08-09 16:03:55 +06:00
|
|
|
|
|
|
|
## Private constructor.
|
2012-10-08 17:56:59 +06:00
|
|
|
# @param mesh parent mesh object algorithm is assigned to
|
|
|
|
# @param geom geometry (shape/sub-shape) algorithm is assigned to;
|
|
|
|
# if it is @c 0 (default), the algorithm is assigned to the main shape
|
2012-08-09 16:03:55 +06:00
|
|
|
def __init__(self, mesh, geom=0):
|
2013-04-04 13:08:19 +06:00
|
|
|
StdMeshersBuilder_Projection2D.__init__(self, mesh, geom)
|
2012-10-08 17:56:59 +06:00
|
|
|
pass
|
2012-08-09 16:03:55 +06:00
|
|
|
|
2013-04-04 13:08:19 +06:00
|
|
|
pass # end of StdMeshersBuilder_Projection1D2D class
|
2012-08-09 16:03:55 +06:00
|
|
|
|
|
|
|
## Defines a projection 3D algorithm
|
2012-10-08 17:56:59 +06:00
|
|
|
#
|
2013-04-05 15:00:43 +06:00
|
|
|
# It is created by calling smeshBuilder.Mesh.Projection3D(geom=0)
|
2012-08-09 16:03:55 +06:00
|
|
|
#
|
|
|
|
# @ingroup l3_algos_proj
|
2013-04-04 13:08:19 +06:00
|
|
|
class StdMeshersBuilder_Projection3D(Mesh_Algorithm):
|
2012-08-09 16:03:55 +06:00
|
|
|
|
2013-04-05 15:00:43 +06:00
|
|
|
## name of the dynamic method in smeshBuilder.Mesh class
|
2012-10-08 17:56:59 +06:00
|
|
|
# @internal
|
2012-08-09 16:03:55 +06:00
|
|
|
meshMethod = "Projection3D"
|
2013-04-05 15:00:43 +06:00
|
|
|
## type of algorithm used with helper function in smeshBuilder.Mesh class
|
2012-10-08 17:56:59 +06:00
|
|
|
# @internal
|
2012-08-09 16:03:55 +06:00
|
|
|
algoType = "Projection_3D"
|
2012-10-08 17:56:59 +06:00
|
|
|
## doc string of the method
|
|
|
|
# @internal
|
|
|
|
docHelper = "Creates projection 3D algorithm for volumes"
|
2012-08-09 16:03:55 +06:00
|
|
|
|
|
|
|
## Private constructor.
|
2012-10-08 17:56:59 +06:00
|
|
|
# @param mesh parent mesh object algorithm is assigned to
|
|
|
|
# @param geom geometry (shape/sub-shape) algorithm is assigned to;
|
|
|
|
# if it is @c 0 (default), the algorithm is assigned to the main shape
|
2012-08-09 16:03:55 +06:00
|
|
|
def __init__(self, mesh, geom=0):
|
|
|
|
Mesh_Algorithm.__init__(self)
|
|
|
|
self.Create(mesh, geom, self.algoType)
|
2012-10-08 17:56:59 +06:00
|
|
|
pass
|
2012-08-09 16:03:55 +06:00
|
|
|
|
|
|
|
## Defines the "Source Shape 3D" hypothesis, specifying a meshed solid, from where
|
|
|
|
# the mesh pattern is taken, and, optionally, the association of vertices
|
|
|
|
# between the source and the target solid (to which a hipothesis is assigned)
|
|
|
|
# @param solid from where the mesh pattern is taken
|
|
|
|
# @param mesh from where the mesh pattern is taken (optional)
|
|
|
|
# @param srcV1 a vertex of \a solid to associate with \a tgtV1 (optional)
|
|
|
|
# @param tgtV1 a vertex of \a the solid where the algorithm is assigned,
|
|
|
|
# to associate with \a srcV1 (optional)
|
|
|
|
# @param srcV2 a vertex of \a solid to associate with \a tgtV1 (optional)
|
|
|
|
# @param tgtV2 a vertex of \a the solid to which the algorithm is assigned,
|
|
|
|
# to associate with \a srcV2 (optional)
|
|
|
|
# @param UseExisting - if ==true - searches for the existing hypothesis created with
|
|
|
|
# the same parameters, else (default) - creates a new one
|
|
|
|
#
|
|
|
|
# Note: association vertices must belong to one edge of a solid
|
|
|
|
def SourceShape3D(self, solid, mesh=0, srcV1=0, tgtV1=0,
|
|
|
|
srcV2=0, tgtV2=0, UseExisting=0):
|
|
|
|
for geom in [ solid, srcV1, tgtV1, srcV2, tgtV2 ]:
|
2013-11-22 18:36:27 +06:00
|
|
|
from salome.smesh.smeshBuilder import AssureGeomPublished
|
2012-08-09 16:03:55 +06:00
|
|
|
AssureGeomPublished( self.mesh, geom )
|
|
|
|
hyp = self.Hypothesis("ProjectionSource3D",
|
|
|
|
[solid,mesh,srcV1,tgtV1,srcV2,tgtV2],
|
|
|
|
UseExisting=0)
|
|
|
|
# seems to be not really useful to reuse existing "SourceShape3D" hypothesis
|
|
|
|
#UseExisting=UseExisting, CompareMethod=self.CompareSourceShape3D)
|
|
|
|
hyp.SetSource3DShape( solid )
|
2013-11-25 15:13:09 +06:00
|
|
|
from salome.smesh.smeshBuilder import Mesh
|
2012-08-09 16:03:55 +06:00
|
|
|
if isinstance(mesh, Mesh):
|
|
|
|
mesh = mesh.GetMesh()
|
|
|
|
if mesh:
|
|
|
|
hyp.SetSourceMesh( mesh )
|
|
|
|
if srcV1 and srcV2 and tgtV1 and tgtV2:
|
|
|
|
hyp.SetVertexAssociation( srcV1, srcV2, tgtV1, tgtV2 )
|
|
|
|
#elif srcV1 or srcV2 or tgtV1 or tgtV2:
|
|
|
|
return hyp
|
|
|
|
|
2013-04-04 13:08:19 +06:00
|
|
|
pass # end of StdMeshersBuilder_Projection3D class
|
2012-08-09 16:03:55 +06:00
|
|
|
|
|
|
|
## Defines a Prism 3D algorithm, which is either "Extrusion 3D" or "Radial Prism"
|
|
|
|
# depending on geometry
|
2012-10-08 17:56:59 +06:00
|
|
|
#
|
2013-04-05 15:00:43 +06:00
|
|
|
# It is created by calling smeshBuilder.Mesh.Prism(geom=0)
|
2012-08-09 16:03:55 +06:00
|
|
|
#
|
|
|
|
# @ingroup l3_algos_3dextr
|
2013-04-04 13:08:19 +06:00
|
|
|
class StdMeshersBuilder_Prism3D(Mesh_Algorithm):
|
2012-08-09 16:03:55 +06:00
|
|
|
|
2013-04-05 15:00:43 +06:00
|
|
|
## name of the dynamic method in smeshBuilder.Mesh class
|
2012-10-08 17:56:59 +06:00
|
|
|
# @internal
|
2012-08-09 16:03:55 +06:00
|
|
|
meshMethod = "Prism"
|
2013-04-05 15:00:43 +06:00
|
|
|
## type of algorithm used with helper function in smeshBuilder.Mesh class
|
2012-10-08 17:56:59 +06:00
|
|
|
# @internal
|
2012-08-09 16:03:55 +06:00
|
|
|
algoType = "Prism_3D"
|
2012-10-08 17:56:59 +06:00
|
|
|
## doc string of the method
|
|
|
|
# @internal
|
|
|
|
docHelper = "Creates prism 3D algorithm for volumes"
|
2012-08-09 16:03:55 +06:00
|
|
|
|
|
|
|
## Private constructor.
|
2012-10-08 17:56:59 +06:00
|
|
|
# @param mesh parent mesh object algorithm is assigned to
|
|
|
|
# @param geom geometry (shape/sub-shape) algorithm is assigned to;
|
|
|
|
# if it is @c 0 (default), the algorithm is assigned to the main shape
|
2012-08-09 16:03:55 +06:00
|
|
|
def __init__(self, mesh, geom=0):
|
|
|
|
Mesh_Algorithm.__init__(self)
|
|
|
|
|
|
|
|
shape = geom
|
|
|
|
if not shape:
|
|
|
|
shape = mesh.geom
|
2016-09-07 16:43:02 +05:00
|
|
|
isRadial = mesh.smeshpyD.IsApplicable("RadialPrism_3D", LIBRARY, shape, False )
|
|
|
|
if not isRadial:
|
2012-08-09 16:03:55 +06:00
|
|
|
self.Create(mesh, geom, "Prism_3D")
|
2012-10-08 17:56:59 +06:00
|
|
|
pass
|
2012-08-09 16:03:55 +06:00
|
|
|
else:
|
|
|
|
self.algoType = "RadialPrism_3D"
|
|
|
|
self.Create(mesh, geom, "RadialPrism_3D")
|
2013-04-01 19:05:47 +06:00
|
|
|
self.distribHyp = None #self.Hypothesis("LayerDistribution", UseExisting=0)
|
2012-08-09 16:03:55 +06:00
|
|
|
self.nbLayers = None
|
2012-10-08 17:56:59 +06:00
|
|
|
pass
|
|
|
|
pass
|
2012-08-09 16:03:55 +06:00
|
|
|
|
|
|
|
## Return 3D hypothesis holding the 1D one
|
|
|
|
def Get3DHypothesis(self):
|
|
|
|
if self.algoType != "RadialPrism_3D":
|
|
|
|
print "Prism_3D algorith doesn't support any hyposesis"
|
|
|
|
return None
|
|
|
|
return self.distribHyp
|
|
|
|
|
|
|
|
## Private method creating a 1D hypothesis and storing it in the LayerDistribution
|
|
|
|
# hypothesis. Returns the created hypothesis
|
|
|
|
def OwnHypothesis(self, hypType, args=[], so="libStdMeshersEngine.so"):
|
|
|
|
if self.algoType != "RadialPrism_3D":
|
|
|
|
print "Prism_3D algorith doesn't support any hyposesis"
|
|
|
|
return None
|
|
|
|
if not self.nbLayers is None:
|
|
|
|
self.mesh.GetMesh().RemoveHypothesis( self.geom, self.nbLayers )
|
|
|
|
self.mesh.GetMesh().AddHypothesis( self.geom, self.distribHyp )
|
|
|
|
study = self.mesh.smeshpyD.GetCurrentStudy() # prevents publishing own 1D hypothesis
|
|
|
|
self.mesh.smeshpyD.SetCurrentStudy( None )
|
|
|
|
hyp = self.mesh.smeshpyD.CreateHypothesis(hypType, so)
|
|
|
|
self.mesh.smeshpyD.SetCurrentStudy( study ) # enables publishing
|
2013-04-02 20:33:29 +06:00
|
|
|
if not self.distribHyp:
|
2013-04-01 19:05:47 +06:00
|
|
|
self.distribHyp = self.Hypothesis("LayerDistribution", UseExisting=0)
|
2012-08-09 16:03:55 +06:00
|
|
|
self.distribHyp.SetLayerDistribution( hyp )
|
|
|
|
return hyp
|
|
|
|
|
|
|
|
## Defines "NumberOfLayers" hypothesis, specifying the number of layers of
|
|
|
|
# prisms to build between the inner and outer shells
|
|
|
|
# @param n number of layers
|
|
|
|
# @param UseExisting if ==true - searches for the existing hypothesis created with
|
|
|
|
# the same parameters, else (default) - creates a new one
|
|
|
|
def NumberOfLayers(self, n, UseExisting=0):
|
|
|
|
if self.algoType != "RadialPrism_3D":
|
|
|
|
print "Prism_3D algorith doesn't support any hyposesis"
|
|
|
|
return None
|
|
|
|
self.mesh.RemoveHypothesis( self.distribHyp, self.geom )
|
2013-11-22 18:36:27 +06:00
|
|
|
from salome.smesh.smeshBuilder import IsEqual
|
2012-08-09 16:03:55 +06:00
|
|
|
compFun = lambda hyp, args: IsEqual(hyp.GetNumberOfLayers(), args[0])
|
|
|
|
self.nbLayers = self.Hypothesis("NumberOfLayers", [n], UseExisting=UseExisting,
|
|
|
|
CompareMethod=compFun)
|
|
|
|
self.nbLayers.SetNumberOfLayers( n )
|
|
|
|
return self.nbLayers
|
|
|
|
|
|
|
|
## Defines "LocalLength" hypothesis, specifying the segment length
|
|
|
|
# to build between the inner and the outer shells
|
|
|
|
# @param l the length of segments
|
|
|
|
# @param p the precision of rounding
|
|
|
|
def LocalLength(self, l, p=1e-07):
|
|
|
|
if self.algoType != "RadialPrism_3D":
|
|
|
|
print "Prism_3D algorith doesn't support any hyposesis"
|
|
|
|
return None
|
|
|
|
hyp = self.OwnHypothesis("LocalLength", [l,p])
|
|
|
|
hyp.SetLength(l)
|
|
|
|
hyp.SetPrecision(p)
|
|
|
|
return hyp
|
|
|
|
|
|
|
|
## Defines "NumberOfSegments" hypothesis, specifying the number of layers of
|
|
|
|
# prisms to build between the inner and the outer shells.
|
|
|
|
# @param n the number of layers
|
|
|
|
# @param s the scale factor (optional)
|
|
|
|
def NumberOfSegments(self, n, s=[]):
|
|
|
|
if self.algoType != "RadialPrism_3D":
|
|
|
|
print "Prism_3D algorith doesn't support any hyposesis"
|
|
|
|
return None
|
2015-02-17 18:23:19 +05:00
|
|
|
if not s:
|
2012-08-09 16:03:55 +06:00
|
|
|
hyp = self.OwnHypothesis("NumberOfSegments", [n])
|
|
|
|
else:
|
|
|
|
hyp = self.OwnHypothesis("NumberOfSegments", [n,s])
|
|
|
|
hyp.SetScaleFactor(s)
|
|
|
|
hyp.SetNumberOfSegments(n)
|
|
|
|
return hyp
|
|
|
|
|
|
|
|
## Defines "Arithmetic1D" hypothesis, specifying the distribution of segments
|
2014-01-15 15:41:17 +06:00
|
|
|
# to build between the inner and the outer shells with a length that changes
|
|
|
|
# in arithmetic progression
|
2012-08-09 16:03:55 +06:00
|
|
|
# @param start the length of the first segment
|
|
|
|
# @param end the length of the last segment
|
|
|
|
def Arithmetic1D(self, start, end ):
|
|
|
|
if self.algoType != "RadialPrism_3D":
|
|
|
|
print "Prism_3D algorith doesn't support any hyposesis"
|
|
|
|
return None
|
|
|
|
hyp = self.OwnHypothesis("Arithmetic1D", [start, end])
|
|
|
|
hyp.SetLength(start, 1)
|
|
|
|
hyp.SetLength(end , 0)
|
|
|
|
return hyp
|
|
|
|
|
2014-01-15 15:41:17 +06:00
|
|
|
## Defines "GeometricProgression" hypothesis, specifying the distribution of segments
|
|
|
|
# to build between the inner and the outer shells with a length that changes
|
|
|
|
# in Geometric progression
|
|
|
|
# @param start the length of the first segment
|
|
|
|
# @param ratio the common ratio of the geometric progression
|
|
|
|
def GeometricProgression(self, start, ratio ):
|
|
|
|
if self.algoType != "RadialPrism_3D":
|
|
|
|
print "Prism_3D algorith doesn't support any hyposesis"
|
|
|
|
return None
|
|
|
|
hyp = self.OwnHypothesis("GeometricProgression", [start, ratio])
|
|
|
|
hyp.SetStartLength( start )
|
|
|
|
hyp.SetCommonRatio( ratio )
|
|
|
|
return hyp
|
|
|
|
|
2012-08-09 16:03:55 +06:00
|
|
|
## Defines "StartEndLength" hypothesis, specifying distribution of segments
|
|
|
|
# to build between the inner and the outer shells as geometric length increasing
|
|
|
|
# @param start for the length of the first segment
|
|
|
|
# @param end for the length of the last segment
|
|
|
|
def StartEndLength(self, start, end):
|
|
|
|
if self.algoType != "RadialPrism_3D":
|
|
|
|
print "Prism_3D algorith doesn't support any hyposesis"
|
|
|
|
return None
|
|
|
|
hyp = self.OwnHypothesis("StartEndLength", [start, end])
|
|
|
|
hyp.SetLength(start, 1)
|
|
|
|
hyp.SetLength(end , 0)
|
|
|
|
return hyp
|
|
|
|
|
|
|
|
## Defines "AutomaticLength" hypothesis, specifying the number of segments
|
|
|
|
# to build between the inner and outer shells
|
|
|
|
# @param fineness defines the quality of the mesh within the range [0-1]
|
|
|
|
def AutomaticLength(self, fineness=0):
|
|
|
|
if self.algoType != "RadialPrism_3D":
|
|
|
|
print "Prism_3D algorith doesn't support any hyposesis"
|
|
|
|
return None
|
|
|
|
hyp = self.OwnHypothesis("AutomaticLength")
|
|
|
|
hyp.SetFineness( fineness )
|
|
|
|
return hyp
|
|
|
|
|
2013-04-04 13:08:19 +06:00
|
|
|
pass # end of StdMeshersBuilder_Prism3D class
|
2012-08-09 16:03:55 +06:00
|
|
|
|
2016-03-11 18:32:07 +05:00
|
|
|
## Defines Radial Prism 3D algorithm
|
2013-04-01 19:05:47 +06:00
|
|
|
#
|
2013-04-05 15:00:43 +06:00
|
|
|
# It is created by calling smeshBuilder.Mesh.Prism(geom=0)
|
2013-04-01 19:05:47 +06:00
|
|
|
#
|
|
|
|
# @ingroup l3_algos_3dextr
|
2013-04-04 13:08:19 +06:00
|
|
|
class StdMeshersBuilder_RadialPrism3D(StdMeshersBuilder_Prism3D):
|
2013-04-01 19:05:47 +06:00
|
|
|
|
2013-04-05 15:00:43 +06:00
|
|
|
## name of the dynamic method in smeshBuilder.Mesh class
|
2013-04-01 19:05:47 +06:00
|
|
|
# @internal
|
|
|
|
meshMethod = "Prism"
|
2013-04-05 15:00:43 +06:00
|
|
|
## type of algorithm used with helper function in smeshBuilder.Mesh class
|
2013-04-01 19:05:47 +06:00
|
|
|
# @internal
|
|
|
|
algoType = "RadialPrism_3D"
|
|
|
|
## doc string of the method
|
|
|
|
# @internal
|
2015-06-15 23:31:23 +05:00
|
|
|
docHelper = "Creates Raial Prism 3D algorithm for volumes"
|
2013-04-01 19:05:47 +06:00
|
|
|
|
|
|
|
## Private constructor.
|
|
|
|
# @param mesh parent mesh object algorithm is assigned to
|
|
|
|
# @param geom geometry (shape/sub-shape) algorithm is assigned to;
|
|
|
|
# if it is @c 0 (default), the algorithm is assigned to the main shape
|
|
|
|
def __init__(self, mesh, geom=0):
|
|
|
|
Mesh_Algorithm.__init__(self)
|
|
|
|
|
|
|
|
shape = geom
|
|
|
|
if not shape:
|
|
|
|
shape = mesh.geom
|
|
|
|
self.Create(mesh, geom, "RadialPrism_3D")
|
|
|
|
self.distribHyp = None
|
|
|
|
self.nbLayers = None
|
|
|
|
return
|
|
|
|
|
2015-10-09 19:47:17 +05:00
|
|
|
## Base class for algorithms supporting radial distribution hypotheses
|
2012-10-08 17:56:59 +06:00
|
|
|
#
|
2015-10-09 19:47:17 +05:00
|
|
|
class StdMeshersBuilder_RadialAlgorithm(Mesh_Algorithm):
|
2012-08-09 16:03:55 +06:00
|
|
|
|
2015-10-09 19:47:17 +05:00
|
|
|
def __init__(self):
|
2012-08-09 16:03:55 +06:00
|
|
|
Mesh_Algorithm.__init__(self)
|
|
|
|
|
|
|
|
self.distribHyp = None #self.Hypothesis("LayerDistribution2D", UseExisting=0)
|
|
|
|
self.nbLayers = None
|
2012-10-08 17:56:59 +06:00
|
|
|
pass
|
2012-08-09 16:03:55 +06:00
|
|
|
|
|
|
|
## Return 2D hypothesis holding the 1D one
|
|
|
|
def Get2DHypothesis(self):
|
|
|
|
if not self.distribHyp:
|
|
|
|
self.distribHyp = self.Hypothesis("LayerDistribution2D", UseExisting=0)
|
|
|
|
return self.distribHyp
|
|
|
|
|
|
|
|
## Private method creating a 1D hypothesis and storing it in the LayerDistribution
|
|
|
|
# hypothesis. Returns the created hypothesis
|
|
|
|
def OwnHypothesis(self, hypType, args=[], so="libStdMeshersEngine.so"):
|
|
|
|
if self.nbLayers:
|
|
|
|
self.mesh.GetMesh().RemoveHypothesis( self.geom, self.nbLayers )
|
|
|
|
if self.distribHyp is None:
|
|
|
|
self.distribHyp = self.Hypothesis("LayerDistribution2D", UseExisting=0)
|
|
|
|
else:
|
|
|
|
self.mesh.GetMesh().AddHypothesis( self.geom, self.distribHyp )
|
|
|
|
study = self.mesh.smeshpyD.GetCurrentStudy() # prevents publishing own 1D hypothesis
|
|
|
|
self.mesh.smeshpyD.SetCurrentStudy( None )
|
|
|
|
hyp = self.mesh.smeshpyD.CreateHypothesis(hypType, so)
|
|
|
|
self.mesh.smeshpyD.SetCurrentStudy( study ) # enables publishing
|
|
|
|
self.distribHyp.SetLayerDistribution( hyp )
|
|
|
|
return hyp
|
|
|
|
|
|
|
|
## Defines "NumberOfLayers" hypothesis, specifying the number of layers
|
|
|
|
# @param n number of layers
|
|
|
|
# @param UseExisting if ==true - searches for the existing hypothesis created with
|
|
|
|
# the same parameters, else (default) - creates a new one
|
|
|
|
def NumberOfLayers(self, n, UseExisting=0):
|
|
|
|
if self.distribHyp:
|
|
|
|
self.mesh.GetMesh().RemoveHypothesis( self.geom, self.distribHyp )
|
2013-11-22 18:36:27 +06:00
|
|
|
from salome.smesh.smeshBuilder import IsEqual
|
2012-08-09 16:03:55 +06:00
|
|
|
compFun = lambda hyp, args: IsEqual(hyp.GetNumberOfLayers(), args[0])
|
|
|
|
self.nbLayers = self.Hypothesis("NumberOfLayers2D", [n], UseExisting=UseExisting,
|
|
|
|
CompareMethod=compFun)
|
|
|
|
self.nbLayers.SetNumberOfLayers( n )
|
|
|
|
return self.nbLayers
|
|
|
|
|
|
|
|
## Defines "LocalLength" hypothesis, specifying the segment length
|
|
|
|
# @param l the length of segments
|
|
|
|
# @param p the precision of rounding
|
|
|
|
def LocalLength(self, l, p=1e-07):
|
|
|
|
hyp = self.OwnHypothesis("LocalLength", [l,p])
|
|
|
|
hyp.SetLength(l)
|
|
|
|
hyp.SetPrecision(p)
|
|
|
|
return hyp
|
|
|
|
|
|
|
|
## Defines "NumberOfSegments" hypothesis, specifying the number of layers
|
|
|
|
# @param n the number of layers
|
|
|
|
# @param s the scale factor (optional)
|
|
|
|
def NumberOfSegments(self, n, s=[]):
|
|
|
|
if s == []:
|
|
|
|
hyp = self.OwnHypothesis("NumberOfSegments", [n])
|
|
|
|
else:
|
|
|
|
hyp = self.OwnHypothesis("NumberOfSegments", [n,s])
|
|
|
|
hyp.SetDistrType( 1 )
|
|
|
|
hyp.SetScaleFactor(s)
|
|
|
|
hyp.SetNumberOfSegments(n)
|
|
|
|
return hyp
|
|
|
|
|
|
|
|
## Defines "Arithmetic1D" hypothesis, specifying the distribution of segments
|
|
|
|
# with a length that changes in arithmetic progression
|
|
|
|
# @param start the length of the first segment
|
|
|
|
# @param end the length of the last segment
|
|
|
|
def Arithmetic1D(self, start, end ):
|
|
|
|
hyp = self.OwnHypothesis("Arithmetic1D", [start, end])
|
|
|
|
hyp.SetLength(start, 1)
|
|
|
|
hyp.SetLength(end , 0)
|
|
|
|
return hyp
|
|
|
|
|
2014-01-15 15:41:17 +06:00
|
|
|
## Defines "GeometricProgression" hypothesis, specifying the distribution of segments
|
|
|
|
# with a length that changes in Geometric progression
|
|
|
|
# @param start the length of the first segment
|
|
|
|
# @param ratio the common ratio of the geometric progression
|
|
|
|
def GeometricProgression(self, start, ratio ):
|
|
|
|
hyp = self.OwnHypothesis("GeometricProgression", [start, ratio])
|
|
|
|
hyp.SetStartLength( start )
|
|
|
|
hyp.SetCommonRatio( ratio )
|
|
|
|
return hyp
|
|
|
|
|
2012-08-09 16:03:55 +06:00
|
|
|
## Defines "StartEndLength" hypothesis, specifying distribution of segments
|
|
|
|
# as geometric length increasing
|
|
|
|
# @param start for the length of the first segment
|
|
|
|
# @param end for the length of the last segment
|
|
|
|
def StartEndLength(self, start, end):
|
|
|
|
hyp = self.OwnHypothesis("StartEndLength", [start, end])
|
|
|
|
hyp.SetLength(start, 1)
|
|
|
|
hyp.SetLength(end , 0)
|
|
|
|
return hyp
|
|
|
|
|
|
|
|
## Defines "AutomaticLength" hypothesis, specifying the number of segments
|
|
|
|
# @param fineness defines the quality of the mesh within the range [0-1]
|
|
|
|
def AutomaticLength(self, fineness=0):
|
|
|
|
hyp = self.OwnHypothesis("AutomaticLength")
|
|
|
|
hyp.SetFineness( fineness )
|
|
|
|
return hyp
|
|
|
|
|
2013-04-04 13:08:19 +06:00
|
|
|
pass # end of StdMeshersBuilder_RadialQuadrangle1D2D class
|
2012-08-09 16:03:55 +06:00
|
|
|
|
2015-10-09 19:47:17 +05:00
|
|
|
## Defines a Radial Quadrangle 1D-2D algorithm
|
|
|
|
#
|
|
|
|
# It is created by calling smeshBuilder.Mesh.Quadrangle(smeshBuilder.RADIAL_QUAD,geom=0)
|
|
|
|
#
|
|
|
|
# @ingroup l2_algos_radialq
|
|
|
|
class StdMeshersBuilder_RadialQuadrangle1D2D(StdMeshersBuilder_RadialAlgorithm):
|
|
|
|
|
|
|
|
## name of the dynamic method in smeshBuilder.Mesh class
|
|
|
|
# @internal
|
|
|
|
meshMethod = "Quadrangle"
|
|
|
|
## type of algorithm used with helper function in smeshBuilder.Mesh class
|
|
|
|
# @internal
|
|
|
|
algoType = RADIAL_QUAD
|
|
|
|
## doc string of the method
|
|
|
|
# @internal
|
|
|
|
docHelper = "Creates quadrangle 1D-2D algorithm for faces having a shape of disk or a disk segment"
|
|
|
|
|
|
|
|
## Private constructor.
|
|
|
|
# @param mesh parent mesh object algorithm is assigned to
|
|
|
|
# @param geom geometry (shape/sub-shape) algorithm is assigned to;
|
|
|
|
# if it is @c 0 (default), the algorithm is assigned to the main shape
|
|
|
|
def __init__(self, mesh, geom=0):
|
|
|
|
StdMeshersBuilder_RadialAlgorithm.__init__(self)
|
|
|
|
self.Create(mesh, geom, self.algoType)
|
|
|
|
|
|
|
|
self.distribHyp = None #self.Hypothesis("LayerDistribution2D", UseExisting=0)
|
|
|
|
self.nbLayers = None
|
|
|
|
pass
|
|
|
|
|
|
|
|
|
2015-06-15 23:31:23 +05:00
|
|
|
## Defines a Quadrangle (Medial Axis Projection) 1D-2D algorithm
|
|
|
|
#
|
|
|
|
# It is created by calling smeshBuilder.Mesh.Quadrangle(smeshBuilder.QUAD_MA_PROJ,geom=0)
|
|
|
|
#
|
|
|
|
# @ingroup l2_algos_quad_ma
|
2015-10-09 19:47:17 +05:00
|
|
|
class StdMeshersBuilder_QuadMA_1D2D(StdMeshersBuilder_RadialAlgorithm):
|
2015-06-15 23:31:23 +05:00
|
|
|
|
|
|
|
## name of the dynamic method in smeshBuilder.Mesh class
|
|
|
|
# @internal
|
|
|
|
meshMethod = "Quadrangle"
|
|
|
|
## type of algorithm used with helper function in smeshBuilder.Mesh class
|
|
|
|
# @internal
|
|
|
|
algoType = QUAD_MA_PROJ
|
|
|
|
## doc string of the method
|
|
|
|
# @internal
|
|
|
|
docHelper = "Creates quadrangle 1D-2D algorithm for faces"
|
|
|
|
|
|
|
|
## Private constructor.
|
|
|
|
# @param mesh parent mesh object algorithm is assigned to
|
|
|
|
# @param geom geometry (shape/sub-shape) algorithm is assigned to;
|
|
|
|
# if it is @c 0 (default), the algorithm is assigned to the main shape
|
|
|
|
def __init__(self, mesh, geom=0):
|
2015-10-09 19:47:17 +05:00
|
|
|
StdMeshersBuilder_RadialAlgorithm.__init__(self)
|
2015-06-15 23:31:23 +05:00
|
|
|
self.Create(mesh, geom, self.algoType)
|
|
|
|
pass
|
|
|
|
|
|
|
|
pass
|
|
|
|
|
2015-06-30 17:14:46 +05:00
|
|
|
## Defines a Polygon Per Face 2D algorithm
|
|
|
|
#
|
|
|
|
# It is created by calling smeshBuilder.Mesh.Polygon(geom=0)
|
|
|
|
#
|
|
|
|
# @ingroup l2_algos_quad_ma
|
|
|
|
class StdMeshersBuilder_PolygonPerFace(Mesh_Algorithm):
|
|
|
|
|
|
|
|
## name of the dynamic method in smeshBuilder.Mesh class
|
|
|
|
# @internal
|
|
|
|
meshMethod = "Polygon"
|
|
|
|
## type of algorithm used with helper function in smeshBuilder.Mesh class
|
|
|
|
# @internal
|
|
|
|
algoType = POLYGON
|
|
|
|
## flag pointing whether this algorithm should be used by default in dynamic method
|
|
|
|
# of smeshBuilder.Mesh class
|
|
|
|
# @internal
|
|
|
|
isDefault = True
|
|
|
|
## doc string of the method
|
|
|
|
# @internal
|
|
|
|
docHelper = "Creates polygon 2D algorithm for faces"
|
|
|
|
|
|
|
|
## Private constructor.
|
|
|
|
# @param mesh parent mesh object algorithm is assigned to
|
|
|
|
# @param geom geometry (shape/sub-shape) algorithm is assigned to;
|
|
|
|
# if it is @c 0 (default), the algorithm is assigned to the main shape
|
|
|
|
def __init__(self, mesh, geom=0):
|
|
|
|
Mesh_Algorithm.__init__(self)
|
|
|
|
self.Create(mesh, geom, self.algoType)
|
|
|
|
pass
|
|
|
|
|
|
|
|
pass
|
2015-06-15 23:31:23 +05:00
|
|
|
|
2012-10-08 17:56:59 +06:00
|
|
|
## Defines a Use Existing Elements 1D algorithm
|
|
|
|
#
|
2013-04-05 15:00:43 +06:00
|
|
|
# It is created by calling smeshBuilder.Mesh.UseExisting1DElements(geom=0)
|
2012-08-09 16:03:55 +06:00
|
|
|
#
|
|
|
|
# @ingroup l3_algos_basic
|
2013-04-04 13:08:19 +06:00
|
|
|
class StdMeshersBuilder_UseExistingElements_1D(Mesh_Algorithm):
|
2012-08-09 16:03:55 +06:00
|
|
|
|
2013-04-05 15:00:43 +06:00
|
|
|
## name of the dynamic method in smeshBuilder.Mesh class
|
2012-10-08 17:56:59 +06:00
|
|
|
# @internal
|
2012-08-09 16:03:55 +06:00
|
|
|
meshMethod = "UseExisting1DElements"
|
2013-04-05 15:00:43 +06:00
|
|
|
## type of algorithm used with helper function in smeshBuilder.Mesh class
|
2012-10-08 17:56:59 +06:00
|
|
|
# @internal
|
2012-08-09 16:03:55 +06:00
|
|
|
algoType = "Import_1D"
|
2015-06-30 17:14:46 +05:00
|
|
|
## flag pointing whether this algorithm should be used by default in dynamic method
|
2013-04-05 15:00:43 +06:00
|
|
|
# of smeshBuilder.Mesh class
|
2012-10-08 17:56:59 +06:00
|
|
|
# @internal
|
2012-08-09 16:03:55 +06:00
|
|
|
isDefault = True
|
2012-10-08 17:56:59 +06:00
|
|
|
## doc string of the method
|
|
|
|
# @internal
|
|
|
|
docHelper = "Creates 1D algorithm for edges with reusing of existing mesh elements"
|
2012-08-09 16:03:55 +06:00
|
|
|
|
2012-10-08 17:56:59 +06:00
|
|
|
## Private constructor.
|
|
|
|
# @param mesh parent mesh object algorithm is assigned to
|
|
|
|
# @param geom geometry (shape/sub-shape) algorithm is assigned to;
|
|
|
|
# if it is @c 0 (default), the algorithm is assigned to the main shape
|
2012-08-09 16:03:55 +06:00
|
|
|
def __init__(self, mesh, geom=0):
|
|
|
|
Mesh_Algorithm.__init__(self)
|
|
|
|
self.Create(mesh, geom, self.algoType)
|
2012-10-08 17:56:59 +06:00
|
|
|
pass
|
2012-08-09 16:03:55 +06:00
|
|
|
|
|
|
|
## Defines "Source edges" hypothesis, specifying groups of edges to import
|
|
|
|
# @param groups list of groups of edges
|
|
|
|
# @param toCopyMesh if True, the whole mesh \a groups belong to is imported
|
|
|
|
# @param toCopyGroups if True, all groups of the mesh \a groups belong to are imported
|
|
|
|
# @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):
|
|
|
|
for group in groups:
|
2013-11-22 18:36:27 +06:00
|
|
|
from salome.smesh.smeshBuilder import AssureGeomPublished
|
2012-08-09 16:03:55 +06:00
|
|
|
AssureGeomPublished( self.mesh, group )
|
|
|
|
compFun = lambda hyp, args: ( hyp.GetSourceEdges() == args[0] and \
|
|
|
|
hyp.GetCopySourceMesh() == args[1], args[2] )
|
|
|
|
hyp = self.Hypothesis("ImportSource1D", [groups, toCopyMesh, toCopyGroups],
|
|
|
|
UseExisting=UseExisting, CompareMethod=compFun)
|
|
|
|
hyp.SetSourceEdges(groups)
|
|
|
|
hyp.SetCopySourceMesh(toCopyMesh, toCopyGroups)
|
|
|
|
return hyp
|
|
|
|
|
2013-04-04 13:08:19 +06:00
|
|
|
pass # end of StdMeshersBuilder_UseExistingElements_1D class
|
2012-10-08 17:56:59 +06:00
|
|
|
|
|
|
|
## Defines a Use Existing Elements 1D-2D algorithm
|
|
|
|
#
|
2013-04-05 15:00:43 +06:00
|
|
|
# It is created by calling smeshBuilder.Mesh.UseExisting2DElements(geom=0)
|
2012-08-09 16:03:55 +06:00
|
|
|
#
|
|
|
|
# @ingroup l3_algos_basic
|
2013-04-04 13:08:19 +06:00
|
|
|
class StdMeshersBuilder_UseExistingElements_1D2D(Mesh_Algorithm):
|
2012-08-09 16:03:55 +06:00
|
|
|
|
2013-04-05 15:00:43 +06:00
|
|
|
## name of the dynamic method in smeshBuilder.Mesh class
|
2012-10-08 17:56:59 +06:00
|
|
|
# @internal
|
2012-08-09 16:03:55 +06:00
|
|
|
meshMethod = "UseExisting2DElements"
|
2013-04-05 15:00:43 +06:00
|
|
|
## type of algorithm used with helper function in smeshBuilder.Mesh class
|
2012-10-08 17:56:59 +06:00
|
|
|
# @internal
|
2012-08-09 16:03:55 +06:00
|
|
|
algoType = "Import_1D2D"
|
2015-06-30 17:14:46 +05:00
|
|
|
## flag pointing whether this algorithm should be used by default in dynamic method
|
2013-04-05 15:00:43 +06:00
|
|
|
# of smeshBuilder.Mesh class
|
2012-10-08 17:56:59 +06:00
|
|
|
# @internal
|
2012-08-09 16:03:55 +06:00
|
|
|
isDefault = True
|
2012-10-08 17:56:59 +06:00
|
|
|
## doc string of the method
|
|
|
|
# @internal
|
2015-06-15 23:31:23 +05:00
|
|
|
docHelper = "Creates 1D-2D algorithm for faces with reusing of existing mesh elements"
|
2012-08-09 16:03:55 +06:00
|
|
|
|
2012-10-08 17:56:59 +06:00
|
|
|
## Private constructor.
|
|
|
|
# @param mesh parent mesh object algorithm is assigned to
|
|
|
|
# @param geom geometry (shape/sub-shape) algorithm is assigned to;
|
|
|
|
# if it is @c 0 (default), the algorithm is assigned to the main shape
|
2012-08-09 16:03:55 +06:00
|
|
|
def __init__(self, mesh, geom=0):
|
|
|
|
Mesh_Algorithm.__init__(self)
|
|
|
|
self.Create(mesh, geom, self.algoType)
|
2012-10-08 17:56:59 +06:00
|
|
|
pass
|
2012-08-09 16:03:55 +06:00
|
|
|
|
|
|
|
## Defines "Source faces" hypothesis, specifying groups of faces to import
|
|
|
|
# @param groups list of groups of faces
|
|
|
|
# @param toCopyMesh if True, the whole mesh \a groups belong to is imported
|
|
|
|
# @param toCopyGroups if True, all groups of the mesh \a groups belong to are imported
|
|
|
|
# @param UseExisting if ==true - searches for the existing hypothesis created with
|
|
|
|
# the same parameters, else (default) - creates a new one
|
|
|
|
def SourceFaces(self, groups, toCopyMesh=False, toCopyGroups=False, UseExisting=False):
|
2015-12-02 14:42:04 +05:00
|
|
|
import SMESH
|
2012-08-09 16:03:55 +06:00
|
|
|
compFun = lambda hyp, args: ( hyp.GetSourceFaces() == args[0] and \
|
|
|
|
hyp.GetCopySourceMesh() == args[1], args[2] )
|
|
|
|
hyp = self.Hypothesis("ImportSource2D", [groups, toCopyMesh, toCopyGroups],
|
2015-02-27 22:38:00 +05:00
|
|
|
UseExisting=UseExisting, CompareMethod=compFun, toAdd=False)
|
2015-12-01 16:32:09 +05:00
|
|
|
if groups and isinstance( groups, SMESH._objref_SMESH_GroupBase ):
|
|
|
|
groups = [groups]
|
2012-08-09 16:03:55 +06:00
|
|
|
hyp.SetSourceFaces(groups)
|
|
|
|
hyp.SetCopySourceMesh(toCopyMesh, toCopyGroups)
|
2015-02-27 22:38:00 +05:00
|
|
|
self.mesh.AddHypothesis(hyp, self.geom)
|
2012-08-09 16:03:55 +06:00
|
|
|
return hyp
|
|
|
|
|
2013-04-04 13:08:19 +06:00
|
|
|
pass # end of StdMeshersBuilder_UseExistingElements_1D2D class
|
2012-08-09 16:03:55 +06:00
|
|
|
|
|
|
|
## Defines a Body Fitting 3D algorithm
|
2012-10-08 17:56:59 +06:00
|
|
|
#
|
2013-04-05 15:00:43 +06:00
|
|
|
# It is created by calling smeshBuilder.Mesh.BodyFitted(geom=0)
|
2012-08-09 16:03:55 +06:00
|
|
|
#
|
|
|
|
# @ingroup l3_algos_basic
|
2013-04-04 13:08:19 +06:00
|
|
|
class StdMeshersBuilder_Cartesian_3D(Mesh_Algorithm):
|
2012-08-09 16:03:55 +06:00
|
|
|
|
2013-04-05 15:00:43 +06:00
|
|
|
## name of the dynamic method in smeshBuilder.Mesh class
|
2012-10-08 17:56:59 +06:00
|
|
|
# @internal
|
2012-08-09 16:03:55 +06:00
|
|
|
meshMethod = "BodyFitted"
|
2013-04-05 15:00:43 +06:00
|
|
|
## type of algorithm used with helper function in smeshBuilder.Mesh class
|
2012-10-08 17:56:59 +06:00
|
|
|
# @internal
|
2012-08-09 16:03:55 +06:00
|
|
|
algoType = "Cartesian_3D"
|
2015-06-30 17:14:46 +05:00
|
|
|
## flag pointing whether this algorithm should be used by default in dynamic method
|
2013-04-05 15:00:43 +06:00
|
|
|
# of smeshBuilder.Mesh class
|
2012-10-08 17:56:59 +06:00
|
|
|
# @internal
|
2012-08-09 16:03:55 +06:00
|
|
|
isDefault = True
|
2012-10-08 17:56:59 +06:00
|
|
|
## doc string of the method
|
|
|
|
# @internal
|
2015-06-15 23:31:23 +05:00
|
|
|
docHelper = "Creates Body Fitting 3D algorithm for volumes"
|
2012-08-09 16:03:55 +06:00
|
|
|
|
2012-10-08 17:56:59 +06:00
|
|
|
## Private constructor.
|
|
|
|
# @param mesh parent mesh object algorithm is assigned to
|
|
|
|
# @param geom geometry (shape/sub-shape) algorithm is assigned to;
|
|
|
|
# if it is @c 0 (default), the algorithm is assigned to the main shape
|
2012-08-09 16:03:55 +06:00
|
|
|
def __init__(self, mesh, geom=0):
|
|
|
|
self.Create(mesh, geom, self.algoType)
|
|
|
|
self.hyp = None
|
2012-10-08 17:56:59 +06:00
|
|
|
pass
|
2012-08-09 16:03:55 +06:00
|
|
|
|
|
|
|
## 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.
|
2014-02-14 18:09:40 +06:00
|
|
|
# @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.
|
2012-08-09 16:03:55 +06:00
|
|
|
# @param sizeThreshold (> 1.0) defines a minimal size of a polyhedron so that
|
2014-02-14 18:09:40 +06:00
|
|
|
# a polyhedron of size less than hexSize/sizeThreshold is not created.
|
|
|
|
# @param implEdges enables implementation of geometrical edges into the mesh.
|
|
|
|
def SetGrid(self, xGridDef, yGridDef, zGridDef, sizeThreshold=4.0, implEdges=False):
|
2012-08-09 16:03:55 +06:00
|
|
|
if not self.hyp:
|
|
|
|
compFun = lambda hyp, args: False
|
|
|
|
self.hyp = self.Hypothesis("CartesianParameters3D",
|
|
|
|
[xGridDef, yGridDef, zGridDef, sizeThreshold],
|
2014-02-14 18:09:40 +06:00
|
|
|
UseExisting=False, CompareMethod=compFun)
|
2012-08-09 16:03:55 +06:00
|
|
|
if not self.mesh.IsUsedHypothesis( self.hyp, self.geom ):
|
|
|
|
self.mesh.AddHypothesis( self.hyp, self.geom )
|
|
|
|
|
2014-02-04 19:02:26 +06:00
|
|
|
for axis, gridDef in enumerate( [xGridDef, yGridDef, zGridDef] ):
|
2012-08-09 16:03:55 +06:00
|
|
|
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 )
|
2014-02-14 18:09:40 +06:00
|
|
|
self.hyp.SetToAddEdges( implEdges )
|
2012-08-09 16:03:55 +06:00
|
|
|
return self.hyp
|
|
|
|
|
2014-02-04 19:02:26 +06:00
|
|
|
## Defines custom directions of axes of the grid
|
|
|
|
# @param xAxis either SMESH.DirStruct or a vector, or 3 vector components
|
|
|
|
# @param yAxis either SMESH.DirStruct or a vector, or 3 vector components
|
|
|
|
# @param zAxis either SMESH.DirStruct or a vector, or 3 vector components
|
|
|
|
def SetAxesDirs( self, xAxis, yAxis, zAxis ):
|
|
|
|
import GEOM
|
|
|
|
if hasattr( xAxis, "__getitem__" ):
|
|
|
|
xAxis = self.mesh.smeshpyD.MakeDirStruct( xAxis[0],xAxis[1],xAxis[2] )
|
|
|
|
elif isinstance( xAxis, GEOM._objref_GEOM_Object ):
|
|
|
|
xAxis = self.mesh.smeshpyD.GetDirStruct( xAxis )
|
|
|
|
if hasattr( yAxis, "__getitem__" ):
|
|
|
|
yAxis = self.mesh.smeshpyD.MakeDirStruct( yAxis[0],yAxis[1],yAxis[2] )
|
|
|
|
elif isinstance( yAxis, GEOM._objref_GEOM_Object ):
|
|
|
|
yAxis = self.mesh.smeshpyD.GetDirStruct( yAxis )
|
|
|
|
if hasattr( zAxis, "__getitem__" ):
|
|
|
|
zAxis = self.mesh.smeshpyD.MakeDirStruct( zAxis[0],zAxis[1],zAxis[2] )
|
|
|
|
elif isinstance( zAxis, GEOM._objref_GEOM_Object ):
|
|
|
|
zAxis = self.mesh.smeshpyD.GetDirStruct( zAxis )
|
|
|
|
if not self.hyp:
|
|
|
|
self.hyp = self.Hypothesis("CartesianParameters3D")
|
|
|
|
if not self.mesh.IsUsedHypothesis( self.hyp, self.geom ):
|
|
|
|
self.mesh.AddHypothesis( self.hyp, self.geom )
|
|
|
|
self.hyp.SetAxesDirs( xAxis, yAxis, zAxis )
|
|
|
|
return self.hyp
|
|
|
|
|
|
|
|
## Automatically defines directions of axes of the grid at which
|
|
|
|
# a number of generated hexahedra is maximal
|
|
|
|
# @param isOrthogonal defines whether the axes mush be orthogonal
|
|
|
|
def SetOptimalAxesDirs(self, isOrthogonal=True):
|
|
|
|
if not self.hyp:
|
|
|
|
self.hyp = self.Hypothesis("CartesianParameters3D")
|
|
|
|
if not self.mesh.IsUsedHypothesis( self.hyp, self.geom ):
|
|
|
|
self.mesh.AddHypothesis( self.hyp, self.geom )
|
|
|
|
x,y,z = self.hyp.ComputeOptimalAxesDirs( self.geom, isOrthogonal )
|
|
|
|
self.hyp.SetAxesDirs( x,y,z )
|
|
|
|
return self.hyp
|
|
|
|
|
|
|
|
## Sets/unsets a fixed point. The algorithm makes a plane of the grid pass
|
|
|
|
# through the fixed point in each direction at which the grid is defined
|
|
|
|
# by spacing
|
|
|
|
# @param p coordinates of the fixed point. Either SMESH.PointStruct or
|
2014-02-04 21:51:49 +06:00
|
|
|
# a vertex or 3 components of coordinates.
|
2014-02-04 19:02:26 +06:00
|
|
|
# @param toUnset defines whether the fixed point is defined or removed.
|
|
|
|
def SetFixedPoint( self, p, toUnset=False ):
|
2014-02-04 21:51:49 +06:00
|
|
|
import SMESH, GEOM
|
2014-02-04 19:02:26 +06:00
|
|
|
if toUnset:
|
|
|
|
if not self.hyp: return
|
|
|
|
p = SMESH.PointStruct(0,0,0)
|
2014-02-04 21:51:49 +06:00
|
|
|
elif hasattr( p, "__getitem__" ):
|
2014-02-04 19:02:26 +06:00
|
|
|
p = SMESH.PointStruct( p[0],p[1],p[2] )
|
2014-02-04 21:51:49 +06:00
|
|
|
elif isinstance( p, GEOM._objref_GEOM_Object ):
|
|
|
|
p = self.mesh.smeshpyD.GetPointStruct( p )
|
2014-02-04 19:02:26 +06:00
|
|
|
if not self.hyp:
|
|
|
|
self.hyp = self.Hypothesis("CartesianParameters3D")
|
|
|
|
if not self.mesh.IsUsedHypothesis( self.hyp, self.geom ):
|
|
|
|
self.mesh.AddHypothesis( self.hyp, self.geom )
|
|
|
|
self.hyp.SetFixedPoint( p, toUnset )
|
|
|
|
return self.hyp
|
|
|
|
|
|
|
|
|
2013-04-04 13:08:19 +06:00
|
|
|
pass # end of StdMeshersBuilder_Cartesian_3D class
|
2012-10-08 17:56:59 +06:00
|
|
|
|
2012-08-09 16:03:55 +06:00
|
|
|
## Defines a stub 1D algorithm, which enables "manual" creation of nodes and
|
|
|
|
# segments usable by 2D algoritms
|
2012-10-08 17:56:59 +06:00
|
|
|
#
|
2013-04-05 15:00:43 +06:00
|
|
|
# It is created by calling smeshBuilder.Mesh.UseExistingSegments(geom=0)
|
2012-08-09 16:03:55 +06:00
|
|
|
#
|
|
|
|
# @ingroup l3_algos_basic
|
2013-04-04 13:08:19 +06:00
|
|
|
class StdMeshersBuilder_UseExisting_1D(Mesh_Algorithm):
|
2012-08-09 16:03:55 +06:00
|
|
|
|
2013-04-05 15:00:43 +06:00
|
|
|
## name of the dynamic method in smeshBuilder.Mesh class
|
2012-10-08 17:56:59 +06:00
|
|
|
# @internal
|
2012-08-09 16:03:55 +06:00
|
|
|
meshMethod = "UseExistingSegments"
|
2013-04-05 15:00:43 +06:00
|
|
|
## type of algorithm used with helper function in smeshBuilder.Mesh class
|
2012-10-08 17:56:59 +06:00
|
|
|
# @internal
|
2012-08-09 16:03:55 +06:00
|
|
|
algoType = "UseExisting_1D"
|
2012-10-08 17:56:59 +06:00
|
|
|
## doc string of the method
|
|
|
|
# @internal
|
2015-06-15 23:31:23 +05:00
|
|
|
docHelper = "Creates 1D algorithm allowing batch meshing of edges"
|
2012-08-09 16:03:55 +06:00
|
|
|
|
2012-10-08 17:56:59 +06:00
|
|
|
## Private constructor.
|
|
|
|
# @param mesh parent mesh object algorithm is assigned to
|
|
|
|
# @param geom geometry (shape/sub-shape) algorithm is assigned to;
|
|
|
|
# if it is @c 0 (default), the algorithm is assigned to the main shape
|
2012-08-09 16:03:55 +06:00
|
|
|
def __init__(self, mesh, geom=0):
|
|
|
|
self.Create(mesh, geom, self.algoType)
|
2012-10-08 17:56:59 +06:00
|
|
|
pass
|
2012-08-09 16:03:55 +06:00
|
|
|
|
2013-04-04 13:08:19 +06:00
|
|
|
pass # end of StdMeshersBuilder_UseExisting_1D class
|
2012-08-09 16:03:55 +06:00
|
|
|
|
|
|
|
## Defines a stub 2D algorithm, which enables "manual" creation of nodes and
|
|
|
|
# faces usable by 3D algoritms
|
2012-10-08 17:56:59 +06:00
|
|
|
#
|
2013-04-05 15:00:43 +06:00
|
|
|
# It is created by calling smeshBuilder.Mesh.UseExistingFaces(geom=0)
|
2012-08-09 16:03:55 +06:00
|
|
|
#
|
|
|
|
# @ingroup l3_algos_basic
|
2013-04-04 13:08:19 +06:00
|
|
|
class StdMeshersBuilder_UseExisting_2D(Mesh_Algorithm):
|
2012-08-09 16:03:55 +06:00
|
|
|
|
2013-04-05 15:00:43 +06:00
|
|
|
## name of the dynamic method in smeshBuilder.Mesh class
|
2012-10-08 17:56:59 +06:00
|
|
|
# @internal
|
2012-08-09 16:03:55 +06:00
|
|
|
meshMethod = "UseExistingFaces"
|
2013-04-05 15:00:43 +06:00
|
|
|
## type of algorithm used with helper function in smeshBuilder.Mesh class
|
2012-10-08 17:56:59 +06:00
|
|
|
# @internal
|
2012-08-09 16:03:55 +06:00
|
|
|
algoType = "UseExisting_2D"
|
2012-10-08 17:56:59 +06:00
|
|
|
## doc string of the method
|
|
|
|
# @internal
|
2015-06-15 23:31:23 +05:00
|
|
|
docHelper = "Creates 2D algorithm allowing batch meshing of faces"
|
2012-08-09 16:03:55 +06:00
|
|
|
|
2012-10-08 17:56:59 +06:00
|
|
|
## Private constructor.
|
|
|
|
# @param mesh parent mesh object algorithm is assigned to
|
|
|
|
# @param geom geometry (shape/sub-shape) algorithm is assigned to;
|
|
|
|
# if it is @c 0 (default), the algorithm is assigned to the main shape
|
2012-08-09 16:03:55 +06:00
|
|
|
def __init__(self, mesh, geom=0):
|
|
|
|
self.Create(mesh, geom, self.algoType)
|
2012-10-08 17:56:59 +06:00
|
|
|
pass
|
|
|
|
|
2013-04-04 13:08:19 +06:00
|
|
|
pass # end of StdMeshersBuilder_UseExisting_2D class
|