An efficient parallel algorithm to find the clusters of a big set of 2D points, given a radius, where for each point in a cluster, it's closest neighbor inside the cluster has Euclidean distance from it less than the given radius. This problem is inspired from the stars constellations.
-
Notifications
You must be signed in to change notification settings - Fork 0
An efficient parallel algorithm to find the clusters of a big set of 2D points, given a radius, where for each point in a cluster, it's closest neighbor inside the cluster has Euclidean distance from it less than the given radius. This problem is inspired from the stars constellation.
nbooster/radius-2d-clustering
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
An efficient parallel algorithm to find the clusters of a big set of 2D points, given a radius, where for each point in a cluster, it's closest neighbor inside the cluster has Euclidean distance from it less than the given radius. This problem is inspired from the stars constellation.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published