You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
* auto clusters_indexes = h_points.clusterIndexes(); // Get the cluster index for each points
29
28
* auto seed_map =
@@ -49,9 +48,10 @@
49
48
* Then, the `clue::Clusterer`, which is the object that handles the internal allocations and contains the algorithm logic, is created. The `Clusterer`
50
49
* requires the CLUE algorithm's parameters to be passed. Their meaning is explained in the introduction section, along with a description of the algorithm.
51
50
*
52
-
* Finally, the algorithm is launched with the `make_clusters` method, which takes as arguments the host and device points, the kernel to use for the
53
-
* clustering, the queue to use for the operations and the bloch size. The input data is copied from the host to the device container, the algorithm is then
54
-
* executed on the device, where the results are computed and finally copied back to the host container.
51
+
* Finally, the algorithm is launched with the `make_clusters` method, which takes as arguments the queue to use for the device operations, the host and
52
+
* device points and optionally the kernel to use for computing the points' density and the block-size that the kernels are launched with.
53
+
* The input data is copied from the host to the device container, the algorithm is then executed on the device, where the results are computed and finally
54
+
* copied back to the host container.
55
55
*
56
56
* The results of the clustering can then be read from the host points: the `clue::PointsHost::clusterIndexes` method returns a span of integers
57
57
* representing the cluster index for each point, while the `clue::PointsHost::isSeed` method returns a boolean array indicating which points are the seeds
0 commit comments