[−][src]Module appr_dbscan::utils
Structs
CellIndexPoint | Mock struct to use RTrees with const generics |
DBSCANParams | The parameters needed to run the approximate DBSCAN algorithm |
Enums
IntersectionType | See documentation for the function |
Functions
array_res_to_vector_res | Transforms a vector of clusters containing points represented as arrays into a vector of clusters where each point is represented as a vector. |
determine_intersection | Determines the type of intersection between a cell and an approximated ball. The cell is determined by its center and the side of its size. Returns: |
euclidean_distance | |
get_base_cell_index | Gets the indexes of the intervals of the axes in the |
get_cell_index | Gets the indexes of the intervals of the axes in the |
index_distance_sq | Gets the euclidean distance to the power of 2 between two arrays representing cell indexes |
vector_input_to_array_input | Translates a vector of points represented as vectors in a vector of points represented ad fixed length arrays. Panics if the points do not all have the same length. |
Type Definitions
CellCenter | Type that represent the point in the |
CellIndex | Array that stores the indexes of the intervals of the axes in the |
Cluster | Collection of points in the same cluster |
DBSCANResult | Collection of all the cluster found by the DBSCAN algorithm. Its first element will be the collection of noise points. |
Point | Type that represents a point with dimensionality D |
VectorCluster | Cluster redefined to accomodate vector points.
If dimensionality D is known then using |
VectorDBSCANResult | Result redefined to accomodate vector clusters
If dimensionality D is known then using |
VectorPoint | Point defined as a vector instead of as an array like in |