# Compute ND Triangulation from Pairwise Distance Matrix

Is there a way to compute a triangulation of points (e.g. triangles that approximate the surface of a 2-sphere) from a pairwise distance matrix in n-dimensions?

So far, what I've found is from Building a graph from pairwise distances:

I'm aware that you can take the distance matrix and obtain (or attempt to obtain) a layout in however many dimensions you like by taking the eigenvectors (by say the power iteration) of the all pairs shortest path matrix computed by the Floyd-Warshall algorithm from that distance matrix.