The Ben Paul Thurston Blog

I found this formula that you put in S for how many sided polygons and P for how many meet at a vertex and gives the number of Edges, Faces,...

An easy formula for finding the volume of a polyhedron when you know the coordinates of the vertices... where the bars are absolute...

For a simple connected graph with coordinates I believe this algorithm finds a path visiting every point once if it is possible. The firs...

consider this formula: For rationals [0..1] these (x,y) pairs are on the unit circle in the first quadrant, as proven here:  http://math...

This program takes a map of a certain number of different colors like: And produces this: This map preserves the order that you will r...

Ok suppose you have a polygon: I noticed you can "wiggle" any of the points to 4 possible new points so that the distance to t...

A program I wrote takes some values like: [3,5,2,8,1,3,7] first sorts greatest to smallest: [8,7,5,3,3,2,1] (The program works whether th...