I have a simple square mesh, and a curve (discretised by another mesh) inside it. Here a picture worths thousand words. What I want to achieve is to find, for every cell $K$ of the circular (discretised) grid, I want to get the intersection points with the cells T of other grid. Here they are marked with a red dot.
What is the correct algorithmic to follow? Of course, if two consecutive support points for the circular grid are in different cells, then I can compute the intersection, but in general it may be that a cell $T$ is cut and no support points of the other mesh are in there, see again the picture above.
I started with FEnics, but I think in this case deal.II is the way to go. So, any explanation in the deal.II "lingo" is more than welcome.