Markov chains and computer-aided geometric design: part I - problems and constraints

DOI10.1145/3870.3978MaRDI QIDQ3721844zbMATH OpenOpenAlexFDO

Authors Ron Goldman

Publication date 1984

Published in ACM Transactions on Graphics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3870.3978

zbMATH Keywords

blending functionscontrol pointscurveshape

Mathematics Subject Classification ID

Continuous-time Markov processes on discrete state spaces (60J27) Computing methodologies and applications (68U99)

Recommendations

• Markov chains and computer aided geometric design: Part II—examples and subdivision matrices
• Recursive polynomial curve schemes and computer-aided geometric design
• Polya’s Urn Model and Computer Aided Geometric Design
• scientific article; zbMATH DE number 4076435
• Computer aided solving the high-order transition probability matrix of the finite Markov chain

Cited in

(11)

• On the numerical condition of polynomials in Bernstein form
• Shape parameter deletion for Pólya curves
• Recursive polynomial curve schemes and computer-aided geometric design
• B-splines, Pólya curves, and duality
• Triangular surface patch based on bivariate Meyer-König-Zeller operator
• Markov chains, products of random matrices, and the main problem of modern eschatology
• Curve fairing using integral spline operators
• Polya’s Urn Model and Computer Aided Geometric Design
• The Bernstein polynomial basis: a centennial retrospective
• OPTIMAL REPARAMETRIZATION OF POLYNOMIAL ALGEBRAIC CURVES
• Markov chains and computer aided geometric design: Part II—examples and subdivision matrices

This page was built for publication: Markov chains and computer-aided geometric design: part I - problems and constraints

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