Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.28098

Estimating the intrinsic error of 3D point clouds acquisition techniques: A comparative study on instruments of the violin family

Philémon Beghin·Jean-Philippe Échard·Anthony Peeters·Arnaud Schenkel·Anne-Emmanuelle Ceulemans·François Glineur
View original source ↗Read source document ↗Export metadata ↓

Abstract

This study compares ten digital 3D acquisition techniques applied to violin family instrument plates, assessing their accuracy and relevance for scientific and cultural heritage applications. Evaluated methods include two photogrammetric workflows, medical and industrial computed tomography, terrestrial laser scanning, two structured-light configurations (blue light and infrared), and three consumer-grade iPad Pro approaches: TrueDepth scanning and LiDAR using two different applications. The methods were applied to five historical instruments from the "Musical Instruments Museum" (Brussels) and the "Musée de la Musique" (Paris). Since no geometric ground truth is available, accuracy is assessed through systematic pairwise point-to-plane comparisons of the resulting point clouds. These comparisons are jointly analysed to estimate the intrinsic error of each technique (i.e. the expected discrepancy between the model and the true but unknown geometry) without designating any technique as reference. Results are discussed with respect to intended uses, offering recommendations for techniques depending on the dedicated objectives.

Explore related subjects

cs.CG

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Philémon Beghin, Jean-Philippe Échard, Anthony Peeters, Arnaud Schenkel, Anne-Emmanuelle Ceulemans, François Glineur. 2026-10-20. Estimating the intrinsic error of 3D point clouds acquisition techniques: A comparative study on instruments of the violin family. https://arxiv.org/abs/2610.28098

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

KEEP EXPLORING

Related papers

arXiv2026

Pinch-Free Orientations of Polyomino Grid Graphs

We study lattice-based collective construction of a target polyomino on the integer grid, where robots place unit square blocks subject to two physical constraints: the partial structure must remain connected at all times, and no placement may create an unfillable one-cell gap. We present a wavefront sweep algorithm that computes a dependency structure satisfying the local conditions required for safe assembly. Given a list of n cells sorted lexicographically by coordinates, the orientation can be computed in O(n) time using O(n) auxiliary space.

cs.CG↗
arXiv2026

The Stretch Factor of Planar Delaunay Triangulations Is Less Than 1.5949

Delaunay triangulations are the classical plane spanners: the shortest path between two vertices is at most a constant times as long as the segment between them. Determining the smallest such constant, the worst-case stretch factor of Delaunay triangulations, is a long-standing open problem; the best known lower and upper bounds were 1.5932, due to Xia and Zhang, and 1.998, due to Xia. We focus on the upper bound. Xia's analysis replaces the triangulation by a chain of disks and compares the length along the whole chain with the straight-line distance at once, by induction with a potential function. We propose a new framework, progress accounting, which compares the contribution of each single disk to the chain length with the progress of that disk along the straight line. This turns the global analysis into a local one, which can be made very precise. The key to the local analysis is our pencil lemma: it shows that the comparison for each disk needs only four angles, whatever the rest of the chain looks like. The resulting conditions on one function of four angles are verified by a computer-assisted proof in exact rational and interval arithmetic; corner lemmas handle the degenerate configurations where the conditions are tight. As a result, every Delaunay triangulation of a finite planar point set has stretch factor less than 1.5949. The gap to the best known lower bound shrinks from about 0.405 to less than 0.0017, by a factor of more than 200. This also shows that every finite planar point set has a plane spanner with stretch factor less than 1.5949, improving the previous bound of 1.998.

cs.CG↗
arXiv2026

FPTAS for Polygonal Multi-Robot Motion Planning

We study multi-robot motion planning in a polygonal environment with polygonal robots. The setting of the problem consists of a polygonal domain $\mathcal{W}$ with $n$ vertices and $k$ robots $R_1,\dots,R_k$ translating in $\mathcal{W}$ each of which is represented by a polygon of constant complexity. Given a source configuration $\mathbf{s}$ and a target configuration $\mathbf{t}$ of the robots in $\mathcal{W}$, the goal of the problem is to find a collision-free motion plan from $\mathbf{s}$ to $\mathbf{t}$ that is shortest with respect to some cost function. We present the first fully polynomial-time approximation schemes (FPTAS) for motion planning with any fixed number $k$ of robots, under the min-sum objective, the min-max objective, and the min-makespan objective. Here, the min-sum variant aims to minimize the total traveling distance of all robots, the min-max variant aims to minimize the maximum traveling distance of a single robot, and the min-makespan variant aims to minimize the total time cost under the assumption that all robots move with a maximum speed $1$. The algorithm directly generalizes to the problem in any fixed dimension $d$, with a polytope environment and polytope robots. Our result settles an open question of Agarwal, Halperin, Sharir, Steiger [SODA'24] and Agarwal, Holmgren, Steiger [SODA'26], who gave an FPTAS for $k=2$ unit-square robots and a bicriteria-approximation algorithm for a fixed number $k$ of unit-square or unit-disk robots, respectively. Compared to the previous results, our algorithm is substantially simpler.

cs.CG↗