446 B
446 B
PolyTree
Starting from a central polygon, one can imagine a tree P of polygons created by attaching otherpolygons at each edge of the central one and iterating. Of course, many of the resulting polygons overlap. PolyTree selects and displays non-overlapping subtrees of P in a variety of ways.
Implementation
As a first pass, PolyTree will consist of a Processing sketch written in CoffeeScript and intended to be served with HarpJS.