Struct BentleyOttmannEvents 

pub struct BentleyOttmannEvents { /* private fields */ }

Event queue for the Bentley-Ottmann sweep line. Events are ordered by x then by y (ties broken by event type).

Implementations

impl BentleyOttmannEvents

pub fn new(segs: &[(Point2D, Point2D)]) -> Self

Create the event queue from a list of segments.

pub fn add_intersection(&mut self, x: f64, y: f64, seg_a: usize, seg_b: usize)

Insert an intersection event (for future processing)

pub fn pop(&mut self) -> Option<SweepEvent>

Pop the next event from the queue

pub fn len(&self) -> usize

Number of pending events

pub fn is_empty(&self) -> bool

True if no events remain

pub fn all_intersections(&self) -> Vec<Point2D>

Report all pairwise intersection points among the segments (naive O(n²)). This uses the event queue structure to report events in sweep order.