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.
-
Notifications
You must be signed in to change notification settings - Fork 0
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
codearxiv/smeans
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
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 0
No packages published