TOPICS
Search

Search Results for ""


31 - 40 of 316 for Dragon FractalSearch Results
The fractal curve illustrated above, with base curve and motif illustrated below.
The lower-trimmed subsequence of x={x_n} is the sequence V(x) obtained by subtracting 1 from each x_n and then removing all 0s. If x is a fractal sequence, then V(x) is a ...
A fractal curve of infinite length which bounds an area twice that of the original square.
The upper-trimmed subsequence of x={x_n} is the sequence lambda(x) obtained by dropping the first occurrence of n for each n. If x is a fractal sequence, then lambda(x)=x.
The (m,n)-tadpole graph, also called a dragon graph (Truszczyński 1984) or kite graph (Kim and Park 2006), is the graph obtained by joining a cycle graph C_m to a path graph ...
The Mandelbar set is a fractal set analogous to the Mandelbrot set or its generalization to a higher power with the variable z replaced by its complex conjugate z^_.
The fractal-like figure obtained by performing the same iteration as for the Mandelbrot set, but adding a random component R, z_(n+1)=z_n^2+c+R. In the above plot, ...
The Gosper island (Mandelbrot 1977), also known as a flowsnake (Gardner 1989, p. 41), is a fractal that is a modification of the Koch snowflake. The term "Gosper island" was ...
A fractal derived from the Koch snowflake. The base curve and motif for the fractal are illustrated below. The area enclosed by pieces of the curve after the nth iteration is ...
A finite set of contraction maps w_i for i=1, 2, ..., N, each with a contractivity factor s<1, which map a compact metric space onto itself. It is the basis for fractal image ...
1|2|3|4|5|6|7 ... 32 Previous Next

...