Approximate implicitization using linear algebra
From MaRDI portal
Abstract: In this paper we consider a family of algorithms for approximate implicitization of rational parametric curves and surfaces. The main approximation tool in all of the approaches is the singular value decomposition, and they are therefore well suited to floating point implementation in computer aided geometric design (CAGD) systems. We unify the approaches under the names of commonly known polynomial basis functions, and consider various theoretical and practical aspects of the algorithms. We offer new methods for a least squares approach to approximate implicitization using orthogonal polynomials, which tend to be faster and more numerically stable than some existing algorithms. We propose several simple propositions relating the properties of the polynomial bases to their implicit approximation properties.
Recommendations
Cites work
- scientific article; zbMATH DE number 733521 (Why is no real title available?)
- scientific article; zbMATH DE number 1070448 (Why is no real title available?)
- scientific article; zbMATH DE number 2051424 (Why is no real title available?)
- scientific article; zbMATH DE number 2079841 (Why is no real title available?)
- scientific article; zbMATH DE number 6154260 (Why is no real title available?)
- A Fast Algorithm for the Evaluation of Legendre Expansions
- A simple method for implicitizing rational curves and surfaces
- Algebraic surface design with Hermite interpolation
- An Extension of MATLAB to Continuous Functions and Operators
- An approach to weak approximate implicitization
- Asymptotic convergence of degree-raising
- Construction of orthogonal bases for polynomials in Bernstein form on triangular and simplex domains
- Functional composition algorithms via blossoming
- Higher-order interpolation and least-squares approximation using implicit algebraic surfaces
- Least-squares fitting of algebraic spline surfaces
- Numerical Methods for Special Functions
- Numerical stability of surface implicitization
- On local implicit approximation and its applications
- On the optimal stability of the Bernstein basis
- Singular Points of Complex Hypersurfaces. (AM-61)
Cited in
(20)- A basis for the implicit representation of planar rational cubic Bézier curves
- Piecewise approximate implicitization of parametric curves
- scientific article; zbMATH DE number 2051424 (Why is no real title available?)
- Numerical methods for implicitisation and their applications
- A new approach for approximate implicitization of parametric curves
- Piecewise approximate implicitization: experiments using industrial data
- Approximate implicitization of space curves and of surfaces of revolution
- Models for Isogeometric Analysis from CAD
- High order parametric polynomial approximation of quadrics in \(\mathbb{R}^d\)
- scientific article; zbMATH DE number 1985285 (Why is no real title available?)
- Reverse engineering of CAD models via clustering and approximate implicitization
- An implicitization algorithm with fewer variables
- Approximate implicitization of parametric curves using cubic algebraic splines
- scientific article; zbMATH DE number 2160465 (Why is no real title available?)
- The implicit LX method of the ABS class
- An approach to weak approximate implicitization
- Approximate implicitization of space curves
- scientific article; zbMATH DE number 2149746 (Why is no real title available?)
- Fitting and recognition of geometric primitives in segmented 3D point clouds using a localized voting procedure
- Approximate implicitization
This page was built for publication: Approximate implicitization using linear algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q410917)
