-
Notifications
You must be signed in to change notification settings - Fork 187
/
Copy pathwedge_relations_test.go
165 lines (157 loc) · 5.73 KB
/
wedge_relations_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
152
153
154
155
156
157
158
159
160
161
162
163
164
165
// Copyright 2017 Google Inc. All rights reserved.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package s2
import (
"testing"
"github.com/golang/geo/r3"
)
func TestWedgeRelations(t *testing.T) {
// For simplicity, all of these tests use an origin of (0, 0, 1).
// This shouldn't matter as long as the lower-level primitives are
// implemented correctly.
ab1 := Point{r3.Vector{X: 0, Y: 0, Z: 1}.Normalize()}
tests := []struct {
desc string
a0, a1, b0, b1 Point
contains bool
intersects bool
relation WedgeRel
}{
{
desc: "Intersection in one wedge",
a0: Point{r3.Vector{X: -1, Y: 0, Z: 10}},
a1: Point{r3.Vector{X: 1, Y: 2, Z: 10}},
b0: Point{r3.Vector{X: 0, Y: 1, Z: 10}},
b1: Point{r3.Vector{X: 1, Y: -2, Z: 10}},
contains: false,
intersects: true,
relation: WedgeProperlyOverlaps,
},
{
desc: "Intersection in two wedges",
a0: Point{r3.Vector{X: -1, Y: -1, Z: 10}},
a1: Point{r3.Vector{X: 1, Y: -1, Z: 10}},
b0: Point{r3.Vector{X: 1, Y: 0, Z: 10}},
b1: Point{r3.Vector{X: -1, Y: 1, Z: 10}},
contains: false,
intersects: true,
relation: WedgeProperlyOverlaps,
},
{
desc: "Normal containment",
a0: Point{r3.Vector{X: -1, Y: -1, Z: 10}},
a1: Point{r3.Vector{X: 1, Y: -1, Z: 10}},
b0: Point{r3.Vector{X: -1, Y: 0, Z: 10}},
b1: Point{r3.Vector{X: 1, Y: 0, Z: 10}},
contains: true,
intersects: true,
relation: WedgeProperlyContains,
},
{
desc: "Containment with equality on one side",
a0: Point{r3.Vector{X: 2, Y: 1, Z: 10}},
a1: Point{r3.Vector{X: -1, Y: -1, Z: 10}},
b0: Point{r3.Vector{X: 2, Y: 1, Z: 10}},
b1: Point{r3.Vector{X: 1, Y: -5, Z: 10}},
contains: true,
intersects: true,
relation: WedgeProperlyContains,
},
{
desc: "Containment with equality on the other side",
a0: Point{r3.Vector{X: 2, Y: 1, Z: 10}},
a1: Point{r3.Vector{X: -1, Y: -1, Z: 10}},
b0: Point{r3.Vector{X: 1, Y: -2, Z: 10}},
b1: Point{r3.Vector{X: -1, Y: -1, Z: 10}},
contains: true,
intersects: true,
relation: WedgeProperlyContains,
},
{
desc: "Containment with equality on both sides",
a0: Point{r3.Vector{X: -2, Y: 3, Z: 10}},
a1: Point{r3.Vector{X: 4, Y: -5, Z: 10}},
b0: Point{r3.Vector{X: -2, Y: 3, Z: 10}},
b1: Point{r3.Vector{X: 4, Y: -5, Z: 10}},
contains: true,
intersects: true,
relation: WedgeEquals,
},
{
desc: "Disjoint with equality on one side",
a0: Point{r3.Vector{X: -2, Y: 3, Z: 10}},
a1: Point{r3.Vector{X: 4, Y: -5, Z: 10}},
b0: Point{r3.Vector{X: 4, Y: -5, Z: 10}},
b1: Point{r3.Vector{X: -2, Y: -3, Z: 10}},
contains: false,
intersects: false,
relation: WedgeIsDisjoint,
},
{
desc: "Disjoint with equality on the other side",
a0: Point{r3.Vector{X: -2, Y: 3, Z: 10}},
a1: Point{r3.Vector{X: 0, Y: 5, Z: 10}},
b0: Point{r3.Vector{X: 4, Y: -5, Z: 10}},
b1: Point{r3.Vector{X: -2, Y: 3, Z: 10}},
contains: false,
intersects: false,
relation: WedgeIsDisjoint,
},
{
desc: "Disjoint with equality on both sides",
a0: Point{r3.Vector{X: -2, Y: 3, Z: 10}},
a1: Point{r3.Vector{X: 4, Y: -5, Z: 10}},
b0: Point{r3.Vector{X: 4, Y: -5, Z: 10}},
b1: Point{r3.Vector{X: -2, Y: 3, Z: 10}},
contains: false,
intersects: false,
relation: WedgeIsDisjoint,
},
{
desc: "B contains A with equality on one side",
a0: Point{r3.Vector{X: 2, Y: 1, Z: 10}},
a1: Point{r3.Vector{X: 1, Y: -5, Z: 10}},
b0: Point{r3.Vector{X: 2, Y: 1, Z: 10}},
b1: Point{r3.Vector{X: -1, Y: -1, Z: 10}},
contains: false,
intersects: true,
relation: WedgeIsProperlyContained,
},
{
desc: "B contains A with equality on the other side",
a0: Point{r3.Vector{X: 2, Y: 1, Z: 10}},
a1: Point{r3.Vector{X: 1, Y: -5, Z: 10}},
b0: Point{r3.Vector{X: -2, Y: 1, Z: 10}},
b1: Point{r3.Vector{X: 1, Y: -5, Z: 10}},
contains: false,
intersects: true,
relation: WedgeIsProperlyContained,
},
}
for _, test := range tests {
test.a0 = Point{test.a0.Normalize()}
test.a1 = Point{test.a1.Normalize()}
test.b0 = Point{test.b0.Normalize()}
test.b1 = Point{test.b1.Normalize()}
if got := WedgeContains(test.a0, ab1, test.a1, test.b0, test.b1); got != test.contains {
t.Errorf("%s: WedgeContains(%v, %v, %v, %v, %v) = %t, want %t", test.desc, test.a0, ab1, test.a1, test.b0, test.b1, got, test.contains)
}
if got := WedgeIntersects(test.a0, ab1, test.a1, test.b0, test.b1); got != test.intersects {
t.Errorf("%s: WedgeIntersects(%v, %v, %v, %v, %v) = %t, want %t", test.desc, test.a0, ab1, test.a1, test.b0, test.b1, got, test.intersects)
}
if got := WedgeRelation(test.a0, ab1, test.a1, test.b0, test.b1); got != test.relation {
t.Errorf("%s: WedgeRelation(%v, %v, %v, %v, %v) = %v, want %v", test.desc, test.a0, ab1, test.a1, test.b0, test.b1, got, test.relation)
}
}
}