linesweeper 0.3.0

Robust sweep-line algorithm and two-dimensional boolean ops
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

//! The sweep-line implementation.
//!
//! The details of this implementation are described in the `docs` directory.
//! The main entry point is [`Sweeper`], which computes all the intersection
//! points between a collection of line segments, and makes them available
//! sweep-line by sweep-line.

mod output_event;
mod range;
mod sweep_line;

pub use output_event::OutputEvent;
pub use range::{SegmentsConnectedAtX, SweepLineRange, SweepLineRangeBuffers};
pub use sweep_line::{ChangedInterval, SweepLine, SweepLineBuffers, Sweeper};

use crate::Segments;

/// Runs the sweep-line algorithm, calling the provided callback on every output point.
pub fn sweep<C: FnMut(f64, OutputEvent)>(segments: &Segments, eps: f64, mut callback: C) {
    let mut state = Sweeper::new(segments, eps);
    let mut range_bufs = SweepLineRangeBuffers::default();
    let mut line_bufs = SweepLineBuffers::default();
    while let Some(mut line) = state.next_line(&mut line_bufs) {
        let y = line.y();
        while let Some(mut range) = line.next_range(&mut range_bufs, segments) {
            while let Some(events) = range.events() {
                for ev in events {
                    callback(y, ev);
                }
            }
        }
    }
}