Linear fractal shape interpolation

Brandon Burch, John C. Hart

Research output: Contribution to journalConference article

Abstract

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.

Original languageEnglish (US)
Pages (from-to)155-162
Number of pages8
JournalProceedings - Graphics Interface
StatePublished - Dec 1 1997
EventProceedings of the 1997 Graphics Interface Conference - Kelowna, Can
Duration: May 21 1997May 23 1997

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design

Fingerprint Dive into the research topics of 'Linear fractal shape interpolation'. Together they form a unique fingerprint.

  • Cite this