coerce_field ( field : Union ) → dict ¶ pandamesh.gmsh_mesher.I tried using gmsh to generate a custom mesh as explained here. ALL_QUADRANGLES = 1 ¶ BARYCENTRIC = 3 ¶ NONE = 0 ¶ pandamesh.gmsh_mesher. SubdivisionAlgorithm ( value ) ¶Īll meshes can be subdivided to generate fully quadrangular cells. AUTOMATIC = 2 ¶ BAMG = 7 ¶ FRONTAL_DELAUNAY = 5 ¶ FRONTAL_DELAUNAY_FOR_QUADS = 8 ¶ INITIAL_MESH_ONLY = 3 ¶ MESH_ADAPT = 1 ¶ PACKING_OF_PARALLELLOGRAMS = 9 ¶ class pandamesh.gmsh_mesher. The Automatic algorithm usesĭelaunay for plane surfaces and MeshAdapt for all other surfaces. When the Delaunay or Frontal-Delaunay algorithms fail, The fastest it usually also handles complex mesh size fields better than theįrontal-Delaunay. For very large meshes of plane surfaces the Delaunay algorithm is When high element quality is important, the Frontal-Delaunay algorithm shouldīe tried. Triangles suitable for recombination and BAMG allows to generateįor very complex curved surfaces the MeshAdapt algorithm is the most robust. The Frontal-Delaunay algorithm aiming at generating right-angle In particular, Frontal-Delaunay for Quads is a variant of Other experimental algorithms with specific features are alsoĪvailable. The Frontal-Delaunay algorithm is inspired by the work of S. Is then reconnected using an anisotropic Delaunay criterion. The element that has the largest adimensional circumradius. New points are inserted sequentially at the circumcenter of The Delaunay algorithm is inspired by the work of the GAMMA team at Technique makes use of edge swaps, splits, and collapses: long edgesĪre split, short edges are collapsed, and edges are swapped if aīetter geometrical configuration is obtained. The MeshAdapt algorithm is based on local mesh modifications. After this initial step several algorithms can be applied to The points of the 1D mesh is initially constructed using aĭivide-and-conquer algorithm. Path ( Union ¶Įach algorithm has its own advantages and disadvantages.įor all 2D unstructured algorithms a Delaunay mesh that contains all NONE = 0 ALL_QUADRANGLES = 1 BARYCENTRIC = 3 write ( path : Union ) ¶ Outside_value ( Union ) – Value outside of the window (xmin, xmax) and (ymin, ymax).Ĭlears all cell size fields from the mesher. ParametersĬellsize (FloatArray with shape (n_y, n_x)) – Specifies the cell size on a structured grid. The points to determine the desired cell size. Gdf ( geopandas.GeoDataFrame) – Location and cell size of the fields, as vector data.Īdd_structured_field ( cellsize : numpy.ndarray, xmin : float, ymin : float, dx : float, dy : float, outside_value : Optional = None ) → None ¶Īdd a structured field specifying cell sizes. The of geometry of these fields are not forced into the mesh, but theyĬan be used to specify zones of with cell sizes. add_distance_field ( gdf :, minimum_cellsize : float ) → None ¶ If such cases are detected, the initialization will error.Ī helpful index can be found near the bottom: Holes in polygons are fully supported, but they most not contain Linestrings and points should not “touch” / be located on Linestrings should not intersect each other.Įvery linestring should be fully contained by a single polygon Ī linestring may not intersect two or more polygons. Polygons should not have any overlap with each other. Gmsh cannot automatically resolve overlapping polygons, or points
Unlike Triangle, the cell size values associated Will be directly forced into the triangulation. Linestrings and points may also be included. These can be used to achieve local mesh remfinement. Optionally, multiple polygons with different cell sizes can be included in With a geopandas GeoDataFrame containing at least one polygon, and a column MAX = 'Max' ¶ MEAN = 'Mean' ¶ MIN = 'Min' ¶ class pandamesh.gmsh_mesher. FieldCombination ( value ) ¶Ĭontrols how cell size fields are combined when they are found at the
0 kommentar(er)
