MATLAB iterative algorithm that fits a n-dimensional simplicial complex to a point cloud in arbitrary dimensions based on a generalization of k-means clustering
MATLABGPL-3.0
smeans
MATLAB iterative algorithm that fits a n-dimensional simplicial complex to a point cloud in arbitrary dimensions based on a generalization of k-means clustering.
Being written in MATLAB it can be a bit slow. Might benefit from spatial indexing.
