The app I wrote visits a website and downloads the source text. It parses the text, looking for links to other web pages, links to itself, links to other file types, email addresses, etc. Based on how many links it finds, it creates a “star”. The number of links found equals the number of spines on the “star”. Thus, if it finds no links, it draws a circle.

It then goes to the first link on the page and does the same thing. Then it iterates over thousands of pages. E-mail addresses are drawn as a plus-sign, errors are an ‘x’, non-html files are squares, and a line follows the path the program took.

Another caveat: The first instance of a web page is a unique star. Anytime the app finds that same page linked to by another page, it draws a line back to the originating star instead of another star.

Been rendering various texts with the Language Visualizer v2 (aka ‘Volumetric Redundancies’).

This is a program I wrote that reads a source text and looks for words that are used repeatedly. The more the word is used, the larger its cube gets. Red cubes are words that are not unique, blue cubes are. The size of the rings is determined by the size of the paragraphs.