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
Externally publishedYes
EventProceedings of the 1997 Graphics Interface Conference - Kelowna, Can
Duration: May 21 1997May 23 1997

Fingerprint

Fractals
Interpolation
Decomposition

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design

Cite this

Linear fractal shape interpolation. / Burch, Brandon; Hart, John C.

In: Proceedings - Graphics Interface, 01.12.1997, p. 155-162.

Research output: Contribution to journalConference article

@article{fe267d496b8747108d438be37524fee3,
title = "Linear fractal shape interpolation",
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.",
author = "Brandon Burch and Hart, {John C.}",
year = "1997",
month = "12",
day = "1",
language = "English (US)",
pages = "155--162",
journal = "Proceedings - Graphics Interface",
issn = "0713-5424",
publisher = "Canadian Information Processing Society",

}

TY - JOUR

T1 - Linear fractal shape interpolation

AU - Burch, Brandon

AU - Hart, John C.

PY - 1997/12/1

Y1 - 1997/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0031370305&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0031370305&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:0031370305

SP - 155

EP - 162

JO - Proceedings - Graphics Interface

JF - Proceedings - Graphics Interface

SN - 0713-5424

ER -