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

DOI10.1145/3870.3978zbMath0592.68081OpenAlexW2091831288MaRDI QIDQ3721844

Ronald N. 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

shapecurveblending functionscontrol points

Mathematics Subject Classification ID

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

Related Items

On the numerical condition of polynomials in Bernstein form, The Bernstein polynomial basis: a centennial retrospective, Shape parameter deletion for Pólya curves, OPTIMAL REPARAMETRIZATION OF POLYNOMIAL ALGEBRAIC CURVES, B-splines, Pólya curves, and duality, Triangular surface patch based on bivariate Meyer-König-Zeller operator, Curve fairing using integral spline operators, Recursive polynomial curve schemes and computer-aided geometric design