Journal of Undergraduate Research
Keywords
algorithmic fractals, hyperspaces, n-D factals
College
Physical and Mathematical Sciences
Department
Computer Science
Abstract
n-D fractals, where n> 4, have long been under scrutiny for their mathematical properties and artistic values. Multi-dimensional space filling curves, for instance, are a focus for contemporary topologists. Notable works in this area include the uses of quaternions, commutative hyper-complex calculus, and, most recently, doubling processes. However, all these discoveries have been limited to algebraic fractals such as the Mandelbrot set and the Julia sets. Algorithmic fractals are equally interesting since they serve as bridges connecting chaos theory to well studied formal language theory.1 2-D and 3-D algorithmic fractals are conventionally generated and analyzed using L-systems and iterated function systems (IFS). In this research, these techniques have been augmented and extended to study n-D algorithmic fractals.
Recommended Citation
Xu, Minglei and Burton, Dr. Robert P.
(2013)
"GENERATION AND FORMAL ANALYSIS OF ALGORITHMIC FRACTALS IN HYPERSPACES,"
Journal of Undergraduate Research: Vol. 2013:
Iss.
1, Article 2633.
Available at:
https://scholarsarchive.byu.edu/jur/vol2013/iss1/2633