Efficient computation of partition of unity interpolants through a block-based searching technique

From MaRDI portal
Publication:2007296

DOI10.1016/J.CAMWA.2016.04.021zbMATH Open1443.65009arXiv1604.04585OpenAlexW2336396212MaRDI QIDQ2007296FDOQ2007296

Roberto Cavoretto, Alessandra De Rossi, Emma Perracchione

Publication date: 12 October 2020

Published in: Computers & Mathematics with Applications (Search for Journal in Brave)

Abstract: In this paper we propose a new efficient interpolation tool, extremely suitable for large scattered data sets. The partition of unity method is used and performed by blending Radial Basis Functions (RBFs) as local approximants and using locally supported weight functions. In particular we present a new space-partitioning data structure based on a partition of the underlying generic domain in blocks. This approach allows us to examine only a reduced number of blocks in the search process of the nearest neighbour points, leading to an optimized searching routine. Complexity analysis and numerical experiments in two- and three-dimensional interpolation support our findings. Some applications to geometric modelling are also considered. Moreover, the associated software package written in extsc{Matlab} is here discussed and made available to the scientific community.


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




Recommendations




Cites Work


Cited In (36)

Uses Software





This page was built for publication: Efficient computation of partition of unity interpolants through a block-based searching technique

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