
doi: 10.20380/gi1997.18
Interpolation of two-dimensional shapes described by iterated function systems is explored. Iterated function systems define shapes using self-transformations, and interpolation of these shapes requires interpolation of these transformations. Polar decomposition is used to avoid singular intermediate transformations and to better simulate articulated motion. Unlike some other representations, such as polygons, shaped described by iterated function systems can become totally disconnected. A new, fast and image-based technique for determining the connectedness of an iterated function system attractor is introduced. For each shape interpolation, a two parameter family of iterated function systems is defined, and a connectedness locus for these shapes is plotted, to maintain connectedness during the interpolation.
Proceedings of the Graphics Interface 1997 Conference, Kelowna, British Columbia, Canada, 21 - 23 May 1997, 155-162
000 computer science
000 computer science
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
