Abstract
It is shown how refinement methods for smooth curve generation can be carried out efficiently through iterated function systems (IFS). Affine transformations are constructed so that, when composed randomly, they generate the desired smooth curve. Underlying this random algorithm is the “tree traversal” property of IFS. Under a refinement method the points on the curve correspond to leaves on some N-tree. IFS theory enables one to generate all of these leaves through a single orbit of an appropriate Markov chain. Applications include Bezier curves, splines, wavelets and various interpolants.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
