Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2608.20872

Point Cloud Quality for Meshfree Methods

Mohsen Abdolahzadeh·Oleg Davydov·Isabel Michel·Pratik Suchde
View original source ↗Read source document ↗Export metadata ↓

Abstract

Mesh quality is very well studied and widely used to quantify a good mesh. In contrast, a systematic study of quality of meshfree point clouds is lacking. This gap makes it difficult to substantiate the common claim that generating a good-quality point cloud is easier than generating a good mesh. Various definitions of point cloud quality have been proposed, some of which have theoretical significance for proving convergence and error bounds, while others are used in computational studies. In this work, we compare and contrast existing point cloud quality metrics and introduce a few new ones. We conduct extensive numerical tests with a meshfree collocation method across a wide range of scenarios, including both elliptic and hyperbolic equations, 2D and 3D domains, and variations in parameters of the numerical method. Based on these tests, we assess which quality metrics best correlate with numerical error. Our findings reveal six metrics that consistently serve as reliable indicators of point cloud quality, while also demonstrating that several widely used metrics are poor predictors of accuracy.

Explore related subjects

math.NAcs.CEcs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mohsen Abdolahzadeh, Oleg Davydov, Isabel Michel, Pratik Suchde. 2026-08-21. Point Cloud Quality for Meshfree Methods. https://arxiv.org/abs/2608.20872

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Fully spectral scheme for the linear BGK equation on the whole space

In this article, we design a fully spectral method in both space and velocity for a linear inhomogeneous kinetic equation with mass, momentum and energy conservation. We focus on the linear BGK equation with a confinement potential $Φ$, even if the method could be applied to different collision operators. It is based upon the projection on Hermite polynomials in velocity and orthonormal polynomials with respect to the weight $e^{-$Φ$}$ in space. The potential $Φ$ is assumed to be a polynomial. It is, to the author's knowledge, the first scheme which preserves hypocoercive behavior in addition to the conservation laws. These different properties are illustrated numerically on both quadratic and double well potential.

math.NA↗
arXiv2026

Inverse inequalities for kernel-based approximation on bounded domains and Riemannian manifolds

This paper establishes inverse inequalities for kernel-based approximation spaces defined on bounded Lipschitz domains in $\mathbb{R}^d$ and compact Riemannian manifolds. While inverse inequalities are well-studied for polynomial spaces, their extension to kernel-based trial spaces poses significant challenges. For bounded Lipschitz domains, we extend prior Bernstein inequalities, which only apply to a limited range of Sobolev orders, to the full range of lower and upper orders, and derive Nikolskii inequalities that bound $L_\infty$ norms by $L_2$ norms. For compact Riemannian manifolds, we focus on restricted kernels, which are defined as the restriction of positive definite kernels from the ambient Euclidean space to the manifold, and prove their counterparts.

math.NA↗
arXiv2026

Error Estimates for Hyperbolic Scaling Limits of Linear Kinetic Models on Networks

This paper studies linear discrete kinetic models on networks and their asymptotic behavior in the small Knudsen number limit. For coupling conditions at an n-edge junction under a symmetric formulation, we introduce a change of variables that reformulates the system into n independent initial-boundary value problems. The asymptotic expansions are then constructed and rigorously justified by deriving an error estimate based on the energy method.

math.NA↗