One question in the context of immersed boundary or fictitious domain methods is how to compute discontinuous integrands in cut elements accurately. A frequently used method is to apply a composed Gaussian quadrature based on a spacetree subdivision. Although this approach works robustly on any geometry, the resulting integration mesh yields a low order representation of the boundary. If high order shape functions are employed to approximate the solution, this lack of geometric approximation power prevents exponential convergence in the asymptotic range. In this paper we present an algorithmic subdivision approach that aims to be as robust as the spacetree decomposition even for close-to-degenerate cases—but remains geometrically accurate at the same time. Based on 2D numerical examples, we will show that optimal convergence rates can be obtained with a nearly optimal number of integration points.     «

One question in the context of immersed boundary or fictitious domain methods is how to compute discontinuous integrands in cut elements accurately. A frequently used method is to apply a composed Gaussian quadrature based on a spacetree subdivision. Although this approach works robustly on any geometry, the resulting integration mesh yields a low order representation of the boundary. If high order shape functions are employed to approximate the solution, this lack of geometric approximation pow...     »