Share Email Print

Proceedings Paper

Search-space reductions in deriving a fractal set for an arbitrary shape
Author(s): David John Nettleton; Roberto Garigliano
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

At present the problem of finding a quick and efficient way of representing an arbitrary shape as a set of contraction mappings (an iterated function system) is unresolved. The main problem that arises is the sheer size and complexity of the search space. This paper examines several constraints that can be placed on solutions, each of which has a low computational complexity. These constraints considerably reduce the search space in which the solutions exist and can be used to aid a variety of search algorithms.

Paper Details

Date Published: 1 September 1993
PDF: 9 pages
Proc. SPIE 1962, Adaptive and Learning Systems II, (1 September 1993);
Show Author Affiliations
David John Nettleton, Univ. of Durham (United Kingdom)
Roberto Garigliano, Univ. of Durham (United Kingdom)

Published in SPIE Proceedings Vol. 1962:
Adaptive and Learning Systems II
Firooz A. Sadjadi, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?