block by bmershon 9ba5a6fc213717515fba

Point Cloud Triangulation

Full Screen

One problem we encounter when we attempt to form the Rips-Complex of a point-cloud is over-triangulation.

If we naively form triangles for all unordered triples of points, we create a simplicial complex that is no-longer 2-dimensional. If, for example, we wish to count the number of 1-cycles in a rips-complex formed from a 2-dimensional point cloud, we need to be careful when we add triangles.

Rips-Complex shows this particular application.

Triangles appear when all of the edges for that triangle, the three 1-simplex faces, are present. These edges appear when the balls of radius r that expand around each point first touch. How do we know which edges we should form in the first place?

We can use the Delaunay triangulation in the plane as your limiter; so you only ever draw edges and triangles that form part of the Delaunay triangulation.

Then, the rule for adding triangles becomes:

(x,y) is an edge at radius R if d(x,y) < R/2 AND (x,y) forms an edge in the Delaunay triangulation

index.html