Struct Canvas

pub struct Canvas {
    pub(crate) window: PistonWindow,
    pub(crate) points: Option<Vec<Point>>,
    pub(crate) point_count: usize,
    pub(crate) min_distance: f64,
    pub(crate) window_size: [f64; 2],
}

The drawing surface and piston window used to display the set of points.

Fields

window: PistonWindow

points: Option<Vec<Point>>

point_count: usize

min_distance: f64

window_size: [f64; 2]

Implementations

impl Canvas

pub fn new(point_count: usize, min_distance: f64) -> Self

Returns a new canvas

Arguments

• point_count - the number of points in the set
• min_distance - if a pair of points are closer than the min_distance, then one of the points will be removed and replaced with a fresh random point

Examples found in repository

examples/decluster_demo.rs (line 30)

fn main() {
    let point_count = 500;
    let min_distance = 66.0;

    Canvas::new(point_count, min_distance).show();
}

pub fn show(&mut self)

Begins the decluster loop by listening for render and update window events.

Examples found in repository

examples/decluster_demo.rs (line 30)

fn main() {
    let point_count = 500;
    let min_distance = 66.0;

    Canvas::new(point_count, min_distance).show();
}

pub(crate) fn render(&mut self, e: &Event, args: RenderArgs)

Lazy initialises the the set of points to random locations. This needs to be delayed until the first render so the full-size window dimensions can be can be used to constrain the random locations. This window size only become available when the window is first rendered.

pub(crate) fn update(&mut self)

Declusters the current set of points then refills the set with new randomised points. This amounts to a random search for a viable set, that is a set of points where each individual point is separated by at least the minimum distance.