drawrs 0.2.0

A tracing engine for Rust
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

use crate::utils::geometry::Point;
use std::collections::{HashMap, HashSet};

pub fn find_next_point(
    current: Point,
    spatial_index: &HashMap<(i32, i32), Vec<Point>>,
    visited: &HashSet<Point>,
    max_distance: i32,
) -> Option<Point> {
    let grid_size = max_distance.max(1);
    let current_grid_x = current.x / grid_size;
    let current_grid_y = current.y / grid_size;

    let mut best_point = None;
    let mut best_distance = i32::MAX;

    for dx in -1..=1 {
        for dy in -1..=1 {
            let grid_key = (current_grid_x + dx, current_grid_y + dy);
            if let Some(points) = spatial_index.get(&grid_key) {
                for &point in points {
                    if !visited.contains(&point) {
                        let dist_sq = current.distance_squared(&point);
                        if dist_sq <= max_distance * max_distance && dist_sq < best_distance {
                            best_distance = dist_sq;
                            best_point = Some(point);
                        }
                    }
                }
            }
        }
    }

    best_point
}

pub fn trace_line(
    start: Point,
    spatial_index: &HashMap<(i32, i32), Vec<Point>>,
    visited: &mut HashSet<Point>,
    max_distance: i32,
) -> Vec<Point> {
    let mut line = vec![start];
    visited.insert(start);

    while let Some(next) =
        find_next_point(*line.last().unwrap(), spatial_index, visited, max_distance)
    {
        line.push(next);
        visited.insert(next);
    }

    line
}