In this paper, we describe an algorithm for fitting an analytic and bandlimited closed or open curve to interpolate an arbitrary collection of points in $\mathbb{R}^{2}$. The main idea is to smooth the parametrization of the curve by iteratively filtering the Fourier or Chebyshev coefficients of both the derivative of the arc length function and the tangential angle of the curve, and applying smooth perturbations, after each filtering step, until the curve is represented by a reasonably small number of coefficients. The algorithm produces a curve passing through the set of points to an accuracy of machine precision, after a limited number of iterations. It costs O($N\log{N}$) operations at each iteration, provided that the number of discretization nodes is $N$. The resulting curves are smooth and visually appealing, and do not exhibit any ringing artifacts. The bandwidths of the constructed curves are much smaller than those of curves constructed by previous methods. We demonstrate the performance of our algorithm with several numerical experiments.
翻译:在本文中, 我们描述一个算法, 用于安装一个分析和带宽的封闭或开放曲线, 将任意收集的点数乘以$\mathb{R ⁇ 2}。 主要的想法是, 通过迭接过滤弧长度函数和曲线正切角度的衍生物Fourier或Chebyshev 系数, 平滑曲线的平衡, 并在每次过滤步骤之后, 应用光滑的扰动, 直至曲线以数量合理的小系数表示。 该算法产生一个曲线通过一组点来达到机器精确度的精确度, 在每次迭代中, 它要花费O( $N\log{N} 美元), 只要离散节数是 $N美元。 由此产生的曲线是平滑和视觉吸引, 并且没有显示任何响动的工艺品。 构造曲线的带宽比先前方法构造的曲线的宽度要小得多。 我们用数项实验来显示我们的算法的性能 。