This is the implementation of: [1]Arnold, Douglas N., Arup Mukherjee, and Luc Pouly "Locally adapted tetrahedral meshes using bisection." SIAM Journal on Scientific Computing 22.2 (2000): 431-448. and Parthasarathy, V. N., C. M. Graichen [2]Bartels, Sören, and Patrick Schreier. "Local coarsening of simplicial finite element meshes generated by bisections." BIT Numerical Mathematics 52.3 (2012): 559-569. [3]Stevenson, Rob. "The completion of locally refined simplicial partitions created by bisection." Mathematics of computation 77.261 (2008): 227-241. APA [4]Maubach, Joseph M. "Local bisection refinement for n-simplicial grids generated by reflection." SIAM Journal on Scientific Computing 16.1 (1995): 210-227. [5]A. F. Hathaway. "A comparison of tetrahedron quality measures." Finite Elements in Analysis and Design 15.3 (1994): 255-261. The adaptive mesh refinement algorithm[1] is in AMRMeshArnold.py file, and the adaptive mesh refinement algorithm[2][3][4] is in AMRMeshMaubach.py file. The mesh format is .top file, but the algorithm uses only the node list and element list. MeshQual.py read mesh file, plot several aspect ratios[2] to qualify the mesh. The test results of refining a cube [-1,1],[-1,1],[-1,1], at point (0.2,0.3,0.4) by 50 times is in cube_initial_qual.png, cube_ref50_qual.png and cube_ref50.png. The algorithm is efficient and the quality of the mesh is excellent! The aspect ratio is bounded!
Zhengyu-Huang/MeshQual
This is a python script to read a mesh file(.top file used in FRG), and visualize elements' qualities
Python