A shape preserving representation with an evaluation algorithm of linear complexity

DOI10.1016/S0167-8396(02)00190-5MaRDI QIDQ2388490zbMATH OpenOpenAlexFDO

Authors J. Delgado, J. M. Peña

Publication date 14 September 2005

Published in Computer Aided Geometric Design (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-8396(02)00190-5

zbMATH Keywords

corner cuttingevaluation algorithmsshape preservationtotal positivity

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• A shape-preserving variant of Lane-Riesenfeld algorithm
• scientific article; zbMATH DE number 4044406
• Publication:3468070
• The rate of convergence for linear shape-preserving algorithms
• Shape-preserving approximation by space curves
• Structured discrete shape approximation: theoretical complexity and practical algorithm
• Shape preserving representations and optimality of the Bernstein basis
• Shape preserving representations in computer aided geometric design
• A linear approach to shape preserving spline approximation

Cites work

• Efficient algorithms for Bézier curves
• Efficient evaluation of multivariate polynomials
• scientific article; zbMATH DE number 123319 (Why is no real title available?)
• scientific article; zbMATH DE number 491264 (Why is no real title available?)
• Shape preserving properties of the generalised Ball basis
• Shape preserving representations and optimality of the Bernstein basis
• Shape preserving representations in computer aided geometric design
• Totally positive matrices

Cited in

(26)

• Accurate evaluation of Bézier curves and surfaces and the Bernstein-Fourier algorithm
• Shape preserving representations and optimality of the Bernstein basis
• On a progressive and iterative approximation method with memory for least square fitting
• A shape-preserving variant of Lane-Riesenfeld algorithm
• Evaluation and subdivision algorithms for general classes of totally positive rational bases
• Extremal and optimal properties of B-bases collocation matrices
• A composite iterative procedure with fast convergence rate for the progressive-iteration approximation of curves
• Conversion and evaluation for two types of parametric surfaces constructed by NTP bases
• Determination and (re)parametrization of rational developable surfaces
• Corner cutting systems
• A piecewise linear approximation method preserving visual feature points of original figures
• An O(N log N) algorithm for shape modeling.
• A modified vertex-based shape coding algorithm
• Approximating of conic sections by DP curves with endpoint interpolation
• Algorithm 960
• Conics in rational cubic Bézier form made simple
• Generalized and optimal sequence of weights on a progressive‐iterative approximation method with memory for least square fitting
• A new bivariate basis representation for Bézier-based triangular patches with quadratic complexity
• Multiple degree elevation and constrained multiple degree reduction for DP curves and surfaces
• A comprehensive comparison of algorithms for evaluating rational Bézier curves
• Subresultants of several univariate polynomials in Newton basis
• A basis-preserving algorithm for computing the Bézout matrix of Newton polynomials
• Totally positive bases and progressive iteration approximation
• Efficient computation of Bézier curves from their Bernstein-Fourier representation
• Error analysis of efficient evaluation algorithms for tensor product surfaces
• Construction of triangular DP surface and its application

This page was built for publication: A shape preserving representation with an evaluation algorithm of linear complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2388490)