All the i's, j's, and k's from Finnegan's Wake

100%

All the i's, j's, and k's from Finnegan's Wake

✓ Published0🌍 Public

Last edited May 18, 2017

Created on May 18, 2017

This piece visualizes the product of all the letters i, j, and k extracted from the text of *Finnegan's Wake*. It shows the step-by-step result of repeatedly applying Hamilton's quaternion multiplication rules to the sequence of letters. The computation uses a custom Python script that reduces the entire letter sequence via the `mult` function, which implements the quaternion multiplication table. The final result of reducing this long string of letters is displayed as a single quaternion value.

AI-generated description

Similar vizzes

Loading thumbnail…

A solution to a codefights daily puzzle that was amusing and might be useful to reference

This example demonstrates a Python solution to a Codefights puzzle that decompresses a run-length encoded string, sorts its letters, and returns the kth character. The visualization shows how the algorithm groups identical letters using `itertools.groupby` and `sorted`, then aggregates their counts with `sum`. It uses `re.findall` to parse letter-number pairs and a pairwise iteration to handle adjacent matches. The code returns -1 for invalid inputs or when k exceeds the total character count, illustrating a compact approach to string compression challenges.

BBBischof

50% match

Loading thumbnail…

A Animated I

A monochrome animated letterform materializes on a black canvas as a dense field of tiny triangles, all converging and diverging along diagonal paths. The composition splits into two mirrored halves, with particles crossing the center line to form a tall, angular "I" shape before dispersing. Built with D3.js and rendered on a 2D canvas, the animation uses a custom `d3.timer` loop and the Canvas API’s `globalCompositeOperation` for additive blending, while triangle positions are updated via simple velocity and boundary-reflection logic. The data consists of randomly generated triangle coordinates, with colors cycling between cyan and magenta based on movement direction.

11wheel

50% match

Loading thumbnail…

Gist ed622868551761dc9ede

This visualization generates 1,000 random three-word phrases by selecting words from a dictionary that begin with the letters K, I, and K, then joins them with spaces. The example uses the `dictionary-js` package to load a word list, filters words by their initial letter, and samples them at random to construct each phrase. The resulting output is a list of invented combinations, highlighting the quirky and arbitrary nature of random word assembly.

HHypercubed

49% match

Loading thumbnail…

test

A continuously shuffling set of the 26 alphabet letters animates horizontally across an SVG canvas. The visualization demonstrates D3's general update pattern with a key function, showing how data joins handle enter, update, and exit selections. Each letter's x-position is recalculated based on its new index after each shuffle via `d3.shuffle`. An infinite loop triggers repeated updates, with a 750ms transition on position changes. The code primarily uses D3 v7 selections, `join()`, and `transition()` for the animation.

Aa15923647

47% match

Loading thumbnail…

thing 0001

A word rendered as text is represented by hundreds of small squares that drift randomly across the screen before settling into the letterforms. The visualization rasterizes the word "enj" onto a hidden canvas using `fillText` and `getImageData`, sampling pixel coordinates as target positions. Each square is a `<rect>` whose position is animated by `d3.forceSimulation`, using `forceX`, `forceY`, and `forceCollide` to move particles toward their targets while preventing overlap. The color and stroke width vary with distance from the center, drawn on both SVG and canvas elements using D3 v4 and the `d3-scale-chromatic` color scale.

FFrissAnalytics

46% match

Loading thumbnail…

Gist 7330771

This example demonstrates how D3 transitions make data joins easier to follow by animating the entry, update, and exit states of SVG text elements. It shows a sequence of randomly selected alphabet letters that change every 1.5 seconds, with entering letters sliding down from above, exiting letters dropping below, and updated letters gliding horizontally to their new positions. The code uses D3’s selection joins with key functions, `transition.attr` and `transition.style` to animate positions and opacity, and relies on SVG text elements rendered in a single group. The data is a shuffled subset of the alphabet, sorted and re-joined with each interval.

11wheel

46% match

Loading thumbnail…

Gist 9cae4888d477011e1083bb00dc773a1d

This visualization displays a grid of five-letter words, each row representing a word from the supplied CSV file. It shows how each word’s letters and their scores relate, with columns for each position and a total score. The code uses `d3.forceSimulation` to position the text elements, while the data comes from the embedded `word_pool.csv` file. Each word’s letter scores are visually encoded, and the `duplicates` flag is included in the dataset. The rendering relies on SVG text elements updated via D3’s data join, with no external libraries beyond D3.

CConorAspell

46% match

Loading thumbnail…

Gist 0e347a46041a01aa3c4f

This example visualizes the Collatz conjecture by mapping each integer from 0 to 5199 to a small square, where the fill color encodes the number of cycles to reach 1 and the stroke color encodes the maximum value reached during the sequence. The squares are arranged in a grid, and hovering over a square updates a text label to show the exact cycle count and maximum for that number. The visualization uses D3.js (version 3.5.5) to compute the Collatz sequences, bind the data to SVG rectangles, and apply linear color scales with HSL interpolation for the two attributes. The layout positions squares sequentially in rows of fixed width, and the code notes that changing the width parameter alters the grid pattern.

CCBasis

45% match