Length estimation for curves with different samplings

  • Authors:

  • Lyle Noakes;Ryszard Kozera;Reinhard Klette

  • Affiliations:

  • The University of Western Australia, Department of Mathematics and Statistics, 35 Stirling Highway, Crawley WA 6009, Australia;The University of Western Australia, Department of Computer Science and Software Engineering, 35 Stirling Highway, Crawley WA 6009, Australia;The University of Auckland, Centre for Image Technology and Robotics, Tamaki Campus, Building 731, Auckland, New Zealand

  • Venue:
  • Digital and image geometry
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper* looks at the problem of approximating the length of the unknown parametric curve γ: [0, 1] → Rn from points qi = γ(ti), where the parameters ti are not given. When the ti are uniformly distributed Lagrange interpolation by piecewise polynomials provides efficient length estimates, but in other cases this method can behave very badly [15]. In the present paper we apply this simple algorithm when the ti are sampled in what we call an ε-uniform fashion, where 0 ≤ ε ≤ 1. Convergence of length estimates using Lagrange interpolants is not as rapid as for uniform sampling, but better than for some of the examples of [15]. As a side-issue we also consider the task of approximating γ up to parameterization, and numerical experiments are carried out to investigate sharpness of our theoretical results. The results may be of interest in computer vision, computer graphics, approximation and complexity theory, digital and computational geometry, and digital image analysis.