More Asemic Writing · inconvergent

I've worked on asemic writing several times. Most recently I described a system based on Bézier curves, which mimics some kind of cursive. After this I started experimenting with a method to to make something that is more akin to systems such as Hangul or Katakana. I won't go into all the details of this algorithm, but the main idea is described below.

First, distribute a few nodes at random within a suitable domain. My version uses a square domain, and variation of Mitchell's best-candidate algorithm, to get nodes that are evenly distributed. Once we have the nodes, use them to create a relative neighborhood graph.

The glyphs in this system consist of two to five separate strokes. Strokes are not allowed to intersect each other, but multiple strokes can be connected to the same node.

A stroke is created by selecting a node in the graph at random, then performing a short (two to four steps) random walk along connected edges. The stroke is then defined by the nodes that were visited in the walk, in the order they were visited in.

Leave a Comment