Skip to content

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

License

Notifications You must be signed in to change notification settings

codearxiv/smeans

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

23 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

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.

smeans

About

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

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages