One way to do this would be to loop over all elements, check if they are on a boundary ( neighbor NULL ), and then loop over all nodes that belong to that elem.
You can then ask each node, which side it belongs to and therefore the kind of boundary condition it has. For the example you are refering to, all nodes have Dirichlet conditions. Thanks. On Sep 1, 2016 7:11 AM, "Alena Vasatova" <[email protected]> wrote: > Hi, > > I'm using libMesh by extending introduction example 4 (Solving a 2D or > 3D Poisson Problem in Parallel), is there any easy way how to get nodes > with Dirichlet boundary condition for each submesh? I thought I can use > bnd_nodes_begin/end or bid_nodes_begin/end function, but I found out I > can't because Dirichlet condition is stored as "Side Boundary > condition". > > Thank you > > Alena > > > ------------------------------------------------------------ > ------------------ > _______________________________________________ > Libmesh-users mailing list > [email protected] > https://lists.sourceforge.net/lists/listinfo/libmesh-users > ------------------------------------------------------------------------------ _______________________________________________ Libmesh-users mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/libmesh-users
