A Fast Boundary Integral Method for High-Order Multiscale Mesh Generation

DOI10.1137/19M1290450zbMATH Open1471.65212arXiv1909.13356OpenAlexW3019463407MaRDI QIDQ5112554FDOQ5112554

Authors: Felipe Vico, Michael O'Neil, Manas Rachh, Leslie Greengard 

Publication date: 29 May 2020

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Abstract: In this work we present an algorithm to construct an infinitely differentiable smooth surface from an input consisting of a (rectilinear) triangulation of a surface of arbitrary shape. The original surface can have non-trivial genus and multiscale features, and our algorithm has computational complexity which is linear in the number of input triangles. We use a smoothing kernel to define a function $Phi$ whose level set defines the surface of interest. Charts are subsequently generated as maps from the original user-specified triangles to $mathbb{R}^3$. The degree of smoothness is controlled locally by the kernel to be commensurate with the fineness of the input triangulation. The expression for~$Phi$ can be transformed into a boundary integral, whose evaluation can be accelerated using a fast multipole method. We demonstrate the effectiveness and cost of the algorithm with polyhedral and quadratic skeleton surfaces obtained from CAD and meshing software.

Full work available at URL: https://arxiv.org/abs/1909.13356

Recommendations

• Meshing 3D domains bounded by piecewise smooth surfaces
• Geometric fairing of irregular meshes for free-form surface design
• scientific article; zbMATH DE number 1919431
• A new method for efficient generation of high quality triangular surface meshes.
• Sampling and meshing a surface with guaranteed topology and geometry

zbMATH Keywords

level setfast multipole methodboundary integralmesh generationhigh-order surface discretization

Mathematics Subject Classification ID

Computer-aided design (modeling of curves and surfaces) (65D17) Boundary element methods for boundary value problems involving PDEs (65N38) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)

Cites Work

• Gmsh: a 3-D finite element mesh generator with built-in pre- and post-processing facilities
• A fast algorithm for particle simulations
• Title not available (Why is that?)
• Isogeometric analysis. Toward integration of CAD and FEA
• Isogeometric analysis: CAD, finite elements, NURBS, exact geometry and mesh refinement
• Title not available (Why is that?)
• A fast, high-order algorithm for the solution of surface scattering problems: Basic implementation, tests, and applications
• Laplace's equation and the Dirichlet-Neumann map in multiply connected domains
• A fast adaptive multipole algorithm in three dimensions
• Corner singularities for elliptic problems: Integral equations, graded meshes, quadrature, and compressed inverse preconditioning
• A wideband fast multipole method for the Helmholtz equation in three dimensions
• High-order accurate methods for Nyström discretization of integral equations on smooth curves in the plane
• A fast multipole method for Maxwell equations stable at all frequencies
• The black-box fast multipole method
• Acoustic isogeometric boundary element analysis
• A fast direct solver for boundary integral equations in two dimensions
• Three-dimensional adaptive domain remeshing, implicit domain meshing, and applications to free and moving boundary problems
• A high-order 3D boundary integral equation solver for elliptic PDEs in smooth domains
• Introduction to hierarchical matrices with applications.
• Kernel functions in convolution surfaces: A comparative analysis
• Spectra of Multiplication Operators as a Numerical Tool
• On the differentiability of the solutions of linear elliptic differential equations
• A high-order accurate accelerated direct solver for acoustic scattering from surfaces
• The Fast Gauss Transform with Variable Scales
• A local target specific quadrature by expansion method for evaluation of layer potentials in 3D
• Second-kind integral equations for the Laplace-Beltrami problem on surfaces in three dimensions
• Fast algorithms for quadrature by expansion. I: Globally valid expansions
• Smoothed corners and scattered waves
• A fast algorithm with error bounds for quadrature by expansion
• An adaptive fast Gauss transform in two dimensions

Cited In (7)

• Accurate, high-order representation of complex three-dimensional surfaces via Fourier continuation analysis
• A high-order fast direct solver for surface PDEs
• Fast multipole methods for the evaluation of layer potentials with locally-corrected quadratures
• Debye source representations for type-I superconductors. I: The static type I case
• FMM-accelerated solvers for the Laplace-Beltrami problem on complex surfaces in three dimensions
• A fully discrete high-order fast multiscale Galerkin method for solving boundary integral equations in a domain with corners
• Automatic construction of boundary parametrizations for geometric multigrid solvers

Uses Software

• Gmsh
• ParaView
• GiD
• FreeCAD

This page was built for publication: A Fast Boundary Integral Method for High-Order Multiscale Mesh Generation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5112554)