Fitting helices to data by total least squares
From MaRDI portal
Publication:1389723
DOI10.1016/S0167-8396(96)00058-1zbMath0894.68148MaRDI QIDQ1389723
Publication date: 30 June 1998
Published in: Computer Aided Geometric Design (Search for Journal in Brave)
Related Items (3)
Reconstruction of helices from their orthogonal projection ⋮ Floating tangents for approximating spatial curves with \(G^1\) piecewise helices ⋮ HELFIT: Helix fitting by a total least squares method
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An Analysis of the Total Least Squares Problem
- A generalization of the Eckart-Young-Mirsky matrix approximation theorem
- Circle fitting by linear and nonlinear least squares
- Elastic tracking and neural network algorithms for complex pattern recognition
- SYMMETRIC GAUGE FUNCTIONS AND UNITARILY INVARIANT NORMS
- Accurate Singular Values of Bidiagonal Matrices
- The constrained total least squares technique and its applications to harmonic superresolution
- Total Least Squares: State-of-the-Art Regression in Numerical Analysis
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
- An Algorithm for the Ill-Conditioned Generalized Eigenvalue Problem
- Geometry. I, II. Transl. from the French by M. Cole and S. Levy
This page was built for publication: Fitting helices to data by total least squares
