Methods and Algorithms for Scientific Computing

Fast Variable Density Node Generation on Parametric Surfaces with Application to Mesh-Free Methods


Domain discretization is considered a dominant part of solution procedures for solving partial differential equations. It is widely accepted that mesh generation is among the most cumbersome parts of the finite element method analysis and often requires human assistance, especially in complex three-dimensional geometries. When using alternative mesh-free approaches, the problem of mesh generation is simplified to the problem of positioning nodes, a much simpler task, though still not trivial. In this paper we present an algorithm for generation of nodes on arbitrary $d$-dimensional surfaces. This algorithm complements a recently published algorithm for generation of nodes in domain interiors and represents another step toward a fully automated dimension-independent solution procedure for solving partial differential equations. The proposed algorithm generates nodes with variable density on surfaces parameterized over arbitrary parametric domains in a dimension-independent way in $O(N\log N)$ time. It is also compared with existing algorithms for generation of surface nodes for mesh-free methods in terms of quality and execution time.


  1. node generation algorithms
  2. variable density discretizations
  3. meshless methods for PDEs
  4. RBF-FD
  5. Poisson disk sampling

MSC codes

  1. 65D99
  2. 65N99
  3. 65Y20
  4. 68Q25

Get full access to this article

View all available purchase options and get full access to this article.


V. Bayona, N. Flyer, B. Fornberg, and G. A. Barnett, On the role of polynomials in RBF-FD approximations: II. Numerical solution of elliptic PDEs, J. Comput. Phys., 332 (2017), pp. 257--273,
J. L. Blanco and P. K. Rai, nanoflann: a C++ header-only fork of FLANN, a library for nearest neighbor (NN) with KD-trees, 2014,
R. Bridson, Fast Poisson disk sampling in arbitrary dimensions, in SIGGRAPH sketches, 2007, p. 22,
J. C. Carr, R. K. Beatson, B. C. McCallum, W. R. Fright, T. J. McLennan, and T. J. Mitchell, Smooth surface reconstruction from noisy range data, in Proceedings of the 1st international conference on Computer graphics and interactive techniques in Australasia and South East Asia, ACM, 2003, pp. 119--ff.
Data announcement 88-MGG-02, Digital relief of the surface of the Earth, NOAA, National Geophysical Data Center, Boulder, Colorado, 1988,
M. Depolli, G. Kosec, and J. Slak, Parallelizing a node positioning algorithm for meshless methods, in ParNum 2019 book of abstracts, 13th Parallel numerics workshop, Dubrovnik, Croatia, University of Zagreb, 2019,
P. Diaconis, S. Holmes, M. Shahshahani, et al., Sampling from a manifold, in Advances in Modern Statistical Theory and Applications: a Festschrift in Honor of Morris L. Eaton, Institute of Mathematical Statistics, 2013, pp. 102--125.
U. Duh, G. Kosec, and J. Slak, Standalone implementation of the proposed algorithm,
N. Flyer, B. Fornberg, V. Bayona, and G. A. Barnett, On the role of polynomials in RBF-FD approximations: I. Interpolation and accuracy, J. Comput. Phys., 321 (2016), pp. 21--38,
B. Fornberg and N. Flyer, Fast generation of 2-D node distributions for mesh-free PDE discretizations, Comput. & Math. Appl., 69 (2015), pp. 531--544,
X. D. Gu, W. Zeng, F. Luo, and S.-T. Yau, Numerical computation of surface conformal mappings, Comput. Methods Function Theory, 11 (2012), pp. 747--787,
G. Guennebaud, B. Jacob, et al., Eigen v3, 2010,
D. P. Hardin, T. Michaels, and E. B. Saff, A comparison of popular point configurations on $s^2$, Dolomites Res. Notes Approx., 9 (2016).
D. P. Hardin and E. B. Saff, Discretizing manifolds via minimum energy points, Not. AMS, 51 (2004), pp. 1186--1194.
N. P. Kopytov and E. A. Mityushov, Uniform distribution of points on hypersurfaces: Simulation of random equiprobable rotations, Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp\textquotesingleyuternye Nauki, 25 (2015), pp. 29--35,
G. Kosec, A local numerical solution of a fluid-flow problem on an irregular domain, Adv. Eng. Software, 120 (2018), pp. 36--44,
T. S. Lau, S. H. Lo, and C. K. Lee, Generation of quadrilateral mesh over analytical curved surfaces, Finite Elements Anal. Design, 27 (1997), pp. 251--272,
N. Litke, A. Levin, and P. Schröder, Fitting subdivision surfaces, in Proceedings of the Conference on Visualization'01, IEEE Computer Society, 2001, pp. 319--324.
A. W. Moore, An introductory tutorial on kd-trees, phdthesis 209, Computer Laboratory, University of Cambridge, 1991,
L. Piegl and W. Tiller, The NURBS book, Springer Science & Business Media, New York, 2012.
V. Shankar, R. M. Kirby, and A. L. Fogelson, Robust node generation for meshfree discretizations on irregular domains and surfaces, SIAM J. Sci. Comput., 40 (2018), pp. 2584--2608,
K. Shimada and D. C. Gossard, Automatic triangular mesh generation of trimmed parametric surfaces for finite element analysis, Computer Aided Geometric Design, 15 (1998), pp. 199--222,
J. Slak and G. Kosec, On generation of node distributions for meshless PDE discretizations, SIAM J. Sci. Comput., 41 (2019), pp. A3202--A3229,
I. Stroud, Boundary representation modelling techniques, Springer Science & Business Media, New York, 2006.
G. Turk, Texture synthesis on surfaces, in Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques, ACM, 2001, pp. 347--354,
K. van der Sande and B. Fornberg, Fast variable density 3-D node generation, preprint, arXiv:1906.00636 [math.NA], (2019).
O. Vlasiuk, T. Michaels, N. Flyer, and B. Fornberg, Fast high-dimensional node generation with variable density, Comput. Math. Appl., 76 (2018), pp. 1739--1757,
H. Wendland, Scattered data approximation, vol. 17, Cambridge University Press, 2004.
R. Zamolo and E. Nobile, Two algorithms for fast 2d node generation: Application to rbf meshless discretization of diffusion problems and image halftoning, Comput. Math. Appl., 75 (2018), pp. 4305--4321,
H.-K. Zhao, S. Osher, and R. Fedkiw, Fast surface reconstruction using the level set method, in Proceedings of the IEEE Workshop on Variational and Level Set Methods in Computer Vision, IEEE, 2001, pp. 194--201.

Information & Authors


Published In

cover image SIAM Journal on Scientific Computing
SIAM Journal on Scientific Computing
Pages: A980 - A1000
ISSN (online): 1095-7197


Submitted: 16 March 2020
Accepted: 23 November 2020
Published online: 15 March 2021


  1. node generation algorithms
  2. variable density discretizations
  3. meshless methods for PDEs
  4. RBF-FD
  5. Poisson disk sampling

MSC codes

  1. 65D99
  2. 65N99
  3. 65Y20
  4. 68Q25



Funding Information

Young Researcher Program : PR-08346
Fonds Wetenschappelijk Onderzoek : G018916N
Javna Agencija za Raziskovalno Dejavnost RS : P2-0095

Metrics & Citations



If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.

Cited By







Copy the content Link

Share with email

Email a colleague

Share on social media

The SIAM Publications Library now uses SIAM Single Sign-On for individuals. If you do not have existing SIAM credentials, create your SIAM account