block by bmershon 41bc67cfedf95f7d196d

Vietoris-Rips Complex (simplicial complex)

Full Screen

Copyright (c) 2014 Brooks Mershon

The MIT License - http://opensource.org/licenses/MIT

Please excuse the awful coding practices that may be found here.

This was more or less my first run at using D3 and JavaScript in an undergraduate math course (where writing code wasn’t even expected, unless it was MATLAB). This was written before modular design, functional programming, and maturity had gripped the author to even a modest extent. This gadget (application seems too strong) was developed as if it were one colossal whiteboard exercise which permitted only small erasures and steady contributions over half of a semester.

The urge to go back and rearrange or modify in any way is strong, but I am choosing to leave this relic of sophomore year as a happy and messy memory of an assignment of which I am quite proud.

I love what I built, but I regret how it was built. I didn’t know better.

A final paper was written about the design process of this and other gadgets created for MATH 412, taught by Paul Bendich during the Fall 2014 semester.

Rips-Complex

This gadget demonstrates an application of the Rips-Complex to point-clouds sampled from continuous curves in the plane. The Rips-Complex allows us to calculate the number of connected components as well as the number of 1-cycles (loops) which appear at a given radius.

Points are sampled from an underlying curve with Gaussian noise applied. Persistent homology is computed by reducing the boundary matrix formed by the simplicial complex (at a given radius).

In order to add edges and triangles, a Delaunay triangulation using the existing vertices (points in the point clound) is calculated. Edges are added when the “balls” around the two vertices bounding an edge touch and the edge appears in the Delaunay triangulation.

Triangles are added immediately when their three 1-dimensional faces are present in the simplicial complex. As a result, what you see when the radius is scrubbed all the way to infinity is exactly the Delaunay triangulation of the point cloud.

The purpose of this gadget is to understand how Betti numbers change along the way as we increase the radius from zero to infinity.

The color of a triangle corresponds to the radius at which it appears. Note that the persistence of each 1-cycle formed can be encoded in a 1-dimensional persistence diagram. Such a diagram is replaced in this example by encoding the 1-dimensional persistence with a color scale, as the legend shows.

index.html

curves.txt