Create accountLogin

Recent searches

No recent searches

Search options

Not available on lingo.lol.
lingo.lol is one of the many independent Mastodon servers you can use to participate in the fediverse.
A place for linguists, philologists, and other lovers of languages.

Administered by:

Server stats:

63
active users

lingo.lol: AboutProfiles directoryPrivacy policy

Mastodon: AboutGet the appKeyboard shortcutsView source codev4.3.7

#mathart

11 posts10 participants1 post today
Public *
Microfractal

Decagon (fractal version)

\(z_{n+1}=fold(z_n)^2+c\)

where fold is a generalized absolute value function. A complex number has two components: a real and an imaginary part.
If we take the absolute value of one of these parts, we can interpret this as a fold in the complex plane. For example, |re(z)| causes a fold of the complex plane around the imaginary axis, which means that the left half ends up on the right half. If we do this for the imaginary component |im(z)|, we fold the complex plane around the real axis which means that the bottom half ends up on the top half.
These two operations are quite similar, because the imaginary fold is just like the real fold of the plane, except that it was previously rotated 90 degrees (z * i). But what if we rotate the plane by an arbitrary number of degrees?
An arbitrary rotation of the complex plane can be expressed as rot(z, radians) = z * (cos(radians) + sin(radians) * i), where radians encodes the rotation.

The image here is produced, by rotating the plane exactly five times, and folding the imaginary part each time.

I found this algorithm in the Fractal Formus under the name “Correction for the Infinite Burning Ship Fractal Algorithm”.
It can be seen as a generalization of the burning ship obtained by folding the complex plane twice with a rotation of 90 degrees, i.e. folding both the real and the imaginary part.

Black fractal structures on a mostly green background, rendered using distance estimation.
#fractalfriday#fractal#burningship
Public
Risto A. Paju

I came across this halftoning idea sometime last week. While the idea was relatively easy to understand and fun to implement, I've spent quite a lot of time trying to make the result look nice.

In each row, the image is split into bins containing roughly the same sum of lightness value. This is nice to implement when the number of lines/bins is a power of 2, so we can recurse with a binary split. Thus the line density varies by average lightness. The problem is that density is considered along the x-axis. If things change a lot between rows, the lines get slanted, so they appear more dense. Here I've included some averaging between neighbouring rows to make thing a bit smoother.

I'm also including a fun glitch from the early tests. The line-density system includes the set of point coordinates and the graph structure (which point is connected to which). What happened here is my generic graph generator that simply finds the nearest neighbours of each point. So in the light areas that are compressed horizontally, the nearest neighbours were left and right.

#halftoneart#lineart#patterns
ExploreLive feeds
About