Higher-Order Accurate Meshing of Implicitly Defined Tangential and Transversal Intersection Curves

  • Jakob W. StanfordEmail author
  • Thomas-Peter Fries
Conference paper
Part of the Lecture Notes in Computational Science and Engineering book series (LNCSE, volume 131)


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.


  1. 1.
    Barzilai, J., Borwein, J.M.: Two-point step size gradient methods. IMA J. Numer. Anal. 8(1), 141–148 (1988). MathSciNetCrossRefGoogle Scholar
  2. 2.
    Boyd, J.P.: Computing the zeros, maxima and inflection points of Chebyshev, Legendre and Fourier series: solving transcendental equations by spectral interpolation and polynomial rootfinding. J. Engrg. Mech. 56(3), 203–219 (2006). zbMATHGoogle Scholar
  3. 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).
  4. 4.
    Düldül, B.U., Düldül, M.: Can we find Willmore-like method for the tangential intersection problems? J. Comput. Appl. Math. 302, 301–311 (2016). MathSciNetCrossRefGoogle Scholar
  5. 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). CrossRefGoogle Scholar
  6. 6.
    Fries, T.P., Omerović, S., Schöllhammer, D., Steidl, J.: Higher-order meshing of implicit geometries–part I: Integration and interpolation in cut elements. Comp. Methods Appl. Mech. Engrg. 313, 759–784 (2017). MathSciNetCrossRefGoogle Scholar
  7. 7.
    Lorensen, W.E., Cline, H.E.: Marching cubes: a high resolution 3d surface construction algorithm. ACM SIGGRAPH Comput. Graph. 21(4), 163–169 (1987). CrossRefGoogle Scholar
  8. 8.
    Noble, D.R., Newren, E.P., Lechman, J.B.: A conformal decomposition finite element method for modeling stationary fluid interface problems. Int. J. Numer. Methods Fluids 63(6), 725–742 (2010). zbMATHGoogle Scholar
  9. 9.
    Ohtake, Y., Belyaev, A., Pasko, A.: Dynamic mesh optimization for polygonized implicit surfaces with sharp features. Vis. Comput. 19(2), 115–126 (2003)zbMATHGoogle Scholar
  10. 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).
  11. 11.
    Patrikalakis, N.: Surface-to-surface intersections. IEEE Comput. Graph. Appl. 13(1), 89–95 (1993). CrossRefGoogle Scholar
  12. 12.
    Shapiro, V.: Theory of R-functions and Applications. Tech. rep., Department of Computer Science, Cornell University, Ithaca (1991)Google Scholar
  13. 13.
    Soliman, M.A.L., Abdel-All, N.H., Hassan, S.A., Badr, S.A.N.: Intersection curves of implicit and parametric surfaces in R3. Appl. Math. 02(08), 1019–1026 (2011). CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Institute of Structural Analysis, Graz University of TechnologyGrazAustria

Personalised recommendations