The Cayley method in computer aided geometric design

DOI10.1016/0167-8396(84)90019-0zbMath0571.65113OpenAlexW2053508523MaRDI QIDQ1061474

Wayne Tiller, Yves de Montaudouin

Publication date: 1984

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

Full work available at URL: https://doi.org/10.1016/0167-8396(84)90019-0

zbMATH Keywords

implicitizationEuclidean algorithmcomputer aided geometric designeliminationintersection problemsbirational correspondenceCayley method

Mathematics Subject Classification ID

Computation of special functions and constants, construction of tables (65D20) Numerical approximation and computational geometry (primarily algorithms) (65D99) Graphical methods in numerical analysis (65S05)

Related Items (8)

Algorithms for polynomials in Bernstein form ⋮ Computational issues in solid boundary evaluation ⋮ A resultant matrix for scaled Bernstein polynomials ⋮ A direct approach to computing the \(\mu\)-basis of planar rational curves ⋮ On the minors of the implicitization Bézout matrix for a rational plane curve ⋮ A unified approach to resultant matrices for Bernstein basis polynomials ⋮ Fast computation of the Bézout and Dixon resultant matrices ⋮ A companion matrix resultant for Bernstein polynomials

Cites Work

• Unnamed Item
• Implicit representation of parametric curves and surfaces
• Implicitization, inversion, and intersection of planar rational cubic curves
• On the Problem of Runs

This page was built for publication: The Cayley method in computer aided geometric design