### 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 nontrivial 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 Φ whose level set defines the surface of interest. Charts are subsequently generated as maps from the original user-specified triangles to R3. The degree of smoothness is controlled locally by the kernel to be commensurate with the fineness of the input triangulation. The expression for Φ 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 computer-aided design and meshing software.

Original language | English (US) |
---|---|

Pages (from-to) | A1380-A1401 |

Journal | SIAM Journal on Scientific Computing |

Volume | 42 |

Issue number | 2 |

DOIs | |

State | Published - Jan 1 2020 |

### Keywords

- Boundary integral
- Fast multipole method
- High-order surface discretization
- Level set
- Mesh generation

### ASJC Scopus subject areas

- Computational Mathematics
- Applied Mathematics

## Fingerprint Dive into the research topics of 'A fast boundary integral method for high-order multiscale mesh generation'. Together they form a unique fingerprint.

## Cite this

*SIAM Journal on Scientific Computing*,

*42*(2), A1380-A1401. https://doi.org/10.1137/19M1290450