forked from briansorahan/geo
/
contains_test.go
151 lines (132 loc) · 2.68 KB
/
contains_test.go
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
package geo
import (
"testing"
kdgeo "github.com/kellydunn/golang-geo"
"github.com/paulsmith/gogeos/geos"
)
func BenchmarkGeosPaulSmit(b *testing.B) {
// Setup
polygon, err := geos.NewPolygon([]geos.Coord{
{0, 1, 0},
{1, 2, 0},
{2, 1, 0},
{2, 0, 0},
{1, -1, 0},
{0, 0, 0},
{0, 1, 0},
})
if err != nil {
b.Fatal(err)
}
point, err := geos.NewPoint(geos.Coord{X: 1, Y: 0, Z: 0})
if err != nil {
b.Fatal(err)
}
b.ResetTimer()
// Test
for i := 0; i < b.N; i++ {
contains, err := polygon.Contains(point)
if err != nil {
b.Fatal(err)
}
if !contains {
b.Fatal("not contains")
}
}
}
func BenchmarkGeoKellyDunn(b *testing.B) {
// Setup
polygon := kdgeo.NewPolygon([]*kdgeo.Point{
kdgeo.NewPoint(0, 1),
kdgeo.NewPoint(1, 2),
kdgeo.NewPoint(2, 1),
kdgeo.NewPoint(2, 0),
kdgeo.NewPoint(1, -1),
kdgeo.NewPoint(0, 0),
kdgeo.NewPoint(0, 1),
})
point := kdgeo.NewPoint(1, 0)
b.ResetTimer()
// Test
for i := 0; i < b.N; i++ {
if contains := polygon.Contains(point); !contains {
b.Fatal("not contains")
}
}
}
// TODO: make gdal easy to use
// const WGS84 = `
// GEOGCS["WGS 84",
// DATUM["WGS_1984",
// SPHEROID["WGS 84",6378137,298.257223563,
// AUTHORITY["EPSG","7030"]],
// AUTHORITY["EPSG","6326"]],
// PRIMEM["Greenwich",0,
// AUTHORITY["EPSG","8901"]],
// UNIT["degree",0.01745329251994328,
// AUTHORITY["EPSG","9122"]],
// AUTHORITY["EPSG","4326"]]
// `
// func BenchmarkSorahanGdal(b *testing.B) {
// // Setup
// sref := gdal.CreateSpatialReference(WGS84)
// polygon, err := gdal.CreateFromWKT("POLYGON(0 1, 1 2, 2 1, 2 0, 1 -1, 0 0, 0 1)", sref)
// if err != nil {
// b.Fatal(err)
// }
// point, err := gdal.CreateFromWKT("POINT(1 0)", sref)
// if err != nil {
// b.Fatal(err)
// }
// b.ResetTimer()
// // Test
// for i := 0; i < b.N; i++ {
// if contains := polygon.Contains(point); !contains {
// b.Fatal("not contains")
// }
// }
// }
func BenchmarkBrian(b *testing.B) {
// Setup
polygon := Polygon([][][2]float64{
{
{0, 1},
{1, 2},
{2, 1},
{2, 0},
{1, -1},
{0, 0},
{0, 1},
},
})
point := Point{1, 0}
b.ResetTimer()
// Test
for i := 0; i < b.N; i++ {
if contains := polygon.Contains(point); !contains {
b.Fatal("not contains")
}
}
}
// func BenchmarkYan(b *testing.B) {
// // Setup
// polygon := Coordinates{
// {
// {0, 1},
// {1, 2},
// {2, 1},
// {2, 0},
// {1, -1},
// {0, 0},
// {0, 1},
// },
// }
// point := Coordinate{1, 0}
// b.ResetTimer()
// // Test
// for i := 0; i < b.N; i++ {
// if contains := InsidePolygon(polygon, point); !contains {
// b.Fatal("not contains")
// }
// }
// }