A Mean Shift Clustering Implementation for VTK
Please use this identifier to cite or link to this publication: http://hdl.handle.net/10380/3219
New: Prefer using the following doi: https://doi.org/10.54294/pgbh5i
Mean shift clustering is an excellent technique for clustering points when the number of clusters is not known. We present a implementation (vtkMeanShiftClustering) of the simplest version of the algorithm written in a VTK context. The code is currently hosted at http://github.com/daviddoria/vtkMeanShiftClustering .