/
three_corners.go
237 lines (229 loc) · 10.2 KB
/
three_corners.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
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
package lib
type bestThreeCornersQuery struct {
onIndexEntryFilled func()
// preallocated storage for lists of portals within triangles at consecutive recursion depths
portalsInTriangle1 [][]portalData
portalsInTriangle0 [][]portalData
portalsInTriangle2 [][]portalData
portals0 []portalData
portals1 []portalData
portals2 []portalData
numCornerChanges []uint16
index []bestSolution
numPortals1x2 uint
numPortals2 uint
numPortals1 portalIndex
numPortals0 portalIndex
depth uint16
}
func newBestThreeCornersQuery(portals0, portals1, portals2 []portalData, onIndexEntryFilled func()) *bestThreeCornersQuery {
numPortals0x1x2 := uint(len(portals0)) * uint(len(portals1)) * uint(len(portals2))
index := make([]bestSolution, numPortals0x1x2)
numCornerChanges := make([]uint16, numPortals0x1x2)
for i := 0; i < len(index); i++ {
index[i].Length = invalidLength
}
return &bestThreeCornersQuery{
portals0: append(make([]portalData, 0, len(portals0)), portals0...),
numPortals0: portalIndex(len(portals0)),
portals1: append(make([]portalData, 0, len(portals1)), portals1...),
numPortals1: portalIndex(len(portals1)),
portals2: append(make([]portalData, 0, len(portals2)), portals2...),
numPortals2: uint(len(portals2)),
numPortals1x2: uint(len(portals1)) * uint(len(portals2)),
index: index,
numCornerChanges: numCornerChanges,
onIndexEntryFilled: onIndexEntryFilled,
portalsInTriangle0: make([][]portalData, len(portals0)+len(portals1)+len(portals2)),
portalsInTriangle1: make([][]portalData, len(portals0)+len(portals1)+len(portals2)),
portalsInTriangle2: make([][]portalData, len(portals0)+len(portals1)+len(portals2)),
}
}
func (q *bestThreeCornersQuery) getIndex(i0, i1, i2 portalIndex) bestSolution {
return q.index[uint(i0)*q.numPortals1x2+uint(i1)*q.numPortals2+uint(i2)]
}
func (q *bestThreeCornersQuery) setIndex(i0, i1, i2 portalIndex, s bestSolution) {
q.index[uint(i0)*q.numPortals1x2+uint(i1)*q.numPortals2+uint(i2)] = s
}
func (q *bestThreeCornersQuery) getNumCornerChanges(i0, i1, i2 portalIndex) uint16 {
return q.numCornerChanges[uint(i0)*q.numPortals1x2+uint(i1)*q.numPortals2+uint(i2)]
}
func (q *bestThreeCornersQuery) setNumCornerChanges(i0, i1, i2 portalIndex, n uint16) {
q.numCornerChanges[uint(i0)*q.numPortals1x2+uint(i1)*q.numPortals2+uint(i2)] = n
}
func (q *bestThreeCornersQuery) findBestThreeCorner(p0, p1, p2 portalData) {
if q.getIndex(p0.Index, p1.Index, p2.Index).Length != invalidLength {
return
}
q.portalsInTriangle0[0] = portalsInsideTriangle(q.portals0, p0, p1, p2, q.portalsInTriangle0[0])
q.portalsInTriangle1[0] = portalsInsideTriangle(q.portals1, p0, p1, p2, q.portalsInTriangle1[0])
q.portalsInTriangle2[0] = portalsInsideTriangle(q.portals2, p0, p1, p2, q.portalsInTriangle2[0])
q.findBestThreeCornerAux(p0, p1, p2, q.portalsInTriangle0[0], q.portalsInTriangle1[0], q.portalsInTriangle2[0])
}
func (q *bestThreeCornersQuery) findBestThreeCornerAux(p0, p1, p2 portalData, candidates0, candidates1, candidates2 []portalData) (bestSolution, uint16) {
q.depth++
q.portalsInTriangle0[q.depth] = append(q.portalsInTriangle0[q.depth][:0], candidates0...)
q.portalsInTriangle1[q.depth] = append(q.portalsInTriangle1[q.depth][:0], candidates1...)
q.portalsInTriangle2[q.depth] = append(q.portalsInTriangle2[q.depth][:0], candidates2...)
var bestTC bestSolution
var bestNumCornerChanges uint16
for _, portal := range q.portalsInTriangle0[q.depth] {
candidate := q.getIndex(portal.Index, p1.Index, p2.Index)
numCornerChanges := q.getNumCornerChanges(portal.Index, p1.Index, p2.Index)
if candidate.Length == invalidLength {
candidatesInWedge0 := partitionPortalsInsideWedge(candidates0, portal, p1, p2)
candidatesInWedge1 := partitionPortalsInsideWedge(candidates1, portal, p1, p2)
candidatesInWedge2 := partitionPortalsInsideWedge(candidates2, portal, p1, p2)
candidate, numCornerChanges = q.findBestThreeCornerAux(portal, p1, p2, candidatesInWedge0, candidatesInWedge1, candidatesInWedge2)
}
if candidate.Length > 0 && candidate.Index >= q.numPortals0 {
numCornerChanges = numCornerChanges + 1
}
candidate.Length = candidate.Length + 1
if candidate.Length > bestTC.Length || (candidate.Length == bestTC.Length && numCornerChanges < bestNumCornerChanges) {
bestTC.Length = candidate.Length
bestTC.Index = portal.Index
bestNumCornerChanges = numCornerChanges
}
}
for _, portal := range q.portalsInTriangle1[q.depth] {
candidate := q.getIndex(p0.Index, portal.Index, p2.Index)
numCornerChanges := q.getNumCornerChanges(p0.Index, portal.Index, p2.Index)
if candidate.Length == invalidLength {
candidatesInWedge0 := partitionPortalsInsideWedge(candidates0, portal, p0, p2)
candidatesInWedge1 := partitionPortalsInsideWedge(candidates1, portal, p0, p2)
candidatesInWedge2 := partitionPortalsInsideWedge(candidates2, portal, p0, p2)
candidate, numCornerChanges = q.findBestThreeCornerAux(p0, portal, p2, candidatesInWedge0, candidatesInWedge1, candidatesInWedge2)
}
if candidate.Length > 0 && (candidate.Index < q.numPortals0 || candidate.Index >= q.numPortals0+q.numPortals1) {
numCornerChanges = numCornerChanges + 1
}
candidate.Length = candidate.Length + 1
if candidate.Length > bestTC.Length || (candidate.Length == bestTC.Length && numCornerChanges < bestNumCornerChanges) {
bestTC.Length = candidate.Length
bestTC.Index = portal.Index + q.numPortals0
bestNumCornerChanges = numCornerChanges
}
}
for _, portal := range q.portalsInTriangle2[q.depth] {
candidate := q.getIndex(p0.Index, p1.Index, portal.Index)
numCornerChanges := q.getNumCornerChanges(p0.Index, p1.Index, portal.Index)
if candidate.Length == invalidLength {
candidatesInWedge0 := partitionPortalsInsideWedge(candidates0, portal, p0, p1)
candidatesInWedge1 := partitionPortalsInsideWedge(candidates1, portal, p0, p1)
candidatesInWedge2 := partitionPortalsInsideWedge(candidates2, portal, p0, p1)
candidate, numCornerChanges = q.findBestThreeCornerAux(p0, p1, portal, candidatesInWedge0, candidatesInWedge1, candidatesInWedge2)
}
if candidate.Length > 0 && candidate.Index < q.numPortals0+q.numPortals1 {
numCornerChanges = numCornerChanges + 1
}
candidate.Length = candidate.Length + 1
if candidate.Length > bestTC.Length || (candidate.Length == bestTC.Length && numCornerChanges < bestNumCornerChanges) {
bestTC.Length = candidate.Length
bestTC.Index = portal.Index + q.numPortals0 + q.numPortals1
bestNumCornerChanges = numCornerChanges
}
}
q.setIndex(p0.Index, p1.Index, p2.Index, bestTC)
q.setNumCornerChanges(p0.Index, p1.Index, p2.Index, bestNumCornerChanges)
q.onIndexEntryFilled()
q.depth--
return bestTC, bestNumCornerChanges
}
// LargestThreeCorner - Find best way to connect three groups of portals
func LargestThreeCorner(portals0, portals1, portals2 []Portal, progressFunc func(int, int)) []IndexedPortal {
portalsData0 := portalsToPortalData(portals0)
portalsData1 := portalsToPortalData(portals1)
portalsData2 := portalsToPortalData(portals2)
numIndexEntries := len(portals0) * len(portals1) * len(portals2)
everyNth := numIndexEntries / 1000
if everyNth < 1 {
everyNth = 1
}
indexEntriesFilled := 0
indexEntriesFilledModN := 0
onFillIndexEntry := func() {
indexEntriesFilled++
indexEntriesFilledModN++
if indexEntriesFilledModN == everyNth {
indexEntriesFilledModN = 0
progressFunc(indexEntriesFilled, numIndexEntries)
}
}
progressFunc(0, numIndexEntries)
q := newBestThreeCornersQuery(portalsData0, portalsData1, portalsData2, onFillIndexEntry)
for _, p0 := range portalsData0 {
for _, p1 := range portalsData1 {
for _, p2 := range portalsData2 {
q.findBestThreeCorner(p0, p1, p2)
}
}
}
progressFunc(numIndexEntries, numIndexEntries)
var largestTC bestSolution
var bestNumCornerChanges uint16
var bestP0, bestP1, bestP2 portalData
for _, p0 := range portalsData0 {
for _, p1 := range portalsData1 {
for _, p2 := range portalsData2 {
solution := q.getIndex(p0.Index, p1.Index, p2.Index)
numCornerChanges := q.getNumCornerChanges(p0.Index, p1.Index, p2.Index)
if solution.Length > largestTC.Length || (solution.Length == largestTC.Length && numCornerChanges < bestNumCornerChanges) {
largestTC = solution
bestNumCornerChanges = numCornerChanges
bestP0, bestP1, bestP2 = p0, p1, p2
}
}
}
}
numPortals0 := portalIndex(len(portals0))
numPortals1 := portalIndex(len(portals1))
k0, k1, k2 := bestP0.Index, bestP1.Index, bestP2.Index
result := append(make([]IndexedPortal, 0, largestTC.Length+3),
IndexedPortal{Index: 0, Portal: portals0[k0]},
IndexedPortal{Index: 1, Portal: portals1[k1]},
IndexedPortal{Index: 2, Portal: portals2[k2]})
for {
sol := q.getIndex(k0, k1, k2)
if sol.Length == 0 {
break
}
if sol.Index < numPortals0 {
result = append(result, IndexedPortal{Index: 0, Portal: portals0[sol.Index]})
k0 = sol.Index
} else {
sol.Index = sol.Index - numPortals0
if sol.Index < numPortals1 {
result = append(result, IndexedPortal{Index: 1, Portal: portals1[sol.Index]})
k1 = sol.Index
} else {
sol.Index = sol.Index - numPortals1
result = append(result, IndexedPortal{Index: 2, Portal: portals2[sol.Index]})
k2 = sol.Index
}
}
}
return result
}
func ThreeCornersPolyline(result []IndexedPortal) []Portal {
indexedPortalList := []IndexedPortal{result[0], result[1]}
lastIndexPortal := [3]IndexedPortal{result[0], result[1], {}}
for _, indexedPortal := range result[2:] {
lastIndex := indexedPortalList[len(indexedPortalList)-1].Index
if indexedPortal.Index == lastIndex {
lastIndex = (lastIndex + 1) % 3
indexedPortalList = append(indexedPortalList, lastIndexPortal[lastIndex])
}
nextIndex := 3 - indexedPortal.Index - lastIndex
indexedPortalList = append(indexedPortalList, indexedPortal, lastIndexPortal[nextIndex])
lastIndexPortal[indexedPortal.Index] = indexedPortal
}
portalList := make([]Portal, 0, len(indexedPortalList))
for _, indexedPortal := range indexedPortalList {
portalList = append(portalList, indexedPortal.Portal)
}
return portalList
}
func ThreeCornersDrawToolsString(result []IndexedPortal) string {
return "[\n" + PolylineFromPortalList(ThreeCornersPolyline(result)) + "\n]"
}