Higher-Order Accurate Meshing of Implicitly Defined Tangential and Transversal Intersection Curves
A higher-order accurate meshing algorithm for curves defined as intersection of two implicitly defined surfaces is proposed. Initially, the given bounding box is partitioned with an octree to give an approximate description of the topology. This description is used to serve as initial guess for finding corners and points on the intersection curves. Once a point on an intersection curve is found, the tangent vector of this curve is computed to facilitate the progressive tracing of the intersection curve. To increase accuracy in case of tangential intersection curves, additional terms are added to the root-finding procedure. As a final step, inner nodes of the higher-order Lagrangian elements are projected onto the curve. Special attention is paid to the accurate meshing of tangential intersection curves, which is the novelty of this contribution.
- 3.Burman, E., Hansbo, P., Larson, M.G., Massing, A.: Cut finite element methods for partial differential equations on embedded manifolds of arbitrary codimensions. ESAIM: Math. Model Numer. Anal. (2018). https://doi.org/10.1051/m2an/2018038
- 5.Dziuk, G.: Finite elements for the Beltrami operator on arbitrary surfaces. In: Hildebrandt, S., Leis, R. (eds.) Partial Differential Equations and Calculus of Variations, Lecture Notes in Mathematics, vol. 1357, pp. 142–155. Springer, Berlin (1988). https://doi.org/10.1007/BFb0082865 CrossRefGoogle Scholar
- 10.Patrikalakis, N.M.: Interrogation of surface intersections. In: Geometry Processing for Design and Manufacturing, pp. 161–185. Society for Industrial and Applied Mathematics, Philadelphia (1992). https://doi.org/10.1137/1.9781611971668.ch8
- 12.Shapiro, V.: Theory of R-functions and Applications. Tech. rep., Department of Computer Science, Cornell University, Ithaca (1991)Google Scholar