rene 0.2.0

Computational geometry.
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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179

use core::convert::From;
use std::cmp::Ordering;

use crate::iteration::PairwiseCombinations;
use crate::operations::Orient;
use crate::relatable::Relation;
use crate::relating::segment_endpoints;

use super::event::Event;
use super::events_registry::EventsRegistry;

pub(crate) struct Sweep<Point> {
    events_registry: EventsRegistry<Point, false>,
    next_start_event: Option<usize>,
    segments_ids_pairs: PairwiseCombinations<usize>,
    start_event: Option<usize>,
}

impl<Point, Input> From<Input> for Sweep<Point>
where
    EventsRegistry<Point, false>: From<Input> + Iterator<Item = Event>,
{
    fn from(input: Input) -> Self {
        let mut events_registry = EventsRegistry::from(input);
        let next_start_event = events_registry.next();
        Self {
            events_registry,
            next_start_event,
            segments_ids_pairs: PairwiseCombinations::default(),
            start_event: None,
        }
    }
}

impl<Point> Sweep<Point> {
    pub(super) fn get_segment_end(&self, segment_id: usize) -> &Point {
        self.events_registry.get_segment_end(segment_id)
    }

    pub(super) fn get_segment_start(&self, segment_id: usize) -> &Point {
        self.events_registry.get_segment_start(segment_id)
    }
}

pub(crate) struct Intersection<Point> {
    pub(super) first_segment_id: usize,
    pub(super) second_segment_id: usize,
    pub(super) relation: Relation,
    pub(super) start: Point,
    pub(super) end: Point,
}

impl<Point: Clone + Ord> Iterator for Sweep<Point>
where
    EventsRegistry<Point, false>: Iterator<Item = Event>,
    for<'a> &'a Point: Orient,
{
    type Item = Intersection<Point>;

    fn next(&mut self) -> Option<Self::Item> {
        if let Some((first_segment_id, second_segment_id)) =
            self.segments_ids_pairs.next()
        {
            let first_start = self.get_segment_start(first_segment_id);
            let first_end = self.get_segment_end(first_segment_id);
            let second_start = self.get_segment_start(second_segment_id);
            let second_end = self.get_segment_end(second_segment_id);
            let (relation, start, end) = if first_segment_id
                == second_segment_id
            {
                (Relation::Equal, first_start, first_end)
            } else if !self
                .events_registry
                .are_collinear(first_segment_id, second_segment_id)
            {
                if let Some(start_event) = self.start_event {
                    let start =
                        self.events_registry.get_event_start(start_event);
                    (
                        if first_start == start
                            || first_end == start
                            || second_start == start
                            || second_end == start
                        {
                            Relation::Touch
                        } else {
                            Relation::Cross
                        },
                        start,
                        start,
                    )
                } else {
                    debug_assert!(first_start == second_start);
                    (Relation::Touch, first_start, first_start)
                }
            } else if first_start
                .max(second_start)
                .eq(first_end.min(second_end))
            {
                let point = first_start.max(second_start);
                (Relation::Touch, point, point)
            } else {
                match first_start.cmp(second_start) {
                    Ordering::Equal => match first_end.cmp(second_end) {
                        Ordering::Equal => {
                            (Relation::Equal, first_start, first_end)
                        }
                        Ordering::Greater => {
                            (Relation::Composite, first_start, second_end)
                        }
                        Ordering::Less => {
                            (Relation::Component, first_start, first_end)
                        }
                    },
                    Ordering::Greater => match first_end.cmp(second_end) {
                        Ordering::Greater => {
                            (Relation::Overlap, first_start, second_end)
                        }
                        _ => (Relation::Component, first_start, first_end),
                    },
                    Ordering::Less => match first_end.cmp(second_end) {
                        Ordering::Less => {
                            (Relation::Overlap, second_start, first_end)
                        }
                        _ => (Relation::Composite, second_start, second_end),
                    },
                }
            };
            debug_assert_eq!(
                relation,
                segment_endpoints::relate_to_segment_endpoints(
                    (first_start, first_end),
                    (second_start, second_end)
                )
            );
            Some(Intersection {
                first_segment_id,
                second_segment_id,
                relation,
                start: start.clone(),
                end: end.clone(),
            })
        } else if let Some(next_start_event) = self.next_start_event {
            self.populate_segments_ids_pairs(next_start_event);
            self.next()
        } else {
            None
        }
    }
}

impl<Point: PartialEq> Sweep<Point>
where
    EventsRegistry<Point, false>: Iterator<Item = Event>,
{
    fn populate_segments_ids_pairs(&mut self, start_event: Event) {
        let mut segments_ids_containing_start =
            Vec::from([self.events_registry.to_event_segment_id(start_event)]);
        while let Some(event) = self.events_registry.next() {
            if self
                .events_registry
                .get_event_start(start_event)
                .ne(self.events_registry.get_event_start(event))
            {
                self.segments_ids_pairs =
                    PairwiseCombinations::from(segments_ids_containing_start);
                (self.start_event, self.next_start_event) =
                    (self.next_start_event, Some(event));
                return;
            }
            segments_ids_containing_start
                .push(self.events_registry.to_event_segment_id(event));
        }
        self.segments_ids_pairs =
            PairwiseCombinations::from(segments_ids_containing_start);
        (self.start_event, self.next_start_event) =
            (self.next_start_event, None);
    }
}