I want to be able to:
- Give point coordinates and as a result get the finite element (or at least its index).
- Give mesh vertice and as result get list of element indexes, containing this vertice
- Give the final element index as return the list of vertices.
So ultimately I am looking for something like
whoInElement function but not only for the boundary elements as done in the example:
120 int NbBoundaryElements = Th.nbe; 121 for (int k = 0; k < NbBoundaryElements; k++) 122 cout << k << " : " << Th.be(k) << " " << Th.be(k) 123 << " , label " << Th.be(k).label 124 << ", triangle " << int(Th.be(k).Element) 125 << " " << Th.be(k).whoinElement << endl;
Assume a simple square mesh. For each computational point, I must be able to determine the corresponding finite element and vice-versa, for each element I must be able to know which points are within or at least the mesh vertices.