Next Article in Journal
Generating Bit-Rock Interaction Forces for Drilling Vibration Simulation: An Artificial Neural Network-Based Approach
Previous Article in Journal
Study on the Mechanical Characteristics of Crack Propagation in 07MnMoVR Pressure-Bearing Steel Pipes Under Residual Stress
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Generation of Digital Elevation Models Using the Poisson Equation and the Finite Element Method

by
Eduardo Conde López
,
Jesús Flores Escribano
,
Eduardo Salete Casino
* and
Antonio Vargas Ureña
Escuela Técnica Superior de Ingenieros Industriales, Universidad Nacional de Educación a Distancia, 28040 Madrid, Spain
*
Author to whom correspondence should be addressed.
Modelling 2026, 7(1), 10; https://doi.org/10.3390/modelling7010010
Submission received: 2 December 2025 / Revised: 24 December 2025 / Accepted: 30 December 2025 / Published: 2 January 2026

Abstract

This paper presents a finite element methodology for generating continuous digital elevation models (DEMs) from discrete terrain data using the Poisson equation under steady-state conditions. Unlike conventional DEM interpolation techniques, the proposed methodology formulates terrain reconstruction as a constrained harmonic problem, solved directly on scattered point sets using standard finite element procedures, without requiring structured grids or intermediate interpolation stages. The approach interprets the elevation field as a harmonic scalar function whose smoothness is enforced by the variational formulation of the Poisson problem. The governing equation is solved using standard finite element procedures with Dirichlet boundary conditions applied at the measurement points, ensuring that the reconstructed surface passes exactly through the known elevations. The isotropic conductivity coefficient is set to unity and the source term to zero, which simplifies the formulation and yields a harmonic interpolation independent of any physical parameters. The resulting surfaces exhibit continuous slopes and reduced sensitivity to irregular data distributions. Numerical tests comprising two analytical examples and a real terrain case show that, compared with thin-plate FEM and RBF–NURBS reconstructions, the proposed Poisson-based approach yields smoother and more stable surfaces, with global errors of the same order of magnitude and reduced computational cost.

1. Introduction

Digital elevation models (DEMs) are a fundamental tool in geoscience, civil engineering, hydrology, and geomatics among other sciences. They provide a continuous representation of the terrain surface and serve as the basis for slope analysis and the planning of engineering works. The accuracy and smoothness of the DEM strongly depend on the interpolation technique used to transform the discrete set of elevation measurements into a continuous surface. The choice of interpolation method is therefore crucial for ensuring the reliability of any subsequent spatial or numerical analysis.
Traditional interpolation methods such as inverse distance weighting [1], kriging [2,3], or spline-based techniques [4,5,6] can provide acceptable results for well-distributed datasets, but they often face limitations when the data are irregularly spaced or when the terrain exhibits complex gradients [7,8]. Radial basis functions (RBFs) [9] have also been widely used for smooth surface reconstruction due to their mathematical flexibility and mesh-free nature, but their performance is strongly influenced by the choice of kernel and support radius, which limits their stability for large datasets.
More recently, data-driven approaches, particularly those based on machine learning, have also been explored for DEM interpolation and surface reconstruction. In particular, convolutional neural networks and multi-scale learning architectures have been employed to infer elevation fields from sparse or irregularly sampled data [10,11]. These methods often achieve high predictive accuracy when large training datasets are available, but they typically require extensive training, lack an explicit variational or physical interpretation, and offer limited control over smoothness or boundary behaviour, which can be critical in engineering-oriented applications.
In such cases, physically inspired or variational approaches offer a powerful alternative, as they guarantee smoothness by minimizing an energy functional rather than relying purely on geometric fitting. The Finite Element Method (FEM) provides a convenient computational framework for this type of approach [12].
In a previous study [13], the terrain surface was reconstructed using the FEM formulation of the thin-plate bending problem. That methodology was based on the Kirchhoff–Love theory and led to a biharmonic partial differential equation, which was solved using standard FEM shell elements. The resulting surfaces exhibited a high degree of smoothness and continuity, particularly in terms of curvature, but the computational cost was relatively high due to the large number of degrees of freedom required to represent bending effects. Moreover, the biharmonic formulation involves fourth-order derivatives, which impose stricter requirements on the continuity of the interpolation functions.
From the above review, it can be observed that existing approaches to DEM generation can be broadly classified into interpolation-based methods, such as kriging, splines, and RBFs, and variational or physically inspired formulations, including thin-plate models and Poisson-based surface reconstruction techniques. While several studies have employed the Poisson equation for three-dimensional surface reconstruction from oriented point clouds, these approaches are fundamentally volumetric and differ in both formulation and objective from planar DEM interpolation. Indirectly related works, including data-driven and machine-learning-based methods, further highlight the diversity of available strategies, but typically lack an explicit variational interpretation or direct integration within FEM frameworks. In this context, the present work addresses a gap in the literature by formulating DEM reconstruction as a constrained harmonic problem solved directly by the finite element method on scattered planar data.
In the present work, a different FEM-based methodology is proposed for the same purpose, using the Poisson equation as the governing model. This formulation reduces the order of the governing equation from fourth to second, significantly decreasing the number of degrees of freedom and improving computational efficiency without compromising the smoothness of the reconstructed surface. The use of standard triangular elements with first-order interpolation functions is sufficient to achieve accurate results.
Unlike previous Poisson-based methods for 3D surface reconstruction from point clouds [14,15], which use the Poisson equation to recover a closed surface from oriented points in three-dimensional space, the present formulation is strictly two-dimensional and designed for planar terrain interpolation. The unknown field represents the elevation, and the governing equation is interpreted as a harmonic interpolation model rather than a volumetric reconstruction. This distinction makes the proposed method computationally lighter, conceptually simpler, and directly applicable to DEM generation.
In addition to presenting the new Poisson-based FEM formulation, this work includes a comparison with two alternative surface reconstruction strategies: the previously published FEM model based on a variational formulation unrelated to the present Poisson approach, and a non-physical geometric method combining Radial Basis Function (RBF) interpolation with Non-Uniform Rational B-Splines (NURBS). The RBF–NURBS procedure generates a smooth surrogate surface from scattered data by first constructing a global RBF interpolant and then sampling it on a tensor-product grid suitable for NURBS interpolation. Although this approach can yield highly accurate surfaces under favourable sampling conditions, it lacks any underlying physical or variational principle, is sensitive to clustered or irregular point distributions, and requires solving dense linear systems together with an additional fitting step.
In addition to presenting the new Poisson-based FEM formulation, this work includes a comparison with two alternative surface reconstruction strategies: the previously published FEM model based on a variational formulation unrelated to the present Poisson approach, and a non-physical geometric method combining Radial Basis Function (RBF) interpolation with Non-Uniform Rational B-Splines (NURBS). The RBF–NURBS procedure generates a smooth surrogate surface from scattered data by first constructing a global RBF interpolant and subsequently fitting a NURBS surface to a sampled grid. It is important to emphasize that the introduction of the NURBS stage is not intended to improve the interpolation accuracy with respect to the original data points, as the RBF interpolation already provides an exact and smooth reconstruction. The role of the NURBS surface is instead to provide a compact and explicit parametric representation of the terrain, which is advantageous for geometry handling and integration within CAD and FEM workflows. While this two-stage approach can be effective under favourable sampling conditions, it lacks an underlying physical or variational principle, is sensitive to clustered or irregular point distributions, and requires solving dense linear systems together with an additional fitting step.
The three approaches differ fundamentally in their mathematical formulation, computational complexity, and type of smoothness achieved. Table 1 summarises the main characteristics of each method considered in this study. The results demonstrate that the proposed Poisson-based FEM approach combines the simplicity of low-order interpolation with the global smoothness characteristic of variational formulations, offering a fast and physically consistent alternative for digital terrain modelling.
Since DEM resolution has a direct influence on hydrological and geomorphological simulations [16], the ability to efficiently generate smooth and accurate elevation fields becomes essential. The proposed approach provides a robust and computationally efficient interpolation framework that integrates naturally within existing FEM environments.
The objective of this paper is therefore twofold: first, to present the theoretical formulation and implementation of the Poisson-based FEM method for terrain surface reconstruction; and second, to evaluate its performance against the previously developed thin-plate FEM model and a RBF-NURBS interpolation. The comparison is performed using both synthetic and real terrain datasets, allowing quantitative assessment in terms of accuracy, smoothness, and computational efficiency. The results demonstrate that the Poisson formulation provides a significant reduction in computational effort while maintaining the accuracy required for digital terrain modelling.

2. Methodology

2.1. Methodology Overview

The methodology proposed in this work aims to reconstruct a continuous terrain surface from a discrete set of elevation data by using the Finite Element Method as an interpolation framework. The approach treats the elevation field as a scalar variable defined over a two-dimensional computational domain representing the horizontal projection of the study area. The governing equation is derived from the Poisson problem, which enforces smoothness through a variational principle without assuming any specific physical behaviour of the terrain.
The process begins by defining the computational domain  Ω that encloses all available measurement points. This domain is discretized into a finite element mesh composed of triangular elements, which provides flexibility to represent irregular boundaries and to locally refine the resolution where the data density is higher. Each node of the mesh is associated with an unknown scalar variable  T ( x , y ) representing the elevation to be estimated.
Known elevation points are introduced as boundary or internal constraints by prescribing their measured heights directly as nodal values. The remaining nodes are determined by solving the Poisson equation in steady state, ensuring that the resulting surface satisfies harmonic equilibrium and exhibits continuous slopes across the entire domain. The formulation naturally filters high-frequency noise and produces smooth interpolations even in areas with sparse or unevenly distributed data.
The overall procedure can be summarised as follows:
  • Definition of the domain. The boundary of the area of interest is established from the available topographic data or cartographic limits, defining the domain  Ω where the interpolation will be performed.
  • Mesh generation. The domain is discretised using triangular or quadrangular finite elements. Mesh density may be adapted according to terrain variability or point density to achieve an adequate balance between accuracy and computational efficiency.
  • Assignment of elevation data. The measured heights are imposed as Dirichlet boundary conditions at the corresponding nodal positions. Optional interior constraints can be added if additional elevation points are available within the domain.
  • Finite element analysis. The Poisson equation is solved under steady-state conditions using the FEM formulation presented in the next subsection. The solution provides the scalar field  T ( x , y ) , which represents the interpolated elevations.
  • Surface reconstruction and export. The resulting field is interpreted as the continuous terrain surface and can be exported to GIS or CAD environments for visualisation or further analysis.

2.2. Poisson Formulation

In this work, the generation of a smooth continuous surface from a set of discrete elevation data is addressed by means of the Finite Element Method using a formulation based on the Poisson equation, as an alternative to the thin plate model previously described. The governing equation is mathematically equivalent to the steady-state heat conduction problem and therefore allows the use of thermal analysis capabilities already available in standard finite element method (FEM) software.
The physical analogy considers the surface to be a homogeneous isotropic medium where the variable of interest, denoted by T ( x , y ) , represents a scalar potential analogous to temperature. The equilibrium of heat fluxes under steady-state conditions leads to the classical Poisson equation:
· ( k T ) = Q ,
where k is the isotropic conductivity coefficient (assumed constant and equal to 1 in this study), and Q ( x , y ) is a source term representing a distributed generation or absorption of heat. In the present study, the reconstruction is restricted to the homogeneous case Q = 0 , for which Equation (1) reduces to the Laplace equation. The resulting elevation field is therefore a harmonic function with continuous first derivatives. In the geometric context of surface generation, this property guarantees smooth transitions between known elevation points.
For clarity, the term “Poisson formulation” is used throughout the paper to denote the general methodological framework, while “Laplace equation” refers specifically to the homogeneous case Q = 0 considered in this study.
The strong form of the governing equation in the computational domain  Ω with boundary  Γ can thus be written as:
2 T = 0 in Ω ,
subject to appropriate boundary conditions:
T = T D on Γ D ,
k T · n = q N on Γ N ,
where Γ D and Γ N denote the Dirichlet and Neumann portions of the boundary, respectively, n is the outward unit normal, T D are prescribed temperatures, and q N are imposed normal fluxes.
In the present application, the known elevation points are enforced as Dirichlet conditions by assigning the measured height z i as temperature values T D = z i at the corresponding nodes of the finite element mesh. The remaining nodes are unconstrained, and their values are determined by solving Equations (2)–(4). The resulting scalar field T ( x , y ) can therefore be interpreted as an interpolated surface satisfying the harmonic equilibrium. This configuration ensures that the interpolated field  T ( x , y ) passes exactly through the known elevations while maintaining continuous first derivatives across the domain.
It is important to emphasize that, since Dirichlet constraints are imposed at interior points of the domain and not only along its boundary, the resulting problem does not correspond to a classical boundary value problem for the Poisson equation. Instead, it can be interpreted as a constrained harmonic reconstruction, in which the solution is required to satisfy prescribed values at a discrete set of internal locations. In this setting, the finite element mesh serves as a numerical support for enforcing these internal constraints, while the external boundary remains subject to natural (homogeneous Neumann) conditions unless explicitly constrained by measurement points.
The weak (variational) form of Equation (1) is obtained by multiplying by a weighting function v and integrating over  Ω :
Ω k T · v d Ω = Ω Q v d Ω + Γ N q N v d Γ .
This expression leads directly to the standard finite element formulation:
K T = F ,
where K is the conductivity (stiffness) matrix assembled from the elemental contributions:
K e = Ω e k ( N i ) T ( N j ) d Ω ,
T is the vector of nodal temperatures, and F is the load vector collecting the effects of the internal source term Q and the boundary fluxes q N .
The system (6) is symmetric and positive definite, which allows the use of efficient linear solvers.
It should be noted that modelling the elevation field as a harmonic function implies an intrinsic regularization of the reconstructed surface. From a topographic perspective, this assumption is well suited to terrains characterized by smoothly varying slopes and the absence of sharp discontinuities, as the harmonic solution minimizes the integral of the squared gradient over the domain. In this sense, the resulting surface represents a smoothed approximation of the underlying topography rather than a strict pointwise interpolant of local relief variations.
As a direct consequence of this harmonic formulation, the Poisson-based reconstruction acts as a low-pass filter on the elevation field. High-frequency components of the surface are progressively attenuated, strong local slopes tend to be underfitted, and sharp transitions or discontinuities are smoothed out. This behaviour is inherent to the minimisation of gradient variations and should therefore be regarded as a defining characteristic of the method rather than a numerical shortcoming. The impact of this regularisation becomes increasingly apparent in the numerical examples presented below, particularly in cases involving abrupt elevation changes or highly irregular sampling.

2.3. Domain Definition and Meshing

The computational domain  Ω represents the horizontal projection of the study area in which the elevation field is to be interpolated. Its boundary  Γ is defined so that all available elevation measurements are contained within the domain. Each measured point, or each location for which the elevation is known, must correspond to a node of the finite element mesh with coordinates  ( x i , y i ) and an assigned elevation  z i . These nodes act as Dirichlet conditions in the numerical model.
Additional nodes are distributed within the domain at arbitrary positions to complete the discretisation. Their elevations are unknown and will be computed from the numerical solution of the Poisson equation. The resulting mesh provides the spatial framework for the interpolation of the scalar field  T ( x , y ) representing the terrain surface.
The quality of the resulting interpolation depends on the distribution of nodes and the size of the elements. A denser mesh is generally employed in regions where the terrain exhibits higher gradients or where data points are concentrated. Conversely, coarser elements are sufficient in relatively flat areas.
The procedure used to define the computational boundary, locate the measurement points as mesh nodes, and generate the remaining nodes ensuring adequate coverage of the domain, follows the methodology previously described in [13]. That earlier work contains a detailed explanation of the steps suggested to build the mesh.
The generation of a suitable mesh is a critical step in any finite element formulation, as it determines the spatial resolution and numerical accuracy of the model [17,18]. Classical grid generation techniques have progressively evolved towards automatic and adaptive mesh algorithms [19,20], with more recent developments incorporating optimization criteria and quality control for unstructured triangulations [21,22].

2.4. Use of RBF Interpolation as a Preprocessing Step for NURBS Surfaces

Although NURBS surfaces provide a flexible and compact representation of smooth geometries, they cannot interpolate a scattered point cloud directly. A tensor-product NURBS surface requires its control points to be arranged on a rectangular grid in the parameter space, which presupposes an ordered data structure incompatible with the irregular point distributions commonly found in terrain reconstruction (a lidar raster could be handled, but not a general unstructured cloud). When the available data consist of arbitrarily located samples, a NURBS surface fitted directly to the ( x , y , z ) triples can only approximate them in a least-squares sense and will generally not pass through the selected points.
To overcome this limitation, we introduce an auxiliary preprocessing step based on radial basis function (RBF) interpolation. This step is not part of the Poisson-based reconstruction method proposed in this work; it is included solely to provide a consistent and controlled procedure for constructing a NURBS representation in the numerical comparisons. We employ a second-order polyharmonic spline RBF, also known as the logarithmic biharmonic kernel, Φ ( r ) = r 2 ln r , which yields a smooth interpolant over the entire domain and remains stable under irregular point distributions. Since the RBF is an exact interpolant, it passes through all available data points and therefore provides a reference surface that reproduces the known elevations with zero interpolation error.
The resulting RBF interpolant is then sampled on a uniform tensor-product grid, producing a structured dataset suitable for exact NURBS interpolation. It is important to note that the regularity of this grid refers exclusively to the parametric domain: the sampled points possess a rectangular indexing structure in the ( u , v ) parameter space, even though their physical coordinates ( X , Y , Z ) are not uniformly spaced. In this way, the NURBS surface does not interpolate the original scattered data, but rather a regular sampling—in the parametric sense—of the smooth RBF interpolant. Since the RBF surface passes exactly through the scattered samples, increasing the sampling resolution makes the resulting NURBS surface converge towards the underlying RBF interpolant and therefore remain very close to the original data points, with small and controlled errors. This provides a robust and reproducible bridge between unstructured point clouds and the tensor-product NURBS representation used in the examples.
Although the RBF interpolant alone would be sufficient to obtain an exact surface matching the scattered data, we additionally construct a NURBS representation so that the comparison with the Poisson-based reconstruction is carried out between two smooth surfaces defined over structured tensor-product domains. The NURBS surface does not enhance the interpolation quality provided by the RBF, but it offers a parametric and computationally efficient representation that facilitates uniform sampling, visualization, and a consistent comparison framework. In this way, both the Poisson reconstruction and the RBF–NURBS approximation can be evaluated on identical grids, ensuring a fair and homogeneous assessment of their respective behaviors.

3. Model Parameters

The numerical problem is solved under steady-state conditions using the Poisson formulation described above. In all cases, the isotropic conductivity coefficient k is set to unity and the internal source term Q is set to zero. Under these assumptions, the governing equation reduces to the Laplace equation:
2 T = 0 ,
which yields a harmonic field ensuring a smooth interpolation between the prescribed elevation values. This configuration is sufficient for surface reconstruction problems.
Since Q = 0 , coefficient k has no effect when steady-state conditions are considered. Consequently, its value does not influence the shape of the resulting solution, and setting  k = 1 and  Q = 0 simplifies the formulation without loss of generality.
The resulting model therefore represents a purely harmonic interpolation of the measured data, independent of any physical parameters, and provides a stable and smooth approximation of the terrain surface.

4. Examples

This section presents a set of numerical examples to evaluate and compare the three interpolation methodologies considered in this study: the Poisson-based FEM model, the previously developed thin-plate FEM formulation, and the NURBS-based geometric interpolation. The goal is to assess their relative performance in terms of smoothness, accuracy, and computational efficiency.

4.1. Description of the Implemented Methods

Three different methods were implemented and tested for surface reconstruction from discrete elevation data.

4.1.1. Poisson-Based FEM Model

The Poisson formulation described in Section 2 was implemented using a finite element software. The domain is discretized into triangular elements with linear interpolation functions. The measured elevation points are introduced as nodal Dirichlet boundary conditions, while all other nodes are treated as unknowns. The governing equation:
2 T = 0
is solved under steady-state conditions, with unit conductivity and zero source term. The resulting scalar field T ( x , y ) is directly interpreted as the interpolated elevation surface.

4.1.2. Thin-Plate FEM Model

For comparison purposes, the previously developed thin-plate FEM methodology [13] was also implemented in the FEM software. The model is based on the Kirchhoff–Love theory of plates, leading to a biharmonic equation:
4 w = 0 ,
which ensures curvature continuity across the surface. The nodal elevations corresponding to the measurement points are imposed as displacement boundary conditions, and the resulting deflection field w ( x , y ) represents the reconstructed terrain. Although this formulation provides high smoothness, it requires a significantly larger number of degrees of freedom and higher-order elements, increasing computational cost (Table 2).

4.1.3. RBF-NURBS-Based Geometric Model

The third methodology is based on Non-Uniform Rational B-Splines. An implementation was developed specifically for this work to generate a parametric surface from the same set of elevation data. The NURBS surface is defined by a grid of control points and a polynomial basis of degree p and q in the u and v directions, respectively. The weights associated with each control point allow local adjustment of curvature and surface smoothness. This approach is purely geometric and does not involve solving differential equations, which makes it computationally efficient but sensitive to irregular data distributions.
The NURBS-based interpolation was implemented in Python (version 3.10) using a combination of open-source scientific and geometric modeling libraries. The core of the method relies on the geomdl package [23], which provides a comprehensive implementation of Non-Uniform Rational B-Splines for surface generation, evaluation, and export. The function fitting.interpolate_surface() is used to construct a surface that exactly interpolates a regular grid of points in the ( x , y , z ) space, derived from the original scattered dataset. Prior to this step, the irregular cloud of points is resampled into a tensor-product grid using a radial basis function interpolator from the SciPy library [24]. The scipy.interpolate.Rbf class enables smooth interpolation of the input data through a thin-plate kernel function, providing stability even for irregular or sparse datasets.
Numerical operations and data preprocessing are handled through the NumPy package [25], which supports efficient array manipulation and numerical computation.
The overall workflow ensures that the NURBS surface passes exactly through the original measurement points while maintaining continuity and smoothness consistent with a polynomial degree of p = q = 3 . The use of the RBF interpolation only for the regularization of the grid, rather than as the final surface model, provides a hybrid approach that combines the flexibility of scattered data handling with the geometric precision of NURBS representation.

4.2. Description of the Test Cases

Three test cases are presented to assess the performance of the three methods. The first two correspond to synthetic geometric surfaces for which the analytical expression of the elevation is known, allowing quantitative evaluation of interpolation accuracy. The third example corresponds to a real terrain dataset.

4.2.1. Example 1: Harmonic Analytical Surface

The first test consists of an analytical function representing a smooth, continuous terrain surface. The elevation z ( x , y ) is defined as:
z ( x , y ) = sin ( π x ) sin ( π y ) ,
within a square domain 0 x , y 2 (Figure 1).
This example allows evaluating the intrinsic smoothness and numerical accuracy of each interpolation method under ideal sampling conditions. In this example, the proposed Poisson-based formulation was compared with the RBF-NURBS surface approach.
The domain was discretized using a structured mesh of 200 × 200 quadrangular elements.
The surface was generated using both regular and irregular sets of stake-out point layouts. The regular configurations consisted of uniformly spaced grids containing 49, 100, and 196 control points (corresponding to 7 × 7 , 10 × 10 , and 14 × 14 meshes, respectively). In addition, irregular distributions of control points were tested for the same numbers of points (49, 100, and 196), in order to analyze the influence of spatial irregularity on the resulting surfaces. For these irregular layouts, three different random seeds were used to generate independent point sets, ensuring statistical consistency in the comparison of results.

4.2.2. Example 2: Surface with Discontinuity of Gradient

The second test introduces a more complex geometry with a discontinuous slope. The analytical surface is defined by:
z ( x , y ) = x 2 + y 2 + 4 , if x < 0.5 , x 2 + y 2 , if x 0.5 .
The computational domain for this example is defined within the rectangular region 1 x 3 and 2 y 2 (Figure 2). This extended range, wider than that of Example 1, allows a clearer visualization of the discontinuity line at x = 0.5 and its influence on the interpolated surface. It also ensures that the harmonic behaviour of the Poisson-based formulation can be evaluated both in the vicinity of the gradient discontinuity and in the surrounding smooth regions.
This test examines the ability of each method to handle sharp changes in gradient and reproduce continuous surfaces without oscillations or artifacts. In this example, the proposed Poisson-based formulation was compared with the RBF-NURBS surface approach.
The domain was discretized using a structured mesh of 200 × 200 quadrangular elements.
For the selection of the stake-out points, the same procedure described for the previous example was applied. Both regular and irregular control point layouts were considered, using identical configurations in terms of the number of points and random seeds.

4.2.3. Example 3: Real Terrain Surface

The third test corresponds to a real terrain dataset, consisting of a point cloud measured over a defined region.
The dataset employed corresponds to the MDT02 2019 digital elevation model provided by the Spanish National Geographic Institute (Instituto Geográfico Nacional) under a CC-BY 4.0 license. The selected area represents a steep terrain section crossed by a river exhibiting pronounced meanders and strong local gradients (Figure 3). This region provides an appropriate benchmark for assessing the ability of the interpolation methods to reproduce complex topographic features and maintain surface continuity under highly variable slope conditions.
The selected region is located in southern Spain, near the geographic coordinates ( λ , ϕ ) = ( 5 . 42061 , 38 . 85354 ) . This area was chosen for its topography, characterised by steep slopes and a river exhibiting pronounced meanders. Its heterogeneous relief makes it a suitable benchmark for evaluating the capability of the interpolation methods to reproduce real terrain features with continuous gradients and harmonic smoothness.
In this last example, the results obtained with the proposed Poisson-based formulation were compared with those derived from the thin plate methodology presented in the previous study, as well as with the RBF-NURBS surface approach. All three methods were applied to the same terrain domain to ensure a consistent basis for comparison. The computational domain was discretized using a structured mesh of 200 × 200 nodes, with the same mesh as defined in [13].
To evaluate the robustness and accuracy of each surface generation method, different sets of stake-out points were tested under comparable conditions. The stake-out points were selected following two different criteria:
  • A regular (equidistant) mesh, and
  • A random spatial distribution.
In both cases, several test configurations were generated with different numbers of stake-out points: 49, 100, 196, and 400. For the random distribution, each configuration was repeated three times using different random seeds for the point generation. Consequently, a total of 16 runs were performed.
Before presenting the results of the real terrain example, it is important to note that the regular sampling configurations intentionally do not include control points along the domain boundary. As a result, the reconstruction near the edges relies on extrapolation rather than interpolation, which can lead to larger deviations in these regions. In the present formulation, Dirichlet constraints are imposed only at the measured interior points, while no explicit boundary conditions are prescribed along the external contour of the domain. Consequently, the boundary is subject to natural (homogeneous Neumann) conditions, and the reconstructed surface near the edges is primarily governed by the interior data distribution.
This choice was made deliberately to assess the sensitivity of the reconstruction to boundary sampling in a realistic geomatic setting.

5. Results

5.1. Evaluation Methodology

For each example, the results are presented in terms of the interpolated surface geometry, smoothness, and deviation from the analytical or measured data. The comparison between the three methods focuses on their capability to reproduce continuous and realistic terrain morphologies rather than on computational performance, since the implementations are based on different environments (compiled FEM software and Python for the RBF-NURBS model).
The quality of the reconstructed surfaces is assessed both visually and quantitatively. The visual inspection allows identifying the continuity of slopes and the presence of artificial oscillations, while the quantitative evaluation is based on the elevation differences between the interpolated surface and the reference data. In the synthetic examples, these differences are computed with respect to the analytical function, whereas in the real terrain case they are calculated with respect to the measured elevations. The maximum difference reported in the tables corresponds to the largest absolute deviation, while the global error is defined as the mean of the absolute elevation differences at all evaluated points.
All comparisons presented in this study are performed using identical variables and under strictly equivalent conditions for the three reconstruction methods. In all cases, the reconstructed elevation field z ( x , y ) is compared against the same reference surface, either given by the analytical function in the synthetic examples or by the measured elevations in the real terrain case. The deviations are always computed as pointwise differences in elevation at the same spatial locations, using identical sampling points and evaluation grids. No method-specific variables, weighting factors, or post-processing steps are introduced in the comparison. This ensures that the observed differences are solely attributable to the intrinsic behaviour of each reconstruction approach.
For each example, identical colour bar ranges are used across all reconstruction methods in both the DEM visualisations and the corresponding difference maps, in order to enable a direct visual comparison. The colour scales may differ between examples to account for the different ranges of elevation and deviation values.
For clarity, only a limited number of representative and limiting cases are reproduced and discussed in the main text. The complete set of results, including intermediate sampling densities and alternative random seeds for irregular point distributions, is provided in Appendix A.
This analysis provides a consistent framework to evaluate the ability of each method to reconstruct both simple and complex topographies while preserving the physical and geometric continuity of the terrain surface.

5.2. Example 1: Synthetic Function 1

In the first example, a representative selection of the results obtained by applying the Poisson FEM methodology is presented in the main text (Figure 4 and Figure 5), while the complete set of figures (Figure A1, Figure A2, Figure A3, Figure A4, Figure A5, Figure A6, Figure A7, Figure A8, Figure A9, Figure A10, Figure A11, Figure A12) is provided in Appendix A. The image on the left illustrates the reconstructed surface obtained with each interpolation method, while the image on the right displays the contour map of the differences with respect to the analytical reference function. These differences constitute interpolation errors with respect to the analytical surface; however, they reflect the intrinsic regularization imposed by the harmonic formulation rather than a numerical deficiency of the method. The objective is not to reproduce the exact pointwise values of the analytical function, but to capture its essential geometric features in terms of elevation and slope continuity.
Table 3 and Table 4 present the maximum and mean deviations obtained for each configuration, providing a quantitative assessment of how each method reproduces the overall shape and smoothness of the analytical surface.

5.3. Example 2: Synthetic Function 2

In the second example, the same analysis was performed using a different analytical function, characterized by a discontinuity that generates a sharp elevation jump. A representative selection of the corresponding results is presented in the main text (Figure 6 and Figure 7), while the complete set of figures (Figure A13, Figure A14, Figure A15, Figure A16, Figure A17, Figure A18, Figure A19, Figure A20, Figure A21, Figure A22, Figure A23, Figure A24) is provided in Appendix A, illustrating how each interpolation method reproduces this transition for the Poisson equation (FEM). As in the previous case, the differences represent interpolation errors relative to the analytical reference surface, arising from the smoothing inherent to the Poisson formulation. These errors therefore provide an indication of how effectively each approach captures the main geometric features of the surface and handles discontinuities in elevation and slope. The quantitative results, summarized in Table 5 and Table 6, present the maximum and mean absolute deviations (in parentheses) obtained for each configuration.

5.4. Example 3: Real Terrain

In the last example, corresponding to the real terrain case, a representative selection of the results is presented in the main text (Figure 8, Figure 9, Figure 10 and Figure 11), while the complete set of figures (Figure A25, Figure A26, Figure A27, Figure A28, Figure A29, Figure A30, Figure A31, Figure A32, Figure A33, Figure A34, Figure A35, Figure A36, Figure A37, Figure A38, Figure A39, Figure A40) is provided in Appendix A. For each configuration, the image on the left displays the reconstructed digital elevation model, whereas the image on the right shows the contour map of elevation differences, computed as the interpolated height minus the reference high-resolution DEM (Figure 3, right). These differences should be interpreted as deviations with respect to the reference dataset rather than absolute errors, reflecting how each interpolation approach adapts a smooth surface to the actual topography while preserving slope continuity and overall terrain morphology.
In the regular sampling configuration, the control points were intentionally arranged so that no points were placed along the lower and right boundaries of the domain. This design choice was made to explicitly assess the impact of missing boundary information on the reconstruction quality. As shown in the results, the absence of boundary constraints forces the Poisson and thin-plate models to extrapolate the surface near the edges, producing a noticeable increase in the deviations. Therefore, the behaviour observed in these regions is not a numerical artefact but an intended feature of the test configuration.
In the regular sampling configuration, the control points were arranged so that no points were placed along the lower and right boundaries of the domain, as discussed above. As a consequence, the Poisson and thin-plate models rely on extrapolation near these edges, which results in a noticeable increase in the deviations in these regions. This behaviour is therefore consistent with the expected influence of missing boundary constraints and does not indicate a numerical artefact of the formulation.
Table 7 and Table 8 report the maximum elevation differences for each method, while the values in parentheses denote the mean absolute deviations (in meters), providing a quantitative assessment of the surface fitting accuracy in the real terrain case.

6. Discussion

6.1. Example 1: Synthetic Function 1

For the regular distribution, the results follow the expected trend: increasing the number of points leads to a uniform reduction in the errors for both methods, with the RBF–NURBS model yielding the smallest deviations. Although both methods enforce the same elevation values at the sampled points, their behavior between these points differs fundamentally. The RBF interpolant reproduces the prescribed values exactly, and the subsequent NURBS approximation remains very close to this interpolating surface. In contrast, the Poisson-based model, while also improving with denser sampling, retains a slightly larger error. In this formulation the elevations at the control points are imposed through Dirichlet conditions, but the surface in between is obtained as the solution of an elliptic PDE that minimizes a global smoothness energy. Consequently, even for a smooth analytical function and a dense sampling, the Poisson reconstruction produces a surface that is intrinsically smoother than the target function, leading to small but systematic deviations.
For the random distributions, the overall behaviour is similar. In most configurations the errors decrease as the number of points increases, and both models remain reasonably robust to the stochastic nature of the sampling. However, the variability introduced by random point placement has a stronger impact on the RBF–NURBS reconstruction, which is more sensitive to local clustering and irregular spacing. This is evident in the differences among the three seeds for each point count: while many random configurations yield errors comparable to or only slightly above those obtained with the regular grids, others exhibit noticeably larger deviations, particularly for RBF–NURBS. In contrast, the Poisson-based method shows a more consistent performance across seeds, with smaller fluctuations in both maximum and mean errors.
The most prominent outlier corresponds to the 196-point random distribution for Seed 1, where the RBF-NURBS error increases sharply despite the high point density. This behaviour does not originate in the NURBS surface itself, but in the RBF interpolation step on which it is based. In this particular seed, several sample points are located very close to one another near the lower boundary of the domain (Figure 12), while no points exist immediately outside the domain to counterbalance their influence. The radial basis function employed here is a global interpolant, meaning that every data point contributes to the reconstructed surface throughout the entire domain. When multiple points are clustered near a boundary, their combined effect acts effectively as a strong local source term, forcing the interpolant to adopt an exaggerated curvature in order to pass through all the closely spaced samples. Inside the domain, similar clusters do not produce such distortions because they are surrounded by other points in all directions, which stabilises the interpolation. At the boundary, however, the lack of neighbouring data on one side prevents this balancing effect. As a result, the RBF interpolant develops an artificial deformation in that region, which is subsequently inherited by the NURBS surface fitted to the RBF-generated grid. This explains the marked increase in error observed for the 196-point irregular configuration with Seed 1, and highlights the sensitivity of global RBF methods to clustered samples located near domain boundaries.
Beyond the accuracy considerations discussed above, the behaviour observed in this example also illustrates several practical strengths of the Poisson-based reconstruction. Because the Poisson formulation relies on the solution of a sparse elliptic problem, it is naturally robust to uneven point distributions and does not require constructing an artificial tensor-product structure. In contrast, the RBF–NURBS pipeline depends critically on the intermediate RBF interpolation, whose global character can amplify local irregularities in the sampling. Moreover, building and evaluating an RBF interpolant requires solving a dense linear system whose size grows with the number of points, followed by a NURBS fitting step on a structured mesh. This makes the full RBF–NURBS procedure substantially more demanding in both computational time and memory. The Poisson model therefore combines a more stable response to irregular sampling with significantly better computational scalability, which becomes particularly relevant for large datasets or repeated reconstructions.

6.2. Example 2: Synthetic Function 2

In Example 2, the reconstruction problem becomes more challenging due to the presence of a sharp change in slope at x = 0.5 . This discontinuity in the derivative introduces a non-smooth feature that neither method is able to reproduce exactly, yet the two models handle this difficulty in different ways. For the regular point distributions, the errors remain of comparable magnitude for both approaches and do not decay as steadily as in Example 1. This behaviour is expected: the discontinuity dominates the reconstruction error, and increasing the number of points does not eliminate the intrinsic smoothing that both models apply across the jump. The RBF-NURBS-based reconstruction shows systematically smaller mean deviations, reflecting its ability to interpolate a smooth surrogate surface away from the discontinuity, whereas the Poisson solution exhibits more uniform errors across the domain but is influenced more strongly by the abrupt change in gradients.
For the random point sets, the behaviour departs more noticeably from that observed in Example 1. In all seeds and point counts, the discontinuity imposes a lower bound on the attainable accuracy, and the statistical variability between seeds becomes more pronounced. This effect is particularly visible in the Poisson reconstructions, where the maximum deviation increases significantly for seeds in which few points sample the region around x = 0.5 , thus providing insufficient information to reproduce the steep gradient transition. Conversely, when the random sampling happens to place more points near the discontinuity, the Poisson model yields errors similar to those from the regular grid. The RBF–NURBS model shows a more stable response across seeds, as the RBF interpolation distributes the influence of the jump more globally; however, this also results in a systematic smoothing of the discontinuity, leading to larger maximum errors in many cases.
Overall, the results reveal a complementary behaviour between the two reconstructions. The RBF–NURBS approach provides smoother approximations and is less sensitive to how the random samples are distributed around the discontinuity, but its global smoothing prevents an accurate reproduction of the sharp gradient change. The Poisson model, on the other hand, is able to preserve the structure of the discontinuity more faithfully when the sampling sufficiently resolves it, but becomes more sensitive to seeds that undersample the region where the slope changes. These trends are consistent with the observations made in Example 1: the RBF–NURBS method is strongly influenced by the smoothing inherent to the RBF interpolation, whereas the Poisson formulation responds more directly to the local distribution of pointwise gradient information. In the presence of non-smooth features, these differences become more pronounced and highlight the contrasting reconstruction mechanisms of the two approaches.

6.3. Example 3: Real Terrain

The real terrain example highlights the different balance that the three approaches strike between smoothness and pointwise accuracy. The Poisson-based model exhibits a robust behaviour in terms of maximum deviation, reaching values comparable to those of the thin-plate interpolator and the RBF-NURBS surface when the number of points increases. However, in all configurations—both regular and random—the mean absolute deviations provided by the Poisson formulation are noticeably higher than those obtained with the other two methods. This indicates that the Poisson solution produces a smoother surface with reduced roughness, which tends to underfit the small-scale variations present in the measured elevations.
In contrast, the thin-plate interpolator and the RBF-NURBS reconstruction achieve a closer pointwise agreement with the reference data, as reflected by their consistently lower mean deviations, although at the cost of reproducing more local variability of the terrain. As the point density increases, the three methods show a coherent convergence trend, with diminishing maximum and mean deviations, but the relative behaviour between them remains consistent.
In contrast, the thin-plate interpolator and the RBF-NURBS reconstruction achieve a closer pointwise agreement with the reference data, as reflected by their consistently lower mean deviations, although at the cost of reproducing more local variability of the terrain. As the point density increases, the three methods show a coherent convergence trend, with diminishing maximum and mean deviations, but the relative behaviour between them remains consistent. It is worth noting that, for the random sampling configurations, the maximum deviation does not necessarily decrease monotonically with increasing number of points. This behaviour is expected, as the maximum deviation is a highly local metric that is strongly influenced by the specific spatial distribution of the sampling points. While increasing point density improves the overall coverage of the domain on average—leading to a systematic reduction of the mean deviation—isolated gaps or local clustering may still occur and dominate the maximum deviation. As a result, non-monotonic variations of the maximum deviation with point density are a natural consequence of random sampling and do not contradict the general convergence trend observed in the mean error.
Overall, Example 3 shows that the Poisson approach prioritizes smoothness and slope continuity over pointwise accuracy, whereas thin-plate and RBF-NURBS favour a tighter local fit. The choice between these methods therefore depends on whether the application requires a smoother global representation or a more detailed reproduction of the small-scale terrain features.
The results also show that the absence of sampling points on the domain boundary strongly amplifies the errors in the Poisson and thin-plate models (Figure A25, Figure A26, Figure A27, Figure A28), particularly near the edges where the surface must be extrapolated. This effect highlights the importance of an adequate boundary sampling strategy when applying these methods to real terrain data.

7. Conclusions

7.1. Main Contributions

This work has introduced a Poisson-based strategy for reconstructing smooth surfaces from scattered elevation data and has compared it with an RBF–NURBS reconstruction across several synthetic and real examples. In addition to the quantitative differences observed in the numerical tests, the study reveals a number of conceptual and practical advantages of the Poisson formulation that are particularly relevant for applications involving irregular or large datasets.
Overall, the results demonstrate that the Poisson-based reconstruction provides a robust, scalable, and methodologically clean alternative to interpolation-driven methods. While RBF–NURBS may reach higher pointwise accuracy under favourable sampling conditions, the Poisson formulation offers a more stable and practically applicable framework for surface reconstruction, especially in irregular sampling scenarios and large-scale computational settings.

7.2. Accuracy, Smoothness, and Limitations

An important strength of the Poisson approach is its inherent robustness to noise and local fluctuations in the data. Since the reconstructed surface is obtained by solving an elliptic PDE that integrates a smoothly regularised representation of the terrain derivatives, the method naturally suppresses local inconsistencies and avoids the sharp oscillations that interpolation-based schemes may reproduce.
The real terrain experiment confirms these smoothing effects in a demanding geomatic setting. As the point density increases, the Poisson-based reconstruction attains maximum deviations that are comparable to those of the thin-plate and RBF–NURBS methods, but it consistently shows larger mean deviations. This behaviour reflects the stronger smoothing imposed by the Poisson formulation, which produces a surface with reduced roughness and therefore underrepresents small-scale terrain variations. This smoothing behaviour also defines the main limitation of the proposed approach, which stems from the use of a harmonic formulation. Since the solution minimizes gradient variations in a global, variational sense, the method is not designed to accurately reproduce abrupt topographic features such as cliffs, sharp ridges, terraces, or anthropogenic structures. In such cases, the intrinsic smoothing of the Poisson model may lead to an underestimation of local slopes and elevations. Consequently, the method should not be regarded as a replacement for exact interpolation techniques when the preservation of fine-scale or highly localized features is required, but rather as a regularized reconstruction strategy appropriate for smoothly varying terrains or large-scale modelling applications.
In contrast, thin-plate and RBF–NURBS reconstructions provide a closer pointwise fit at the expense of reproducing more of the local variability present in the data.
The results also highlight the importance of adequate boundary sampling. In regions where no control points are available—particularly along the domain edges—the Poisson and thin-plate models must extrapolate the surface, which leads to a substantial increase in error. This effect is clearly visible in the real terrain test and underscores the need to include boundary information when working with scattered elevation data.

7.3. Computational Aspects

A further and notable advantage lies in the computational cost. The linear system arising from the Poisson formulation is sparse, allowing the use of efficient iterative solvers or multigrid methods whose complexity scales approximately as O ( n ) or O ( n log n ) , depending on the solver and preconditioning strategy. The RBF–NURBS pipeline, on the other hand, requires solving a dense interpolation system for the RBF coefficients, with a computational cost that scales as O ( n 3 ) in the general case, followed by the construction of a NURBS surface on a structured grid. This makes the Poisson formulation substantially more scalable and better suited for large or high-resolution datasets.
A direct comparison of execution times or memory usage is not reported in this work, as the two approaches have been implemented in fundamentally different computational environments. The Poisson-based formulation is solved using a commercial FEM solver with highly optimized compiled routines and solver strategies that are not directly accessible or configurable, whereas the RBF interpolation relies on a third-party Python implementation. As a result, any direct timing or memory comparison would be dominated by implementation-specific factors rather than by the intrinsic numerical characteristics of the methods.
Nevertheless, the difference in memory requirements follows directly from the structure of the linear systems involved: sparse matrices in the Poisson formulation versus dense matrices in the RBF interpolation, leading to markedly different memory scaling for large problem sizes.

7.4. Practical Implications

The Poisson formulation also has the advantage of working directly on the scattered point set, without requiring any imposed structure on the data. In contrast, the NURBS reconstruction depends critically on a preliminary RBF interpolation and the generation of a regular tensor-product grid, making it more sensitive to variations in point density and distribution and more susceptible to local artefacts, particularly near domain boundaries.
In addition, the Poisson model produces globally coherent surfaces even in the presence of uneven or clustered sampling. The underlying variational principle ensures smooth transitions between regions of different point density and prevents the formation of local distortions that may arise in global interpolation schemes such as RBFs. Finally, the PDE-based nature of the method makes it naturally compatible with finite element workflows, facilitating its integration into broader modelling pipelines involving gradient-based or physics-driven processes.
The Poisson-based reconstruction also generates surfaces with smoother slopes than those produced by the other methods considered. This characteristic can be advantageous in various engineering and modelling contexts. For instance, when generating boundary geometries for finite element models of structures (such as dams or bridges), the terrain does not need to be represented with high local detail, and an overly rugged surface would unnecessarily refine the mesh. Likewise, in large-scale CFD or river-channel simulations, incorporating fine-scale topographic irregularities may lead to impractically large meshes, whereas a smoother DEM is often preferable. Similar considerations apply to two-dimensional hydraulic or shallow-water models, where small-scale roughness and vegetation effects are introduced through empirical roughness parameters rather than explicitly through micro-topography.
It is also worth noting that the intrinsic smoothing introduced by the Poisson formulation can be beneficial in situations where the underlying surface is extremely smooth, nearly harmonic, or when the available data contain noise. In these cases, enforcing exact pointwise interpolation—as done by RBF-based approaches—may reproduce small oscillations or fluctuations that are not representative of the large-scale behaviour of the surface. By contrast, the elliptic regularization inherent to the Poisson model acts as a natural stabilizing mechanism, yielding reconstructions that remain faithful to the global geometry while filtering out spurious variations.

7.5. Perspectives and Future Work

Although modern finite element workflows often incorporate adaptive meshing or gradient-based mesh refinement strategies, these aspects have not been explicitly addressed in the present study. The primary focus here is on the reconstruction of a smooth elevation field from scattered data, rather than on the optimisation of the computational mesh itself. In this context, the finite element mesh acts merely as a numerical support for solving the Poisson problem and does not represent a physical discretisation requiring error-driven refinement. Nevertheless, the proposed formulation is fully compatible with adaptive meshing techniques, which could be applied in a subsequent stage if local resolution enhancement were required for specific applications.
The examples analysed in this study were constructed from either regular grids or random point clouds generated without human intervention. This strategy was deliberately adopted to avoid selection bias and to enable objective comparisons across methods. In practical applications, however, sampling is typically performed by engineers or specialists who can select points at key locations—such as peaks, valleys, or slope breaks—capturing the essential structure of the terrain. For this reason, real-world errors are expected to be significantly lower than those obtained with the artificially neutral sampling used in the synthetic and real examples of this study.
A final remark concerns the role of the source term Q in the Poisson formulation. In this study, the reconstruction has been restricted to the homogeneous case Q = 0 , which naturally promotes smooth solutions and highlights the intrinsic regularizing effect of the method. In more general settings, prescribing a non-zero or spatially varying Q ( x , y ) would allow one to locally adjust the curvature of the reconstructed surface, effectively giving different weights to selected regions or features. Exploring these possibilities, however, would require a dedicated analysis and falls outside the scope of the present work. Nevertheless, the potential flexibility offered by non-homogeneous Poisson models suggests an interesting direction for future research, particularly in applications where varying degrees of smoothness are desirable across the domain.

Author Contributions

Conceptualization, E.C.L., E.S.C. and J.F.E.; Data curation, E.C.L. and E.S.C.; Formal analysis, A.V.U.; Investigation, E.C.L., E.S.C., J.F.E. and A.V.U.; Methodology, E.C.L., E.S.C. and J.F.E.; Project administration, E.S.C.; Resources, E.C.L. and A.V.U.; Software, E.S.C.; Validation, J.F.E. and A.V.U.; Visualization, E.C.L. and E.S.C.; Writing—original draft, E.C.L., E.S.C. and A.V.U.; Writing—review and editing, E.C.L., E.S.C., J.F.E. and A.V.U. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

Data is contained within the article.

Conflicts of Interest

The authors declare no conflicts of interest.

Abbreviations

The following abbreviations are used in this manuscript:
FEMFinite Element Method
RBFRadial Basis Function
NURBSNon-Uniform Rational B-Spline
DEMDigital Elevation Model
PDEPartial Differential Equation
GISGeographic Information System
CADComputer Aided Design
CFDComputational Fluid Dynamics

Appendix A. Figures

This appendix presents the complete set of figures corresponding to the numerical experiments discussed in the paper. For clarity, only a limited number of representative and limiting cases are reproduced and discussed in the main text, while all configurations—including intermediate point densities and alternative random seeds for irregular point distributions—are collected here. This organisation avoids redundancy in the main manuscript while preserving completeness and allowing the robustness and reproducibility of the observed behaviours to be assessed.

Appendix A.1. Example 1: Synthetic Function 1

Figure A1. Regular 49 points. (Left): DEM. (Right): Difference with analytical function (Example 1).
Figure A1. Regular 49 points. (Left): DEM. (Right): Difference with analytical function (Example 1).
Modelling 07 00010 g0a1
Figure A2. Regular 100 points. (Left): DEM. (Right): Difference with analytical function (Example 1).
Figure A2. Regular 100 points. (Left): DEM. (Right): Difference with analytical function (Example 1).
Modelling 07 00010 g0a2
Figure A3. Regular 196 points. (Left): DEM. (Right): Difference with analytical function (Example 1).
Figure A3. Regular 196 points. (Left): DEM. (Right): Difference with analytical function (Example 1).
Modelling 07 00010 g0a3
Figure A4. Irregular 49 points, seed 1. (Left): DEM. (Right): Difference with analytical function (Example 1).
Figure A4. Irregular 49 points, seed 1. (Left): DEM. (Right): Difference with analytical function (Example 1).
Modelling 07 00010 g0a4
Figure A5. Irregular 49 points, seed 2. (Left): DEM. (Right): Difference with analytical function (Example 1).
Figure A5. Irregular 49 points, seed 2. (Left): DEM. (Right): Difference with analytical function (Example 1).
Modelling 07 00010 g0a5
Figure A6. Irregular 49 points, seed 3. (Left): DEM. (Right): Difference with analytical function (Example 1).
Figure A6. Irregular 49 points, seed 3. (Left): DEM. (Right): Difference with analytical function (Example 1).
Modelling 07 00010 g0a6
Figure A7. Irregular 100 points, seed 1. (Left): DEM. (Right): Difference with analytical function (Example 1).
Figure A7. Irregular 100 points, seed 1. (Left): DEM. (Right): Difference with analytical function (Example 1).
Modelling 07 00010 g0a7
Figure A8. Irregular 100 points, seed 2. (Left): DEM. (Right): Difference with analytical function (Example 1).
Figure A8. Irregular 100 points, seed 2. (Left): DEM. (Right): Difference with analytical function (Example 1).
Modelling 07 00010 g0a8
Figure A9. Irregular 100 points, seed 3. (Left): DEM. (Right): Difference with analytical function (Example 1).
Figure A9. Irregular 100 points, seed 3. (Left): DEM. (Right): Difference with analytical function (Example 1).
Modelling 07 00010 g0a9
Figure A10. Irregular 196 points, seed 1. (Left): DEM. (Right): Difference with analytical function (Example 1).
Figure A10. Irregular 196 points, seed 1. (Left): DEM. (Right): Difference with analytical function (Example 1).
Modelling 07 00010 g0a10
Figure A11. Irregular 196 points, seed 2. (Left): DEM. (Right): Difference with analytical function (Example 1).
Figure A11. Irregular 196 points, seed 2. (Left): DEM. (Right): Difference with analytical function (Example 1).
Modelling 07 00010 g0a11
Figure A12. Irregular 196 points, seed 3. (Left): DEM. (Right): Difference with analytical function (Example 1).
Figure A12. Irregular 196 points, seed 3. (Left): DEM. (Right): Difference with analytical function (Example 1).
Modelling 07 00010 g0a12

Appendix A.2. Example 2: Synthetic Function 2

Figure A13. Regular 49 points. (Left): DEM. (Right): Difference with analytical function (Example 2).
Figure A13. Regular 49 points. (Left): DEM. (Right): Difference with analytical function (Example 2).
Modelling 07 00010 g0a13
Figure A14. Regular 100 points. (Left): DEM. (Right): Difference with analytical function (Example 2).
Figure A14. Regular 100 points. (Left): DEM. (Right): Difference with analytical function (Example 2).
Modelling 07 00010 g0a14
Figure A15. Regular 196 points. (Left): DEM. (Right): Difference with analytical function (Example 2).
Figure A15. Regular 196 points. (Left): DEM. (Right): Difference with analytical function (Example 2).
Modelling 07 00010 g0a15
Figure A16. Irregular 49 points, seed 1. (Left): DEM. (Right): Difference with analytical function (Example 2).
Figure A16. Irregular 49 points, seed 1. (Left): DEM. (Right): Difference with analytical function (Example 2).
Modelling 07 00010 g0a16
Figure A17. Irregular 49 points, seed 2. (Left): DEM. (Right): Difference with analytical function (Example 2).
Figure A17. Irregular 49 points, seed 2. (Left): DEM. (Right): Difference with analytical function (Example 2).
Modelling 07 00010 g0a17
Figure A18. Irregular 49 points, seed 3. (Left): DEM. (Right): Difference with analytical function (Example 2).
Figure A18. Irregular 49 points, seed 3. (Left): DEM. (Right): Difference with analytical function (Example 2).
Modelling 07 00010 g0a18
Figure A19. Irregular 100 points, seed 1. (Left): DEM. (Right): Difference with analytical function (Example 2).
Figure A19. Irregular 100 points, seed 1. (Left): DEM. (Right): Difference with analytical function (Example 2).
Modelling 07 00010 g0a19
Figure A20. Irregular 100 points, seed 2. (Left): DEM. (Right): Difference with analytical function (Example 2).
Figure A20. Irregular 100 points, seed 2. (Left): DEM. (Right): Difference with analytical function (Example 2).
Modelling 07 00010 g0a20
Figure A21. Irregular 100 points, seed 3. (Left): DEM. (Right): Difference with analytical function (Example 2).
Figure A21. Irregular 100 points, seed 3. (Left): DEM. (Right): Difference with analytical function (Example 2).
Modelling 07 00010 g0a21
Figure A22. Irregular 196 points, seed 1. (Left): DEM. (Right): Difference with analytical function (Example 2).
Figure A22. Irregular 196 points, seed 1. (Left): DEM. (Right): Difference with analytical function (Example 2).
Modelling 07 00010 g0a22
Figure A23. Irregular 196 points, seed 2. (Left): DEM. (Right): Difference with analytical function (Example 2).
Figure A23. Irregular 196 points, seed 2. (Left): DEM. (Right): Difference with analytical function (Example 2).
Modelling 07 00010 g0a23
Figure A24. Irregular 196 points, seed 3. (Left): DEM. (Right): Difference with analytical function (Example 2).
Figure A24. Irregular 196 points, seed 3. (Left): DEM. (Right): Difference with analytical function (Example 2).
Modelling 07 00010 g0a24

Appendix A.3. Example 3: Real Terrain

Figure A25. Regular 49 points. (Left): DEM. (Right): Difference with high-res DEM (Example 3).
Figure A25. Regular 49 points. (Left): DEM. (Right): Difference with high-res DEM (Example 3).
Modelling 07 00010 g0a25
Figure A26. Regular 100 points. (Left): DEM. (Right): Difference with high-res DEM (Example 3).
Figure A26. Regular 100 points. (Left): DEM. (Right): Difference with high-res DEM (Example 3).
Modelling 07 00010 g0a26
Figure A27. Regular 196 points. (Left): DEM. (Right): Difference with high-res DEM (Example 3).
Figure A27. Regular 196 points. (Left): DEM. (Right): Difference with high-res DEM (Example 3).
Modelling 07 00010 g0a27
Figure A28. Regular 400 points. (Left): DEM. (Right): Difference with high-res DEM (Example 3).
Figure A28. Regular 400 points. (Left): DEM. (Right): Difference with high-res DEM (Example 3).
Modelling 07 00010 g0a28
Figure A29. Irregular 49 points, seed 1. (Left): DEM. (Right): Difference with high-res DEM (Example 3).
Figure A29. Irregular 49 points, seed 1. (Left): DEM. (Right): Difference with high-res DEM (Example 3).
Modelling 07 00010 g0a29
Figure A30. Irregular 49 points, seed 2. (Left): DEM. (Right): Difference with high-res DEM (Example 3).
Figure A30. Irregular 49 points, seed 2. (Left): DEM. (Right): Difference with high-res DEM (Example 3).
Modelling 07 00010 g0a30
Figure A31. Irregular 49 points, seed 3. (Left): DEM. (Right): Difference with high-res DEM (Example 3).
Figure A31. Irregular 49 points, seed 3. (Left): DEM. (Right): Difference with high-res DEM (Example 3).
Modelling 07 00010 g0a31
Figure A32. Irregular 100 points, seed 1. (Left): DEM. (Right): Difference with high-res DEM (Example 3).
Figure A32. Irregular 100 points, seed 1. (Left): DEM. (Right): Difference with high-res DEM (Example 3).
Modelling 07 00010 g0a32
Figure A33. Irregular 100 points, seed 2. (Left): DEM. (Right): Difference with high-res DEM (Example 3).
Figure A33. Irregular 100 points, seed 2. (Left): DEM. (Right): Difference with high-res DEM (Example 3).
Modelling 07 00010 g0a33
Figure A34. Irregular 100 points, seed 3. (Left): DEM. (Right): Difference with high-res DEM (Example 3).
Figure A34. Irregular 100 points, seed 3. (Left): DEM. (Right): Difference with high-res DEM (Example 3).
Modelling 07 00010 g0a34
Figure A35. Irregular 196 points, seed 1. (Left): DEM. (Right): Difference with high-res DEM (Example 3).
Figure A35. Irregular 196 points, seed 1. (Left): DEM. (Right): Difference with high-res DEM (Example 3).
Modelling 07 00010 g0a35
Figure A36. Irregular 196 points, seed 2. (Left): DEM. (Right): Difference with high-res DEM (Example 3).
Figure A36. Irregular 196 points, seed 2. (Left): DEM. (Right): Difference with high-res DEM (Example 3).
Modelling 07 00010 g0a36
Figure A37. Irregular 196 points, seed 3. (Left): DEM. (Right): Difference with high-res DEM (Example 3).
Figure A37. Irregular 196 points, seed 3. (Left): DEM. (Right): Difference with high-res DEM (Example 3).
Modelling 07 00010 g0a37
Figure A38. Irregular 400 points, seed 1. (Left): DEM. (Right): Difference with high-res DEM (Example 3).
Figure A38. Irregular 400 points, seed 1. (Left): DEM. (Right): Difference with high-res DEM (Example 3).
Modelling 07 00010 g0a38
Figure A39. Irregular 400 points, seed 2. (Left): DEM. (Right): Difference with high-res DEM (Example 3).
Figure A39. Irregular 400 points, seed 2. (Left): DEM. (Right): Difference with high-res DEM (Example 3).
Modelling 07 00010 g0a39
Figure A40. Irregular 400 points, seed 3. (Left): DEM. (Right): Difference with high-res DEM (Example 3).
Figure A40. Irregular 400 points, seed 3. (Left): DEM. (Right): Difference with high-res DEM (Example 3).
Modelling 07 00010 g0a40

References

  1. Shepard, D. A two-dimensional interpolation function for irregularly spaced data. In Proceedings of the 23rd ACM National Conference, New York, NY, USA, 27–29 August 1968; pp. 517–524. [Google Scholar]
  2. Krige, D.G. A statistical approach to some basic mine valuation problems on the Witwatersrand. J. Chem. Metall. Min. Soc. S. Afr. 1951, 52, 119–139. [Google Scholar]
  3. Matheron, G. Principles of geostatistics. Econ. Geol. 1963, 58, 1246–1266. [Google Scholar] [CrossRef]
  4. Frank, E. Surface fitting with irregularly spaced data using splines under tension. Comput. Graph. Image Process. 1979, 10, 171–184. [Google Scholar]
  5. Bookstein, F.L. Principal warps: Thin-plate splines and the decomposition of deformations. IEEE Trans. Pattern Anal. Mach. Intell. 1989, 11, 567–585. [Google Scholar] [CrossRef]
  6. Wahba, G. Spline Models for Observational Data; SIAM: Philadelphia, PA, USA, 1990. [Google Scholar]
  7. Franke, R. Scattered data interpolation: Tests of some methods. Math. Comput. 1982, 38, 181–200. [Google Scholar]
  8. Li, J.; Heap, A.D. Spatial interpolation methods applied in the environmental sciences: A review. Environ. Model. Softw. 2014, 53, 173–189. [Google Scholar] [CrossRef]
  9. Buhmann, M.D. Radial Basis Functions: Theory and Implementations; Cambridge University Press: Cambridge, UK, 2003. [Google Scholar]
  10. Zhu, X.; Zhang, Y.; Li, Z. Deep learning for digital elevation model reconstruction from sparse data. Isprs J. Photogramm. Remote Sens. 2021, 178, 168–184. [Google Scholar]
  11. Li, Y.; Huang, R.; Chen, J. DEM interpolation using multi-scale convolutional neural networks. Remote Sens. 2022, 14, 612. [Google Scholar]
  12. Bathe, K.-J. Finite Element Procedures; Prentice Hall: Englewood Cliffs, NJ, USA, 1996. [Google Scholar]
  13. Conde López, E.; Salete Casino, E.; Flores Escribano, J.; Vargas Ureña, A. Application of Finite Element Method to Create a Digital Elevation Model. Mathematics 2023, 11, 1522. [Google Scholar] [CrossRef]
  14. Chen, Y.; Liu, Z.; Wu, J. A Poisson-based approach for surface reconstruction from point clouds. Comput. Graph. 2014, 38, 181–192. [Google Scholar]
  15. Xie, Z.; Wang, J.; Liu, Q.; Li, Y. A finite element approach for surface reconstruction from scattered data. Comput.-Aided Des. 2018, 102, 1–11. [Google Scholar]
  16. Zhang, W.; Montgomery, D.R. Digital elevation model grid size, landscape representation, and hydrologic simulations. Water Resour. Res. 2005, 41, W05002. [Google Scholar] [CrossRef]
  17. Zienkiewicz, O.C.; Taylor, R.L. The Finite Element Method. Volume 1: Basic Formulation and Linear Problems; McGraw–Hill: London, UK, 1989. [Google Scholar]
  18. Thompson, J.F.; Warsi, Z.U.A.; Mastin, C.W. Numerical Grid Generation: Foundations and Applications; North–Holland: New York, NY, USA, 1985. [Google Scholar]
  19. Persson, P.-O.; Strang, G. A simple mesh generator in MATLAB. SIAM Rev. 2004, 46, 329–345. [Google Scholar] [CrossRef]
  20. Shewchuk, J.R. Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator. In Applied Computational Geometry: Towards Geometric Engineering; Lin, M.C., Manocha, D., Eds.; Lecture Notes in Computer Science; Springer: Berlin/Heidelberg, Germany, 1996; pp. 203–222. [Google Scholar]
  21. Remacle, J.-F.; Lambrechts, J.; Geuzaine, C.; Marchandise, E. Gmsh: A 3-D finite element mesh generator with built-in pre- and post-processing facilities. Int. J. Numer. Methods Eng. 2010, 79, 1309–1331. [Google Scholar]
  22. Chen, L.; Xu, J. Optimal Delaunay Triangulations. J. Comput. Math. 2019, 37, 905–930. [Google Scholar]
  23. Lee, N. geomdl: NURBS-Python (geomdl) 5.x; GitHub Repository, 2022. Available online: https://github.com/orbingol/NURBS-Python (accessed on 7 November 2025).
  24. Virtanen, P.; Gommers, R.; Oliphant, T.E.; Haberland, M.; Reddy, T.; Cournapeau, D.; Burovski, E.; Peterson, P.; Weckesser, W.; Bright, J.; et al. SciPy 1.0: Fundamental Algorithms for Scientific Computing in Python. Nat. Methods 2020, 17, 261–272. [Google Scholar] [CrossRef] [PubMed]
  25. Harris, C.R.; Millman, K.J.; van der Walt, S.J.; Gommers, R.; Virtanen, P.; Cournapeau, D.; Wieser, E.; Taylor, J.; Berg, S.; Smith, N.J.; et al. Array Programming with NumPy. Nature 2020, 585, 357–362. [Google Scholar] [CrossRef] [PubMed]
Figure 1. Example 1: z ( x , y ) = sin ( π x ) sin ( π y ) .
Figure 1. Example 1: z ( x , y ) = sin ( π x ) sin ( π y ) .
Modelling 07 00010 g001
Figure 2. Example 2: z ( x , y ) = x 2 + y 2 + 4 , if x < 0.5 ; x 2 + y 2 , if x 0.5 .
Figure 2. Example 2: z ( x , y ) = x 2 + y 2 + 4 , if x < 0.5 ; x 2 + y 2 , if x 0.5 .
Modelling 07 00010 g002
Figure 3. (Left): Satellite photograph of the terrain. (Right): Original DEM.
Figure 3. (Left): Satellite photograph of the terrain. (Right): Original DEM.
Modelling 07 00010 g003
Figure 4. Regular 196 points. (Left): DEM. (Right): Difference with analytical function (Example 1).
Figure 4. Regular 196 points. (Left): DEM. (Right): Difference with analytical function (Example 1).
Modelling 07 00010 g004
Figure 5. Irregular 196 points, seed 1. (Left): DEM. (Right): Difference with analytical function (Example 1).
Figure 5. Irregular 196 points, seed 1. (Left): DEM. (Right): Difference with analytical function (Example 1).
Modelling 07 00010 g005
Figure 6. Regular 196 points. (Left): DEM. (Right): Difference with analytical function (Example 2).
Figure 6. Regular 196 points. (Left): DEM. (Right): Difference with analytical function (Example 2).
Modelling 07 00010 g006
Figure 7. Irregular 196 points, seed 1. (Left): DEM. (Right): Difference with analytical function (Example 2).
Figure 7. Irregular 196 points, seed 1. (Left): DEM. (Right): Difference with analytical function (Example 2).
Modelling 07 00010 g007
Figure 8. Regular 100 points. (Left): DEM. (Right): Difference with high-res DEM (Example 3).
Figure 8. Regular 100 points. (Left): DEM. (Right): Difference with high-res DEM (Example 3).
Modelling 07 00010 g008
Figure 9. Regular 400 points. (Left): DEM. (Right): Difference with high-res DEM (Example 3).
Figure 9. Regular 400 points. (Left): DEM. (Right): Difference with high-res DEM (Example 3).
Modelling 07 00010 g009
Figure 10. Irregular 100 points, seed 1. (Left): DEM. (Right): Difference with high-res DEM (Example 3).
Figure 10. Irregular 100 points, seed 1. (Left): DEM. (Right): Difference with high-res DEM (Example 3).
Modelling 07 00010 g010
Figure 11. Irregular 400 points, seed 1. (Left): DEM. (Right): Difference with high-res DEM (Example 3).
Figure 11. Irregular 400 points, seed 1. (Left): DEM. (Right): Difference with high-res DEM (Example 3).
Modelling 07 00010 g011
Figure 12. Irregular 196 points, seed 1. DEM obtained with RBF-NURBS.
Figure 12. Irregular 196 points, seed 1. DEM obtained with RBF-NURBS.
Modelling 07 00010 g012
Table 1. Comparison between the three interpolation methodologies analysed in this study.
Table 1. Comparison between the three interpolation methodologies analysed in this study.
AspectThin-Plate FEMPoisson FEMRBF–NURBS
Governing equationBiharmonic ( 4 w = q / D )Poisson ( 2 T = 0 )Geometric interpolation
(RBF + tensor-product NURBS)
Order of derivativesFourth-orderSecond-orderVariable (depends on degree),
typically cubic
Continuity of shape functions C 1 required C 0 sufficient C 2 typical
Smoothness controlMinimisation of curvatureMinimisation of gradient normLocal geometric control
(bending energy)(harmonic energy)via spline basis
Computational costHigh (more degrees ofLow (sparse system,Very high (dense RBF system,
freedom)scalable solvers) O ( n 3 ) + NURBS fitting)
Physical analogyThin elastic plateSteady-state heatPurely geometric
in bendingconduction(no physics)
Model parametersElastic modulus ENone (parameter-freeControl grid resolution
(controls rigidity)formulation)and RBF smoothness
Robustness to irregular dataHighHighModerate
Typical applicationPrecision DEMFast DEM generation/Surface fitting in
generationdata fusionCAD or design
Table 2. Comparison between the Poisson and thin-plate FEM formulations.
Table 2. Comparison between the Poisson and thin-plate FEM formulations.
AspectPoisson FEMThin-Plate FEM
Differential equation orderSecond orderFourth order
Continuity requirement C 0 C 1
Type of finite elementLinear or quadratic elementsKirchhoff–Love or Argyris plate elements
Degrees of freedom per node13
Stiffness matrix complexityDepends on first derivativesDepends on second derivatives
of shape functionsof shape functions
Table 3. Maximum and mean deviations (in parentheses) for the regular point distribution in both models (Example 1).
Table 3. Maximum and mean deviations (in parentheses) for the regular point distribution in both models (Example 1).
Number ofRegular Distribution
Points Poisson RBF-NURBS
490.615 (0.212)0.057 (0.019)
1000.397 (0.139)0.030 (0.006)
1960.247 (0.086)0.016 (0.002)
Table 4. Maximum and mean deviations (in parentheses) for the random point distribution (Seeds 1–3) in both models (Example 1).
Table 4. Maximum and mean deviations (in parentheses) for the random point distribution (Seeds 1–3) in both models (Example 1).
Number ofSeed 1Seed 2Seed 3
Points Poisson RBF-NURBS Poisson RBF-NURBS Poisson RBF-NURBS
490.652 (0.199)0.432 (0.042)0.697 (0.214)0.424 (0.053)0.600 (0.199)0.584 (0.052)
1000.520 (0.152)0.256 (0.018)0.461 (0.149)0.365 (0.023)0.543 (0.163)0.285 (0.024)
1960.396 (0.112)2.541 (0.039)0.401 (0.099)0.128 (0.009)0.420 (0.104)0.174 (0.007)
Table 5. Maximum and mean deviations (in parentheses) for the regular point distribution in both models (Example 2).
Table 5. Maximum and mean deviations (in parentheses) for the regular point distribution in both models (Example 2).
Number ofRegular Distribution
Points Poisson RBF-NURBS
493.579 (0.907)3.140 (0.314)
1002.806 (0.564)2.587 (0.186)
1963.331 (0.372)3.393 (0.161)
Table 6. Maximum and mean deviations (in parentheses) for the random point distribution (Seeds 1–3) in both models (Example 2).
Table 6. Maximum and mean deviations (in parentheses) for the random point distribution (Seeds 1–3) in both models (Example 2).
Number ofSeed 1Seed 2Seed 3
Points Poisson RBF-NURBS Poisson RBF-NURBS Poisson RBF-NURBS
493.613 (0.876)4.251 (0.436)8.606 (1.202)3.845 (0.374)5.689 (1.054)3.950 (0.320)
1003.558 (0.642)3.890 (0.269)4.970 (0.712)3.705 (0.205)6.260 (0.797)3.887 (0.222)
1963.266 (0.424)4.377 (0.186)3.202 (0.456)3.302 (0.145)3.598 (0.468)4.249 (0.151)
Table 7. Maximum and mean deviations (in parentheses) in meters for the regular point distribution in the three models (Example 3).
Table 7. Maximum and mean deviations (in parentheses) in meters for the regular point distribution in the three models (Example 3).
Number ofRegular Distribution
Points Poisson Thin-Plate RBF-NURBS
4921.1460 (5.883)25.365 (2.790)19.237 (2.596)
10013.960 (3.880)18.961 (1.279)19.324 (1.137)
19610.687 (2.733)14.162 (0.762)15.642 (0.699)
4007.675 (1.516)4.857 (0.344)4.981 (0.349)
Table 8. Maximum and mean deviations (in parentheses) in meters for the random point distribution (Seeds 1–3) in the three models (Example 3).
Table 8. Maximum and mean deviations (in parentheses) in meters for the random point distribution (Seeds 1–3) in the three models (Example 3).
Number ofSeed 1
Points Poisson Thin-Plate RBF-NURBS
4924.439 (5.250)39.838 (3.573)52.106 (3.659)
10016.069 (4.325)18.517 (1.885)18.611 (1.759)
19613.877 (2.985)11.058 (1.011)8.339 (0.978)
40011.932 (1.911)8.389 (0.582)6.081 (0.582)
Number ofSeed 2
PointsPoissonThin-PlateRBF-NURBS
4928.348 (6.127)41.930 (3.785)57.876 (3.977)
10019.776 (4.341)18.114 (1.768)11.747 (1.647)
19612.792 (2.938)10.929 (0.984)12.822 (0.935)
4009.953 (1.798)6.242 (0.512)8.722 (0.507)
Number ofSeed 3
PointsPoissonThin-PlateRBF-NURBS
4919.213 (5.775)17.980 (2.816)15.302 (2.558)
10015.670 (4.211)8.316 (1.397)9.073 (1.407)
19611.704 (2.714)12.496 (0.938)14.306 (0.941)
40011.440 (1.992)6.334 (0.537)6.333 (0.530)
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Conde López, E.; Flores Escribano, J.; Salete Casino, E.; Vargas Ureña, A. Generation of Digital Elevation Models Using the Poisson Equation and the Finite Element Method. Modelling 2026, 7, 10. https://doi.org/10.3390/modelling7010010

AMA Style

Conde López E, Flores Escribano J, Salete Casino E, Vargas Ureña A. Generation of Digital Elevation Models Using the Poisson Equation and the Finite Element Method. Modelling. 2026; 7(1):10. https://doi.org/10.3390/modelling7010010

Chicago/Turabian Style

Conde López, Eduardo, Jesús Flores Escribano, Eduardo Salete Casino, and Antonio Vargas Ureña. 2026. "Generation of Digital Elevation Models Using the Poisson Equation and the Finite Element Method" Modelling 7, no. 1: 10. https://doi.org/10.3390/modelling7010010

APA Style

Conde López, E., Flores Escribano, J., Salete Casino, E., & Vargas Ureña, A. (2026). Generation of Digital Elevation Models Using the Poisson Equation and the Finite Element Method. Modelling, 7(1), 10. https://doi.org/10.3390/modelling7010010

Article Metrics

Back to TopTop