Translator Disclaimer
1 September 1993 Search-space reductions in deriving a fractal set for an arbitrary shape
Author Affiliations +
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.
© (1993) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
David John Nettleton and Roberto Garigliano "Search-space reductions in deriving a fractal set for an arbitrary shape", Proc. SPIE 1962, Adaptive and Learning Systems II, (1 September 1993); https://doi.org/10.1117/12.150581
PROCEEDINGS
9 PAGES


SHARE
Advertisement
Advertisement
Back to Top