Fast approximate Barnes interpolation: illustrated by Python-Numba implementation fast-barnes-py v1.0

Abstract N W × H, resulting in a computational complexity of O (N ⋅ W ⋅ H). In the era of highly resolved grids and overwhelming numbers of sample points, which originate, e.g., from the Internet of Things or crowd-sourced data, this computation can be quite demanding, even on high-performance machines. O (N + W ⋅ H). Two use cases in particular are considered, namely (1) where the used grid is embedded in the Euclidean plane and (2) where the grid is located on the unit sphere.

Object Details

• Location: Deutsche Nationalbibliothek Frankfurt am Main
• Extent: Online-Ressource
• Language: Englisch

References and Relationships

• Bibliographic citation: Fast approximate Barnes interpolation: illustrated by Python-Numba implementation fast-barnes-py v1.0 ; volume:16 ; number:6 ; year:2023 ; pages:1697-1711 ; extent:15 ; Geoscientific model development ; 16, Heft 6 (2023), 1697-1711 (gesamt 15)

Contributors, Places and Time

• Creator: Zürcher, Bruno K.

Further information

• DOI: 10.5194/gmd-16-1697-2023
• URN: urn:nbn:de:101:1-2023033005203746086119
• Rights: Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
• Last update: 14.08.2025, 10:51 AM CEST