On the Error of Random Sampling: Uniformly Distributed Random Points on Parametric Curves

Apostolos Chalkis, Christina Katsamaki, Josué Tonelli-Cueto

Publication date: 5 March 2022

Abstract: Given a parametric polynomial curve

g a m m a : [a, b] i g h t a r r o w m a t h b b R^{n}

, how can we sample a random point

m a t h f r a k x i n m a t h r m i m (g a m m a)

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.

Has companion code repository: https://github.com/tolischal/sampling_curves

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Numerical approximation and evaluation of special functions (33F05)

This page was built for publication: On the Error of Random Sampling: Uniformly Distributed Random Points on Parametric Curves