This section analyzes the effects of grid-to-mesh connectivity, node density, and mesh topology on forecast accuracy and artifact formation. Unless otherwise stated, all models were trained under identical optimization settings and evaluated over the same temporal horizons: lead times spanning from 1 to 15 days, with global and per-tile of spatial gradients as primary metrics. Spatial diagnostics include error maps and automatic artifact detection based on the geometry of grid-to-mesh associations.
4.1. Influence of Grid-to-Mesh Connectivity
Table 4 summarizes mesh performance across all connectivity settings. B-mesh and F-mesh achieved the lowest
(0.24 at
and
), which improved the results of the structured meshes by nearly 30%. Its refinement according to seabed morphology concentrates resolution in coastal and high-gradient regions. However, the performance of the B-mesh is more sensitive to connection count, with a greater variability than any other mesh, as shown in
Table 5 with
, which indicates a strong dependency on tuning.
F-mesh, on the other hand, delivered the most consistent performance across connection counts. Its best result, with an of and connections, is nearly as good as B-mesh, but with less variance. Therefore, F-mesh offers a strong compromise between accuracy and robustness. Structured meshes (U-mesh and UC-mesh) perform similarly, with U-mesh slightly outperforming UC-mesh at their respective optima. Crossing edges exhibit the lowest variability but consistently higher mean , indicating limited adaptability compared with triangular meshes.
When aggregated over all five connectivity levels, F-mesh achieved the best mean
(0.35 ± 0.06), followed by B-mesh (0.36 ± 0.08), U-mesh (0.39 ± 0.04), and UC-mesh (0.40 ± 0.02). These statistics (
Table 5) highlight not only accuracy but also variability across connection settings.
These findings align with qualitative error maps for the B-mesh configuration, as shown in
Figure 4. Low-connectivity settings (
) accentuate polygonal discontinuities and tessellation artifacts, likely explaining the poor performance of B-mesh with
, while intermediate connectivity (
) reduces such artifacts and improves spatial coherence. At
, error maps show signs of plateauing or mild regression, likely due to over-coupling and amplified message-passing interference.
Figure 5 depicts the evolution of
across forecast horizons for the B-mesh (
) and F-mesh (
) configurations. B-mesh with
and F-mesh with
consistently produce better results, while the errors of the F-mesh with
and B-mesh with
are higher. Differences are negligible in the first 4–5 days but increase progressively, reaching approximately 30% relative degradation by the 15th day, emphasizing the operational significance of topology–connectivity interactions.
Table 6 shows the training and inference times for each mesh and connection count. Increasing
k increases the number of
and, therefore, memory and runtime. The computational cost increases linearly with the number of connections. During training, each additional edge adds on average between 6.6k and 6.8k seconds (≈1.8 h), corresponding to a relative increase of approximately 30% per edge compared to the
case. In inference, the impact is substantially lower: around 570 s per edge (≈10 min), equivalent to a ∼25% increase.
These results indicate that moderate connectivity (3–4 links per node) balances information flow and error control, while trimming excess edges reduces computational costs without performance loss. Bathymetry-based meshes, particularly F-mesh with mixed-sigmoid densification, yield smoother coastal errors, highlighting the importance of spatial adaptability. Forecast skills are mainly shaped by mesh topology after the first few days, and benefits become evident once resolution surpasses a critical threshold.
4.3. Artifact Formation and Order-k Voronoi Effects
The spatial organization of the prediction error reveals a strong geometric imprint induced by the grid-to-mesh association. For the lowest connectivity (
), the resulting partition closely resembles a first-order Voronoi diagram: Each mesh node defines a convex region, and the associated boundaries emerge where the Euclidean distance of two nodes is equal. The discontinuities in the
field align with these borders, forming sharp, polygonal divisions across the domain (
Figure 7). In this regime, tile boundaries are simple and coherent, and the geometry is dominated by the distance-based isolation of individual nodes.
This observed geometric structure is not incidental but arises because the underlying grid-to-mesh coupling mechanism is mathematically equivalent to generating an order-
k Voronoi diagram [
56]. The formulation begins by defining the total number of mesh nodes as
. The association mechanism, often implemented as the spatial distance
(e.g., KD-tree search), identifies a generator subset
for every grid node
. This subset consists of the
mesh nodes closest to
. Crucially,
k represents the fixed number of grid-to-mesh/mesh-to-grid connections (
) per node. The set of all possible unique generator subsets is
, where
. Each distinct subset
is explicitly defined as containing
k mesh nodes,
.
Each subset
defines a unique region known as an Order-
k Voronoi Polygon,
(Equation (
7)). This specific polygon,
, represents one of the distinct polygonal error regions (artifacts) observed in the prediction maps. It encompasses all grid nodes
that satisfy the following geometrical constraint:
The full set of these polygons, , is the induced order-k Voronoi diagram. This complete tessellation, which reflects deterministic changes in neighbor sets, constitutes the spatial organization of the prediction error field. In the autoregressive GNN, this partitioning ensures that each Voronoi tile behaves as a semi-independent predictor, causing errors to accumulate with distinct, tile-specific growth slopes over long lead times.
This equivalence (Equation (
8)) holds because the membership of a grid node (
) in an Order-
k Voronoi polygon (
) is entirely determined by its set of
k nearest neighbors
. This relationship is formally proven by biconditional equivalence:
where
is the function that returns the
k-nearest neighbor set (
) of
. Since each polygon (
) is uniquely defined by a single
k-element generator subset (
), the double inclusion is fulfilled: When the neighbor set of
coincides with this generator subset, the point satisfies the defining condition of the corresponding order-
k Voronoi polygon; when it differs, it necessarily lies outside its boundaries. Thus, the biconditional relationship arises directly from the definition of the order-
k diagram, where region boundaries occur precisely at locations
where its associated
changes.
As connectivity increases, the geometry of the induced partitions undergoes a qualitative shift. Instead of single-node dominance, each region is defined by overlapping neighborhoods of multiple mesh nodes. The resulting tiles lose convexity, become irregular, and exhibit fragmentation or elongation in certain areas. This increase in geometric complexity is spatially heterogeneous: Some zones retain simple structures, while others subdivide into non-convex or highly anisotropic shapes. The average tile area decreases with higher k, but this refinement does not translate into smoother error fields. Instead, the boundaries persist and frequently intensify, especially at vertices where three or more tiles converge, which act as localized amplification points for error growth under autoregressive prediction.
To confirm the geometric origin of these patterns, the connectivity mechanism was replicated using a synthetic mesh placed over a
domain (
Figure 8). Each grid point was assigned its
k-nearest neighbors via the same KD-tree-based search used in the encoder–decoder forecasting framework. The resulting partitions reproduced the theoretical structure of order-
k Voronoi diagrams described in the analytical literature [
57], matching the reference formulation precisely. Applying the same procedure to the U-mesh configuration from
to 5 yielded a tessellation with boundaries replicating those artifacts, validating that the spatial organization of the
gradients is a direct consequence of the
k-NN association (
Figure 7). The discontinuities in the error are therefore not incidental: they reflect deterministic changes in neighbor sets across partition interfaces.
Coastal boundaries truncate tiles and remove candidate neighbors, creating smaller and more irregular cells than in offshore regions. Euclidean distances in latitude–longitude space further introduce directional bias, particularly along the north–south axis, distorting partition geometries. These geometric distortions interact with strong coastal SST gradients and localized heterogeneity, amplifying error accumulation. To systematically capture these effects, we introduce Error Analysis by Spatial Tessellation in
Appendix A, a diagnostic framework that partitions the domain into tiles and tracks the evolution of forecast errors within each cell. Histograms of per-tile
reveal heavy-tailed behavior near the coast (
Figure A2), while offshore tiles display more symmetric distributions. The tile-averaged
grows approximately linearly with lead time (
Figure A3), but growth rates vary sharply across space, with the steepest slopes concentrated along coastal bands.
Increasing
k does not eliminate these discontinuities. Although higher connectivity reduces individual tile size (
Figure 7), it simultaneously increases fragmentation, irregularity, and the frequency of intersections. The transitions between neighbor sets remain discrete, preserving the geometric basis of the discontinuities.
gradients continue to align with the tile boundaries, and vertices formed by multi-tile intersections become preferential sites for accelerated error propagation. The persistence of these structures indicates that artifacts arise from the intrinsic geometry of the
k-NN mechanism rather than from insufficient neighbor node count or model performance.
The spatial structure of the
is dictated by the grid-to-mesh association, where tile geometry depends on connectivity and node placement. In autoregressive settings, each tile acts as a semi-independent predictor with distinct error dynamics (
Figure A3), producing spatial–temporal heterogeneity. Artifact formation arises from the equivalence between connectivity rules and a Voronoi partition, implying that mitigation requires altering the association geometry rather than merely increasing connectivity.
4.4. Influence of the Number of Mesh Nodes
Across the four mesh configurations,
trajectories remain nearly identical during the first four to five lead-time days, regardless of node count, as can be observed in
Figure 9a. At these short horizons, forecast accuracy is primarily governed by initial observational states and the intrinsic predictive skill of the model, leaving mesh topology with negligible influence.
To rigorously quantify forecast uncertainty and validate performance differences, the posterior distribution of the
was modeled using Bayesian Neural Fields [
58], generating a probabilistic ensemble of
samples. We applied a mean bias correction (“Error Dressing”; [
59]) and evaluated comparative performance using the distribution of paired differences (
), following [
60] to account for temporal correlation. Significance was determined via a Zero-Inclusion Criterion on the 66% credibility intervals, as described by [
61].
Applying this framework to the high-density node configuration (
Figure 9b) reveals a statistically significant divergence from day six onward. While structured meshes (U-mesh and UC-mesh) show a steep increase in error, F-mesh and B-mesh sustain lower error growth with paired difference intervals that consistently exclude zero. This confirms the existence of a temporal activation window: beyond day 6, error accumulation due to autoregressive structural artifacts is significantly mitigated by the adaptive geometry of unstructured meshes.
Conversely, when node counts are reduced, these statistical distinctions vanish across the entire prediction horizon (
Figure 9a). The 66% credibility intervals for the differences largely overlap with zero, indicating that insufficient spatial resolution suppresses topology effects. These results identify a spatial resolution threshold: below a critical node density (e.g., 34 or 20 nodes), representational capacity becomes the dominant limiting factor, rendering the choice between structured and unstructured designs statistically negligible.
A secondary observation relates to the role of diagonal crossing edges in the UC-mesh. Configurations without crossing edges (U-mesh) occasionally show slightly more stable trajectories than those with intersecting connections (UC-mesh), suggesting that excessive edge proliferation may compound long-range error growth. However, this effect remains secondary to the broader distinction between structured and unstructured designs.
At the seventh-day lead time, all configurations show marginal differences (
Figure 10a), with structured meshes sometimes presenting slightly lower
than unstructured ones. The error curves remain nearly flat across resolutions, reinforcing the dominance of initial conditions at very short horizons.
By the tenth day lead time, a transitional regime emerges. Structured configurations begin to show a gradual increase in
with higher node counts (
Figure 10b), while the unstructured meshes remain stable or even improve modestly, particularly in the bathymetric layout. This suggests that once the constraint of the initial state weakens, topology-sensitive designs can better capture underlying SST variability.
At the fifteen-day horizon (
Figure 10c), the divergence becomes pronounced. Structured meshes degrade substantially with increasing node count—especially in crossing-edge cases—whereas unstructured designs either maintain or reduce
levels as resolution increases. This inversion underscores that unstructured strategies not only accommodate spatial heterogeneity more effectively but also scale more robustly with forecast length.
Increasing node count alone does not guarantee improved forecast accuracy. At higher spatial resolutions, differences between mesh families become apparent only beyond day five. Here, unstructured meshes consistently outperform structured ones (
Figure 10c), demonstrating that the spatial organization and connectivity—not raw node count—determine whether added resolution yields meaningful gains.
Notably, the B-mesh is highly effective at higher resolutions but performs comparatively worse at low node densities, indicating that adaptive placement requires a minimum number of nodes to operate effectively. F-mesh exhibits an intermediate behavior but similarly loses advantage when spatial capacity is limited.
Spatial analyses of squared-error fields at day 15 reveal clear contrasts among mesh families as resolution increases. In structured meshes, artifacts remain visible even at higher node counts (
Figure 11a), although their footprint shrinks. Coastal regions consistently emerge as hotspots of error due to the rigid and uniform connectivity of these grids, which limits their ability to represent strong nearshore gradients.
Unstructured configurations exhibit smoother and more coherent error fields (
Figure 11b), with far fewer discretization artifacts. The B-mesh shows the clearest advantage: Errors near the coast are reduced, and offshore propagation is constrained more effectively than in structured designs. Because node placement reflects underlying morphology, transitions between coastal and open-ocean regions are better resolved, attenuating artificial discontinuities.
F-mesh shows intermediate behavior. They benefit from increased resolution and lack of rigid cell imprinting, but they do not suppress coastal error growth as consistently as the bathymetric layout. Across lead times, unstructured meshes modulate not only the magnitude but also the spatial evolution of . At higher node densities—particularly in the B-mesh configuration—error growth remains more localized and physically coherent, aligning with the statistical trends observed in the curves.