Hierarchical Radial-Basis-Function Interpolation

Interpolate scattered spatial data by recursively partitioning it into overlapping local RBF systems and blending their solutions through a spatial tree.

Version

v2 · 2026-08-30 · History

Domain-specific #

2003

Origin domain

computer graphics

Subdomain

geometric modeling

Aliases

Adaptive hierarchical RBF interpolation

Core Idea

Hierarchical radial-basis-function interpolation is an adaptive scattered-data method that replaces one large global RBF system with a recursive collection of smaller, overlapping local systems. In the precise construction used here, the hierarchy is a balanced binary spatial tree and its evaluation rule is a bottom-up partition-of-unity blend.

Start with pairwise-distinct sites

\[ P=\{p_i\}_{i=1}^{N}\subset\Omega\subset\mathbb R^d \]

and scalar values \(h_i\). Recursively divide the spatial domain along a coordinate direction so that the child regions have nearly balanced point counts. Enlarge their interface enough to create overlap, and continue until each leaf contains no more than a chosen capacity \(T_{leaf}\). For every leaf \(\ell\), solve an RBF interpolant.

Scope of Application

The home habitat is large scattered spatial interpolation in computer graphics, terrain modeling, geometric modeling, and surface reconstruction. The method is most natural when a dense global RBF solve is undesirable, the data have useful spatial locality, and a continuous field must be queried at many off-sample positions.

Within that habitat it supports height-field reconstruction from terrain samples, implicit or parametric surface fitting, and related scientific or medical geometry in which local RBF patches can be organized spatially.

Clarity

A compact recognition test is: where are the interpolation constraints solved, and how do their functions become one answer? If all centers enter one coefficient solve, the method is global RBF interpolation. If local systems lie on an unstructured flat cover, it is generic RBF-PU. If level \(k+1\) fits the residual left by level \(k\), it is a multistep or multilevel correction method.

Manages Complexity

A dense direct factorization of one \(N\)-center RBF interpolation matrix has the familiar \(O(N^3)\) arithmetic and \(O(N^2)\) storage profile. If a balanced hierarchy has \(L\approx N/T_{leaf}\) leaves and local size is bounded by \(T_{leaf}\), independent leaf factorizations require

Abstract Reasoning

Reason about the method by separating local fidelity, interface compatibility, and hierarchical transport.

First, verify each leaf as an RBF interpolation problem: kernel assumptions, polynomial augmentation, non-singularity conditions, and sample residuals. Second, verify the interface: active weights must be nonnegative where required, have nonzero total weight, cover the transition region, and possess the smoothness claimed for the global field.

Knowledge Transfer

B — bounded domain transfer. The complete mechanism transfers reliably among neighboring scattered-geometry practices: terrain height fields, implicit surface reconstruction, scientific visualization, and geometric modeling. Across these cases the roles remain literal—spatial samples, radial kernels, overlapping bounded local systems, a region tree, and a blended field—even though dimensions, kernels, and the interpretation of a level set may change.

Relationships to Other Abstractions

Current abstraction Hierarchical Radial-Basis-Function Interpolation Domain-specific

Parents (2) — more general patterns this builds on

• Hierarchical Radial-Basis-Function Interpolation is part of Hierarchy Prime

  The method strictly instantiates Decomposition: one global dense interpolation problem is divided into bounded local systems and their results are recombined.

• Hierarchical Radial-Basis-Function Interpolation is a decomposition of Decomposition Prime

  The method strictly instantiates Decomposition: one global dense interpolation problem is divided into bounded local systems and their results are recombined.

Hierarchy paths (5) — routes to 5 parentless roots

• Hierarchical Radial-Basis-Function Interpolation → Hierarchy → Network → Reservoir-Flux Network → Conservation Laws → Invariance

Show alternative paths (4)

Neighborhood in Abstraction Space

Hierarchical Radial-Basis-Function Interpolation sits in a sparse region of the domain-specific corpus (78^th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (1565 abstractions)

Nearest neighbors

• Leaf Area Index — 0.86
• Species–Area Relationship — 0.83
• Space-Filling Curve — 0.82
• Correlation Dimension — 0.82
• Habitat Fragmentation — 0.81

Computed from structural-signature embeddings · 2026-09-08