451 LOG_SCOPE(
"all_tri()",
"MeshTools::Modification");
465 std::vector<std::unique_ptr<Elem>> new_elements;
467 unsigned int max_subelems = 1;
476 for (
const Elem * elem :
mesh.element_ptr_range())
479 max_subelems = std::max(max_subelems, poly->n_subtriangles());
481 max_subelems = std::max(max_subelems, polyhedron->n_subelements());
485 new_elements.reserve (max_subelems*n_orig_elem);
495 std::vector<Elem *> new_bndry_elements;
496 std::vector<unsigned short int> new_bndry_sides;
497 std::vector<boundary_id_type> new_bndry_ids;
502 bool added_new_ghost_point =
false;
517#ifdef LIBMESH_ENABLE_UNIQUE_ID
522 std::unique_ptr<const Elem> elem_side, subside_elem;
524 for (
auto & elem :
mesh.element_ptr_range())
530 libmesh_not_implemented_msg(
"Cannot convert a refined element into simplices\n");
534 std::vector<std::unique_ptr<Elem>> subelem(max_subelems);
536 auto set_nodes = [&elem, &subelem]
537 (
const std::initializer_list<std::initializer_list<int>> & node_ids) {
539 for (
auto row : node_ids)
542 Elem * sub = subelem[i++].get();
544 for (
auto node_id : row)
559 if ((elem->
point(0) - elem->
point(2)).norm() <
561 set_nodes({{0,1,2},{0,2,3}});
563 set_nodes({{0,1,3},{1,2,3}});
571 added_new_ghost_point =
true;
585 if ((elem->
point(0) - elem->
point(2)).norm() <
588 set_nodes({{0,1,2,4,5},{0,2,3,3,6,7}});
589 subelem[0]->set_node(5, new_node);
590 subelem[1]->set_node(3, new_node);
594 set_nodes({{3,0,1,7,4},{1,2,3,5,6}});
595 subelem[0]->set_node(5, new_node);
596 subelem[1]->set_node(5, new_node);
608 if ((elem->
point(0) - elem->
point(2)).norm() <
610 set_nodes({{0,1,2,4,5,8},{0,2,3,8,6,7}});
612 set_nodes({{0,1,3,4,8,7},{1,2,3,5,6,8}});
635 const unsigned int highest_n = highest_vertex_on(elem);
639 static const std::array<unsigned int, 8> opposing_node =
640 {6, 7, 4, 5, 2, 3, 0, 1};
642 static const std::vector<std::vector<unsigned int>> sides_opposing_highest =
643 {{2,3,5},{3,4,5},{1,4,5},{1,2,5},{0,2,3},{0,3,4},{0,1,4},{0,1,2}};
644 static const std::vector<std::vector<unsigned int>> nodes_neighboring_highest =
645 {{1,3,4},{0,2,5},{1,3,6},{0,2,7},{0,5,7},{1,4,6},{2,5,7},{3,4,6}};
656 unsigned int next_subelem = 0;
657 for (
auto side : sides_opposing_highest[highest_n])
659 const std::vector<unsigned int> nodes_on_side =
662 auto [dn, dn2] = split_diagonal(elem, nodes_on_side);
664 unsigned int split_on_neighbor =
false;
665 for (
auto n : nodes_neighboring_highest[highest_n])
666 if (dn == n || dn2 == n)
668 split_on_neighbor =
true;
676 if (split_on_neighbor)
678 subelem[next_subelem]->set_node(0, elem->
node_ptr(highest_n));
679 subelem[next_subelem]->set_node(1, elem->
node_ptr(dn));
680 subelem[next_subelem]->set_node(2, elem->
node_ptr(dn2));
681 for (
auto n : nodes_on_side)
682 if (n != dn && n != dn2)
684 subelem[next_subelem]->set_node(3, elem->
node_ptr(n));
687 subelem[next_subelem]->orient(&boundary_info);
690 subelem[next_subelem]->set_node(0, elem->
node_ptr(highest_n));
691 subelem[next_subelem]->set_node(1, elem->
node_ptr(dn));
692 subelem[next_subelem]->set_node(2, elem->
node_ptr(dn2));
693 for (
auto n : reverse(nodes_on_side))
694 if (n != dn && n != dn2)
696 subelem[next_subelem]->set_node(3, elem->
node_ptr(n));
699 subelem[next_subelem]->orient(&boundary_info);
704 subelem[next_subelem]->set_node(0, elem->
node_ptr(highest_n));
705 subelem[next_subelem]->set_node(1, elem->
node_ptr(dn));
706 subelem[next_subelem]->set_node(2, elem->
node_ptr(dn2));
707 for (
auto n : nodes_on_side)
708 for (
auto n2 : nodes_neighboring_highest[highest_n])
711 subelem[next_subelem]->set_node(3, elem->
node_ptr(n));
712 goto break_both_loops;
716 subelem[next_subelem]->orient(&boundary_info);
729 if (next_subelem == 3)
731 subelem[next_subelem]->set_node(0, elem->
node_ptr(opposing_nodes[highest_n][0]));
732 subelem[next_subelem]->set_node(1, elem->
node_ptr(opposing_nodes[highest_n][1]));
733 subelem[next_subelem]->set_node(2, elem->
node_ptr(opposing_nodes[highest_n][2]));
734 subelem[next_subelem]->set_node(3, elem->
node_ptr(opposing_node[highest_n]));
735 subelem[next_subelem]->orient(&boundary_info);
738 subelem[next_subelem]->set_node(0, elem->
node_ptr(opposing_nodes[highest_n][0]));
739 subelem[next_subelem]->set_node(1, elem->
node_ptr(opposing_nodes[highest_n][1]));
740 subelem[next_subelem]->set_node(2, elem->
node_ptr(opposing_nodes[highest_n][2]));
741 subelem[next_subelem]->set_node(3, elem->
node_ptr(highest_n));
742 subelem[next_subelem]->orient(&boundary_info);
746 subelem[next_subelem].reset();
753 if (next_subelem == 4 ||
756 for (
auto side : sides_opposing_highest[highest_n])
758 const std::vector<unsigned int> nodes_on_side =
761 auto [dn, dn2] = split_diagonal(elem, nodes_on_side);
763 unsigned int split_on_neighbor =
false;
764 for (
auto n : nodes_neighboring_highest[highest_n])
765 if (dn == n || dn2 == n)
767 split_on_neighbor =
true;
773 if (!split_on_neighbor)
775 subelem[next_subelem]->set_node(0, elem->
node_ptr(highest_n));
776 subelem[next_subelem]->set_node(1, elem->
node_ptr(dn));
777 subelem[next_subelem]->set_node(2, elem->
node_ptr(dn2));
778 subelem[next_subelem]->set_node(3, elem->
node_ptr(opposing_node[highest_n]));
779 subelem[next_subelem]->orient(&boundary_info);
817 if (split_first_diagonal(elem, 0,4, 1,3))
820 if (split_first_diagonal(elem, 0,5, 2,3))
823 if (split_first_diagonal(elem, 1,5, 2,4))
824 set_nodes({{0,4,5,3},{0,4,1,5},{0,1,2,5}});
828 set_nodes({{0,4,5,3},{0,4,2,5},{0,1,2,4}});
838 set_nodes({{0,4,2,3},{3,4,2,5},{0,1,2,4}});
846 if (split_first_diagonal(elem, 0,5, 2,3))
851 set_nodes({{1,3,4,5},{1,0,3,5},{0,1,2,5}});
858 if (split_first_diagonal(elem, 1,5, 2,4))
859 set_nodes({{0,1,2,3},{3,1,2,5},{1,3,4,5}});
863 set_nodes({{0,1,2,3},{2,3,4,5},{3,1,2,4}});
873 libmesh_experimental();
874 libmesh_fallthrough();
882 if (split_first_diagonal(elem, 0,4, 1,3))
885 if (split_first_diagonal(elem, 0,5, 2,3))
888 if (split_first_diagonal(elem, 1,5, 2,4))
889 set_nodes({{0,4,5,3,15,13,17,9,12,14},
890 {0,4,1,5,15,10,6,17,13,16},
891 {0,1,2,5,6,7,8,17,16,11}});
896 set_nodes({{0,4,5,3,15,13,17,9,12,14},
897 {0,4,2,5,15,16,8,17,13,11},
898 {0,1,2,4,6,7,8,15,10,16}});
908 set_nodes({{0,4,2,3,15,16,8,9,12,17},
909 {3,4,2,5,12,16,17,14,13,11},
910 {0,1,2,4,6,7,8,15,10,16}});
918 if (split_first_diagonal(elem, 0,5, 2,3))
923 set_nodes({{1,3,4,5,15,12,10,16,14,13},
924 {1,0,3,5,6,9,15,16,17,14},
925 {0,1,2,5,6,7,8,17,16,11}});
932 if (split_first_diagonal(elem, 1,5, 2,4))
933 set_nodes({{0,1,2,3,6,7,8,9,15,17},
934 {3,1,2,5,15,7,17,14,16,11},
935 {1,3,4,5,15,12,10,16,14,13}});
940 set_nodes({{0,1,2,3,6,7,8,9,15,17},
941 {2,3,4,5,17,12,16,11,14,13},
942 {3,1,2,4,15,7,17,12,10,16}});
961 if (split_first_diagonal(elem, 0,2, 1,3))
962 set_nodes({{0,1,2,4},{0,2,3,4}});
967 set_nodes({{0,1,3,4},{1,2,3,4}});
984 if (split_first_diagonal(elem, 0,2, 1,3))
985 set_nodes({{0,1,2,4,5,6,13,9,10,11},
986 {0,2,3,4,13,7,8,9,11,12}});
991 set_nodes({{0,1,3,4,5,13,8,9,10,12},
992 {1,2,3,4,6,7,13,10,11,12}});
1005 const C0Polygon * polygon = cast_ptr<const C0Polygon *>(elem);
1007 for (
unsigned int t = 0; t != n_subtri; ++t)
1009 const std::array<int, 3> tri = polygon->
subtriangle(t);
1010 if (tri[0] < 0 || tri[1] < 0 || tri[2] < 0)
1011 libmesh_not_implemented_msg
1012 (
"Cannot convert a C0Polygon whose triangulation\n"
1013 "introduces special (non-vertex) points");
1015 subelem[t]->set_node(0, elem->
node_ptr(tri[0]));
1016 subelem[t]->set_node(1, elem->
node_ptr(tri[1]));
1017 subelem[t]->set_node(2, elem->
node_ptr(tri[2]));
1031 cast_ptr<const C0Polyhedron *>(elem);
1033 for (
unsigned int t = 0; t != n_sub; ++t)
1035 const std::array<int, 4> tet = polyhedron->
subelement(t);
1036 if (tet[0] < 0 || tet[1] < 0 || tet[2] < 0 || tet[3] < 0)
1037 libmesh_not_implemented_msg
1038 (
"Cannot convert a C0Polyhedron whose triangulation\n"
1039 "introduces special (non-vertex) points");
1041 subelem[t]->set_node(0, elem->
node_ptr(tet[0]));
1042 subelem[t]->set_node(1, elem->
node_ptr(tet[1]));
1043 subelem[t]->set_node(2, elem->
node_ptr(tet[2]));
1044 subelem[t]->set_node(3, elem->
node_ptr(tet[3]));
1078 libmesh_not_implemented_msg
1079 (
"Error, encountered unimplemented element "
1080 << Utility::enum_to_string<ElemType>(etype)
1081 <<
" in MeshTools::Modification::all_tri()...");
1086 for (
unsigned int i=0; i != max_subelems; ++i)
1094 subelem[i]->add_extra_integers(nei);
1095 for (
unsigned int ei=0; ei != nei; ++ei)
1111 if (mesh_has_boundary_data || !mesh_is_serial)
1114 std::vector<boundary_id_type> bc_ids;
1125 std::vector<dof_id_type> elem_side_nodes(elem_side->n_nodes());
1126 for (
unsigned int esn=0,
1127 n_esn = cast_int<unsigned int>(elem_side_nodes.size());
1128 esn != n_esn; ++esn)
1129 elem_side_nodes[esn] = elem_side->node_id(esn);
1130 std::sort(elem_side_nodes.begin(), elem_side_nodes.end());
1132 for (
unsigned int i=0; i != max_subelems; ++i)
1135 for (
auto subside : subelem[i]->side_index_range())
1137 subelem[i]->build_side_ptr(subside_elem, subside);
1145 std::vector<dof_id_type> subside_nodes(subside_elem->n_vertices());
1146 for (
unsigned int ssn=0,
1147 n_ssn = cast_int<unsigned int>(subside_nodes.size());
1148 ssn != n_ssn; ++ssn)
1149 subside_nodes[ssn] = subside_elem->node_id(ssn);
1150 std::sort(subside_nodes.begin(), subside_nodes.end());
1154 if (std::includes(elem_side_nodes.begin(), elem_side_nodes.end(),
1155 subside_nodes.begin(), subside_nodes.end()))
1157 for (
const auto & b_id : bc_ids)
1160 new_bndry_ids.push_back(b_id);
1161 new_bndry_elements.push_back(subelem[i].get());
1162 new_bndry_sides.push_back(subside);
1183 for (
unsigned int i=0; i != max_subelems; ++i)
1190 subelem[i]->set_id( max_orig_id + max_subelems*elem->
id() + i );
1192#ifdef LIBMESH_ENABLE_UNIQUE_ID
1193 subelem[i]->set_unique_id(max_unique_id + max_subelems*elem->
unique_id() + i);
1197 new_elements.push_back(std::move(subelem[i]));
1208 for (
auto & elem : new_elements)
1211 if (mesh_has_boundary_data)
1224 bool nbe_nonempty = new_bndry_elements.size();
1232 libmesh_assert_equal_to (new_bndry_elements.size(), new_bndry_sides.size());
1233 libmesh_assert_equal_to (new_bndry_sides.size(), new_bndry_ids.size());
1250 if (added_new_ghost_point)