Papers › On the Error of Random Sampling: Uniformly Distributed Random Points on Parametric Curves
On the Error of Random Sampling: Uniformly Distributed Random Points on Parametric Curves
Apostolos Chalkis, Christina Katsamaki, Josué Tonelli-Cueto
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Given a parametric polynomial curve γ:[a,b]→ℝⁿ, how can we sample a random point 𝔵∈im(γ) in such a way that it is distributed uniformly with respect to the arc-length? Unfortunately, we cannot sample exactly such a point-even assuming we can perform exact arithmetic operations. So we end up with the following question: how does the method we choose affect the quality of the approximate sample we obtain? In practice, there are many answers. However, in theory, there are still gaps in our understanding. In this paper, we address this question from the point of view of complexity theory, providing bounds in terms of the size of the desired error.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections