A survey of curve and surface methods in CAGD
Computer Aided Geometric Design
Intrinsic parametrization for approximation
Computer Aided Geometric Design
Approximate parametrization of algebraic curves
Theory and practice of geometric modeling
The NURBS book
Approximating band- and energy-limited signals in the presence of jitter
Journal of Complexity
Complexity and information
What is the complexity of Stieltjes integration?
Journal of Complexity
Geometric Continuity of Parametric Curves: Three Equivalent Characterizations
IEEE Computer Graphics and Applications
Length Estimation for Curves with epsilon-Uniform Sampling
CAIP '01 Proceedings of the 9th International Conference on Computer Analysis of Images and Patterns
Minimum-Length Polygons in Simple Cube-Curves
DGCI '00 Proceedings of the 9th International Conference on Discrete Geometry for Computer Imagery
Rubber Band Algorithm for Estimating the Length of Digitized Space-Curves
ICPR '00 Proceedings of the International Conference on Pattern Recognition - Volume 3
Length Estimation for Curves with epsilon-Uniform Sampling
CAIP '01 Proceedings of the 9th International Conference on Computer Analysis of Images and Patterns
Asymptotics for length and trajectory from cumulative chord piecewise-quartics
Fundamenta Informaticae
External versus internal parameterizations for lengths of curves with nonuniform samplings
Proceedings of the 11th international conference on Theoretical foundations of computer vision
Asymptotics for Length and Trajectory from Cumulative Chord Piecewise-Quartics
Fundamenta Informaticae
C 1 Interpolation with Cumulative Chord Cubics
Fundamenta Informaticae
Length estimation for the adjusted exponential parameterization
ICCVG'12 Proceedings of the 2012 international conference on Computer Vision and Graphics
Sharpness in trajectory estimation by piecewise-quadratics(-cubics) and cumulative chords
ICCVG'12 Proceedings of the 2012 international conference on Computer Vision and Graphics
Hi-index | 0.00 |
This paper* looks at the problem of approximating the length of the unknown parametric curve 驴: [0, 1] 驴 IRn 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.