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
#[cfg(test)]
#[allow(clippy::module_inception)]
mod tests {
use crate::TiledPolygonizer;
use geo::{Coord, Geometry, LineString, Rect};
#[test]
fn test_tiled_polygonization_grid() {
// Create a 2x2 grid of squares
// 0,0 - 10,0 - 20,0
// | | |
// 0,10- 10,10- 20,10
// | | |
// 0,20- 10,20- 20,20
let geoms = vec![
// Horizontals
Geometry::LineString(LineString::new(vec![
Coord { x: 0.0, y: 0.0 },
Coord { x: 20.0, y: 0.0 },
])),
Geometry::LineString(LineString::new(vec![
Coord { x: 0.0, y: 10.0 },
Coord { x: 20.0, y: 10.0 },
])),
Geometry::LineString(LineString::new(vec![
Coord { x: 0.0, y: 20.0 },
Coord { x: 20.0, y: 20.0 },
])),
// Verticals
Geometry::LineString(LineString::new(vec![
Coord { x: 0.0, y: 0.0 },
Coord { x: 0.0, y: 20.0 },
])),
Geometry::LineString(LineString::new(vec![
Coord { x: 10.0, y: 0.0 },
Coord { x: 10.0, y: 20.0 },
])),
Geometry::LineString(LineString::new(vec![
Coord { x: 20.0, y: 0.0 },
Coord { x: 20.0, y: 20.0 },
])),
];
// BBox covers 0,0 to 20,20
let bbox = Rect::new(Coord { x: 0.0, y: 0.0 }, Coord { x: 20.0, y: 20.0 });
// Tile size 10 (exactly matching lines) or 15 (offset)
// Let's try 15 to ensure polygons span tiles
// Add buffer of 5.0 to ensure full polygons are captured in each tile
let mut tiler = TiledPolygonizer::new(bbox, 15.0).with_buffer(5.0);
for g in &geoms {
tiler.add_geometry(g);
}
let polys = tiler.polygonize();
// Should find 4 polygons
assert_eq!(polys.len(), 4);
// Check areas
for p in polys {
assert!((p.unsigned_area_2d() - 100.0).abs() < 1e-6);
}
}
#[test]
fn test_tiled_polygonization_exact_boundary() {
// Tile size 10, lines on 10.
// This tests the "ownership" logic at boundaries.
let geoms = vec![
// Horizontals
Geometry::LineString(LineString::new(vec![
Coord { x: 0.0, y: 0.0 },
Coord { x: 20.0, y: 0.0 },
])),
Geometry::LineString(LineString::new(vec![
Coord { x: 0.0, y: 10.0 },
Coord { x: 20.0, y: 10.0 },
])),
Geometry::LineString(LineString::new(vec![
Coord { x: 0.0, y: 20.0 },
Coord { x: 20.0, y: 20.0 },
])),
// Verticals
Geometry::LineString(LineString::new(vec![
Coord { x: 0.0, y: 0.0 },
Coord { x: 0.0, y: 20.0 },
])),
Geometry::LineString(LineString::new(vec![
Coord { x: 10.0, y: 0.0 },
Coord { x: 10.0, y: 20.0 },
])),
Geometry::LineString(LineString::new(vec![
Coord { x: 20.0, y: 0.0 },
Coord { x: 20.0, y: 20.0 },
])),
];
let bbox = Rect::new(Coord { x: 0.0, y: 0.0 }, Coord { x: 20.0, y: 20.0 });
// Tile size 10.
// Tiles: [0,10]x[0,10], [10,20]x[0,10], etc.
let mut tiler = TiledPolygonizer::new(bbox, 10.0);
for g in &geoms {
tiler.add_geometry(g);
}
let polys = tiler.polygonize();
assert_eq!(polys.len(), 4);
}
#[test]
fn test_tiled_polygonization_centroid_on_max_boundary() {
// A square centered at (20, 5).
// 19,0 -> 21,0 -> 21,10 -> 19,10 -> 19,0.
// Centroid is x=20, y=5.
// BBox passed is 0,0 -> 20,20.
// This simulates a polygon on the edge of the world.
let geoms = vec![Geometry::LineString(LineString::new(vec![
Coord { x: 19.0, y: 0.0 },
Coord { x: 21.0, y: 0.0 },
Coord { x: 21.0, y: 10.0 },
Coord { x: 19.0, y: 10.0 },
Coord { x: 19.0, y: 0.0 },
]))];
// BBox 0,0 -> 20,20.
let bbox = Rect::new(Coord { x: 0.0, y: 0.0 }, Coord { x: 20.0, y: 20.0 });
// Tile size 10.
// Tiles: [0,10) and [10,20).
let mut tiler = TiledPolygonizer::new(bbox, 10.0).with_buffer(5.0);
for g in &geoms {
tiler.add_geometry(g);
}
let polys = tiler.polygonize();
assert_eq!(
polys.len(),
1,
"Should identify polygon with centroid on the boundary"
);
}
}