rustpix-algorithms 1.0.5

Clustering algorithms (ABS, DBSCAN, Graph, Grid) with spatial indexing
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58

# rustpix-algorithms

Clustering algorithms with spatial indexing for neutron event detection.

## Algorithms

### ABS (Adjacency-Based Search)
Fast 8-connectivity clustering optimized for pixel detectors.

```rust
use rustpix_algorithms::abs::AbsClustering;

let clustering = AbsClustering::new(5.0, 75.0); // spatial, temporal epsilon
let clusters = clustering.cluster(&hits);
```

### DBSCAN
Density-based clustering with KD-tree spatial indexing.

```rust
use rustpix_algorithms::dbscan::DbscanClustering;

let clustering = DbscanClustering::new(5.0, 75.0, 1); // eps, time_eps, min_pts
let clusters = clustering.cluster(&hits);
```

### Graph
Union-find based connected component detection.

```rust
use rustpix_algorithms::graph::GraphClustering;

let clustering = GraphClustering::new(5.0, 75.0);
let clusters = clustering.cluster(&hits);
```

### Grid
Parallel grid-based clustering with spatial hashing.

```rust
use rustpix_algorithms::grid::GridClustering;

let clustering = GridClustering::new(5.0, 75.0);
let clusters = clustering.cluster(&hits);
```

## Performance

| Algorithm | Speed      | Memory     | Best For                    |
| --------- | ---------- | ---------- | --------------------------- |
| ABS       | Fastest    | Low        | Dense clusters              |
| DBSCAN    | Moderate   | Moderate   | Variable density            |
| Graph     | Fast       | Low        | General purpose             |
| Grid      | Very Fast  | Moderate   | Large datasets, parallelism |

## License

MIT License - see [LICENSE](../LICENSE) for details.