Dietrich Featherston d2fn

Keybase proof

I hereby claim:

I am d2fn on github.
I am d2fn (https://keybase.io/d2fn) on keybase.
I have a public key whose fingerprint is 9B44 A7D0 3783 FD03 570C 89FC AFEC 18F7 30BD 71C8

To claim this, I am signing this object:

Each curve follows 2d perlin space at a different, but nearby, z axis. The result is the appearance of topology as curves expose gradients in noise function.

Curves drawn by randomly placing actors on the canvas, and walking them in a direction determined by the perlin noise function at their location. The continuity of the underlying noise function causes paths to converge together.

Simple demonstration of 2d perlin noise.

Dendrite growth using d3 quadchart nearest neighbor search. A point is chosen at random and joined to its nearest neighbor. Each node keeps track of the node to which it was adjoined via a parent reference. As each node is attached the child count of each parent in the chain is incremented. The child count is used directly to determine rendering width of lines between nodes.

Dendrite growth using d3 quadchart nearest neighbor search.

Demonstration of unevenness of uniform random distributions for point scattering.

	#!/usr/bin/env python

	"""
	Usage: topk [key-column-name] [score-column-name]

	Reads tsv rows, including a header row, from stdin.
	Writes to stdout the top 10 rows per distinct value of the given key column.

	Author Dietrich Featherston
	"""

	<!DOCTYPE html>
	<meta charset="utf-8">
	<style type="text/css">
	.axis path,
	.axis line {
	fill: none;
	stroke: black;
	shape-rendering: crispEdges;
	}
	.axis text {