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
use std::collections::{BTreeMap, BTreeSet};
use anyhow::Result;
use abstutil::{Tags, Timer};
use geom::{Bounds, Circle, Distance, PolyLine, Polygon, Pt2D};
use crate::{osm, IntersectionType, LaneSpec};
use crate::{OriginalRoad, RawMap};
pub struct InitialMap {
pub roads: BTreeMap<OriginalRoad, Road>,
pub intersections: BTreeMap<osm::NodeID, Intersection>,
pub bounds: Bounds,
}
pub struct Road {
pub id: OriginalRoad,
pub src_i: osm::NodeID,
pub dst_i: osm::NodeID,
pub trimmed_center_pts: PolyLine,
pub half_width: Distance,
pub lane_specs_ltr: Vec<LaneSpec>,
pub osm_tags: Tags,
}
impl Road {
pub fn new(map: &RawMap, id: OriginalRoad) -> Result<Road> {
let road = &map.roads[&id];
let mut lane_specs_ltr = crate::lane_specs::get_lane_specs_ltr(&road.osm_tags, &map.config);
for l in &mut lane_specs_ltr {
l.width *= road.scale_width;
}
let (trimmed_center_pts, total_width) = map.untrimmed_road_geometry(id)?;
Ok(Road {
id,
src_i: id.i1,
dst_i: id.i2,
trimmed_center_pts,
half_width: total_width / 2.0,
lane_specs_ltr,
osm_tags: road.osm_tags.clone(),
})
}
}
pub struct Intersection {
pub id: osm::NodeID,
pub polygon: Polygon,
pub roads: BTreeSet<OriginalRoad>,
pub intersection_type: IntersectionType,
pub elevation: Distance,
}
impl InitialMap {
pub fn new(raw: &RawMap, bounds: &Bounds, timer: &mut Timer) -> InitialMap {
let mut m = InitialMap {
roads: BTreeMap::new(),
intersections: BTreeMap::new(),
bounds: *bounds,
};
for (id, i) in &raw.intersections {
m.intersections.insert(
*id,
Intersection {
id: *id,
polygon: Circle::new(Pt2D::new(0.0, 0.0), Distance::meters(1.0)).to_polygon(),
roads: BTreeSet::new(),
intersection_type: i.intersection_type,
elevation: i.elevation,
},
);
}
for (id, road) in &raw.roads {
let id = *id;
if id.i1 == id.i2 {
warn!("Skipping loop {}", id);
continue;
}
if PolyLine::new(road.center_points.clone()).is_err() {
warn!("Skipping broken geom {}", id);
continue;
}
m.intersections.get_mut(&id.i1).unwrap().roads.insert(id);
m.intersections.get_mut(&id.i2).unwrap().roads.insert(id);
m.roads.insert(id, Road::new(raw, id).unwrap());
}
timer.start_iter("find each intersection polygon", m.intersections.len());
for i in m.intersections.values_mut() {
timer.next();
match crate::intersection_polygon(
i.id,
i.roads.clone(),
&mut m.roads,
&raw.intersections[&i.id].trim_roads_for_merging,
) {
Ok((poly, _)) => {
i.polygon = poly;
}
Err(err) => {
error!("Can't make intersection geometry for {}: {}", i.id, err);
let r = &m.roads[i.roads.iter().next().unwrap()];
let pt = if r.src_i == i.id {
r.trimmed_center_pts.first_pt()
} else {
r.trimmed_center_pts.last_pt()
};
i.polygon = Circle::new(pt, Distance::meters(3.0)).to_polygon();
i.intersection_type = IntersectionType::StopSign;
}
}
}
let min_len = Distance::meters(5.0);
for i in m.intersections.values_mut() {
if i.intersection_type != IntersectionType::Border {
continue;
}
let r = m.roads.get_mut(i.roads.iter().next().unwrap()).unwrap();
if r.trimmed_center_pts.length() >= min_len {
continue;
}
if r.dst_i == i.id {
r.trimmed_center_pts = r.trimmed_center_pts.extend_to_length(min_len);
} else {
r.trimmed_center_pts = r
.trimmed_center_pts
.reversed()
.extend_to_length(min_len)
.reversed();
}
i.polygon = crate::intersection_polygon(
i.id,
i.roads.clone(),
&mut m.roads,
&raw.intersections[&i.id].trim_roads_for_merging,
)
.unwrap()
.0;
info!(
"Shifted border {} out a bit to make the road a reasonable length",
i.id
);
}
m
}
}