aboutsummaryrefslogtreecommitdiff
path: root/pathfind.go
blob: 015ff7e74b419634b03d2218a469f1116844cf18 (plain)
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
package main

import (
	"github.com/anon55555/mt"
	"math"
	"sync"
)

type PathfindEdge struct {
	src, dst [3]int16
	weight   float64
}

const pfMaxtp float64 = 4.317 * 10.0 * 0.5
const pfMaxtpSq float64 = pfMaxtp * pfMaxtp

var pfDirs = [6][3]int16{
	[3]int16{+1, 0, 0},
	[3]int16{-1, 0, 0},
	[3]int16{0, +1, 0},
	[3]int16{0, -1, 0},
	[3]int16{0, 0, +1},
	[3]int16{0, 0, -1},
}

func pfRidx(idx int) int {
	if idx%2 == 0 {
		return idx + 1
	} else {
		return idx - 1
	}
}

func pfCenterFindAir(blk *MapBlk, pos [3]int16, chans [6]chan [3]int16, done *bool) {
	for _, ch := range chans {
		if ch != nil {
			defer close(ch)
		}
	}

	for x := uint16(0); x < 16; x++ {
		for z := uint16(0); z < 16; z++ {
			for y := uint16(0); y < 16; y++ {
				if *done {
					return
				}

				if blk.data.Param0[x|(y<<4)|(z<<8)] == mt.Air {
					for _, ch := range chans {
						if ch != nil {
							ch <- [3]int16{int16(x) + pos[0], int16(y) + pos[1], int16(z) + pos[2]}
						}
					}
					break
				}
			}
		}
	}
}

func pfMakeEdge(src [3]int16, dst [3]int16, vertical bool, edge **PathfindEdge) bool {
	var distSq float64

	for i, v := range dst {
		if vertical == (i == 1) {
			abs := math.Abs(float64(v - src[i]))
			if abs > 0 {
				abs -= 1
			}
			distSq += math.Pow(abs, 2)
		}
	}

	if vertical || distSq <= pfMaxtpSq {
		*edge = &PathfindEdge{
			src:    src,
			dst:    dst,
			weight: math.Sqrt(distSq),
		}

		return true
	}

	return false
}

func pfNeighFindAir(blk *MapBlk, pos [3]int16, ch chan [3]int16, wg *sync.WaitGroup, vertical bool, edge **PathfindEdge) {
	defer wg.Done()

	var prev [][3]int16

	for x := uint16(0); x < 16; x++ {
		for z := uint16(0); z < 16; z++ {
			for y := uint16(0); y < 16; y++ {
				if blk.data.Param0[x|(y<<4)|(z<<8)] == mt.Air {
					dst := [3]int16{int16(x) + pos[0], int16(y) + pos[1], int16(z) + pos[2]}

					for _, src := range prev {
						if pfMakeEdge(dst, src, vertical, edge) {
							return
						}
					}

					for ch != nil {
						src, ok := <-ch
						if ok {
							if pfMakeEdge(dst, src, vertical, edge) {
								return
							} else {
								prev = append(prev, src)
							}
						} else {
							ch = nil
							if len(prev) == 0 {
								return
							}
						}
					}
				}
			}
		}
	}
}

func pfPreprocess(mp *Map, blkpos [3]int16, blk *MapBlk) {
	println("preprocess")

	var chans [6]chan [3]int16
	var blks [6]*MapBlk
	var wg sync.WaitGroup

	var pos [3]int16
	for k, v := range blkpos {
		pos[k] = v * 16
	}

	for i := range chans {
		npos := pos
		nblkpos := blkpos
		for j, v := range pfDirs[i] {
			npos[j] += v * 16
			nblkpos[j] += v
		}

		if nblk, ok := mp.blocks[nblkpos]; ok {
			blks[i] = nblk
			chans[i] = make(chan [3]int16, 4096)
			wg.Add(1)
			go pfNeighFindAir(blk, npos, chans[i], &wg, i == 2 || i == 3, &blk.edges[i])
		}
	}

	var done bool
	go pfCenterFindAir(blk, pos, chans, &done)
	wg.Wait()
	done = true

	for i, nblk := range blks {
		if nblk != nil {
			edge := blk.edges[i]
			ri := pfRidx(i)

			if edge == nil {
				nblk.edges[ri] = nil
			} else {
				nblk.edges[ri] = &PathfindEdge{
					src:    edge.dst,
					dst:    edge.src,
					weight: edge.weight,
				}
			}
		}
	}

	println("finish preprocess")
}