On Tue, Jul 28, 2015 at 8:48 AM, Junchao Zhang <junchao.zh...@gmail.com> wrote:
> Yes, I saw algorithms in mesh_refinement_smoothing.C. It looks these > algorithms will flag some unflagged elements by limiting mismatches. But I > feel it is not enough. For example, in 2D, if only one neighbor of a > triangle is refined, a point will be added on the shared edge. I think the > triangle itself should be refined into two children, instead of four. > You're talking about a different refinement pattern, i.e. longest edge bisection, which is not implemented in libmesh. > However, I find Elem::refine() always generates n_children(), which is > four in this case. How and where does libmesh handle this case? Triangles are always refined into four elements and introduces hanging nodes when necessary, see for example the images here: http://mooseframework.org/wiki/MooseTraining/Adaptivity/ -- John ------------------------------------------------------------------------------ _______________________________________________ Libmesh-users mailing list Libmesh-users@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/libmesh-users
