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
Geometric Continuity of Parametric Curves: Three Equivalent Characterizations
IEEE Computer Graphics and Applications
ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part II
Segmentation and Length Estimation of 3D Discrete Curves
Digital and Image Geometry, Advanced Lectures [based on a winter school held at Dagstuhl Castle, Germany in December 2000]
Approximation of 3D Shortest Polygons in Simple Cube Curves
Digital and Image Geometry, Advanced Lectures [based on a winter school held at Dagstuhl Castle, Germany in December 2000]
Length Estimation for Curves with Different Samplings
Digital and Image Geometry, Advanced Lectures [based on a winter school held at Dagstuhl Castle, Germany in December 2000]
Rubber Band Algorithm for Estimating the Length of Digitized Space-Curves
ICPR '00 Proceedings of the International Conference on Pattern Recognition - Volume 3
Asymptotics for length and trajectory from cumulative chord piecewise-quartics
Fundamenta Informaticae
C1 Interpolation with cumulative chord cubics
Fundamenta Informaticae
Asymptotics for Length and Trajectory from Cumulative Chord Piecewise-Quartics
Fundamenta Informaticae
C 1 Interpolation with Cumulative Chord Cubics
Fundamenta Informaticae
Hi-index | 0.00 |
This paper studies differences in estimating length (and also trajectory) of an unknown parametric curve γ : [0, 1] → IRn from an ordered collection of data points qi = γ(ti), with either the ti's known or unknown. For the ti's uniform (known or unknown) piecewise Lagrange interpolation provides efficient length estimates, but in other cases it may fail. In this paper, we apply this classical algorithm when the ti's are sampled according to first α-order and then when sampling is ɛ-uniform. The latter was introduced in [20] for the case where the ti's are unknown. In the present paper we establish new results for the case when the ti's are known for both types of samplings. For curves sampled ɛ-uniformly, comparison is also made between the cases, where the tabular parameters ti's are known and unknown. Numerical experiments are carried out to investigate sharpness of our theoretical results. The work may be of interest in computer vision and graphics, approximation and complexity theory, digital and computational geometry, and digital image analysis.