We give a simple and effective two stage algorithm for approximating a point cloud S⊂Rm by a simplicial complex K. The first stage is an iterative fitting procedure that generalizes k-means clustering, while the second stage involves deleting redundant simplices. A form of dimension reduction of S is obtained as a consequence.
@article{arxiv.1607.03849,
title = {Fitting a Simplicial Complex using a Variation of k-means},
author = {Piotr Beben},
journal= {arXiv preprint arXiv:1607.03849},
year = {2016}
}