论文信息 - Markov chains and computer aided geometric design: Part II—examples and subdivision matrices

Markov chains and computer aided geometric design: Part II—examples and subdivision matrices

In Part I, Markov chains were shown to be associated with solutions to several standard problems in computer-aided geometric design. Constraints on these Markov chains were also derived. Examples are given here of Markov chains that either satisfy some of these constraints or solve one of these problems. Subdivision matrices are also studied in special detail.

Ron Goldman | R. Goldman

[1] Samuel Karlin,et al. Total positivity, absorption probabilities and applications , 1964 .

[2] Ron Goldman,et al. Markov chains and computer-aided geometric design: part I - problems and constraints , 1984, TOGS.

[3] Tom Lyche,et al. Discrete B-splines and subdivision techniques in computer-aided geometric design and computer graphics , 1980 .

[4] Gregory M. Nielson,et al. Iterates of Markov operators , 1976 .

[5] J. Hutchinson,et al. On a class of automorphic functions , 1902 .

[6] Ron Goldman,et al. Polya’s Urn Model and Computer Aided Geometric Design , 1985 .

[7] T. J. Rivlin,et al. Iterates of Bernstein polynomials. , 1967 .

[8] C. D. Boor,et al. On Calculating B-splines , 1972 .

[9] R. Goldman. Using degenerate Bézier triangles and tetrahedra to subdivide Bézier curves , 1982 .

[10] K. Chung,et al. Elementary Probability Theory with Stochastic Processes. , 1975 .

[11] Kai Lai Chung,et al. Elementary Probability Theory with Stochastic Processes. , 1975 .