vislite 0.5.0 → 0.5.2-alpha.1
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/CHANGELOG +137 -132
- package/lib/Buffer/index.umd.js +36 -36
- package/lib/Buffer/index.umd.min.js +2 -2
- package/lib/Canvas/index.umd.js +650 -650
- package/lib/Canvas/index.umd.min.js +2 -2
- package/lib/Cardinal/index.umd.js +91 -91
- package/lib/Cardinal/index.umd.min.js +2 -2
- package/lib/Eoap/index.umd.js +34 -34
- package/lib/Eoap/index.umd.min.js +2 -2
- package/lib/Geometry/index.umd.js +142 -142
- package/lib/Geometry/index.umd.min.js +2 -2
- package/lib/Hermite/index.umd.js +36 -36
- package/lib/Hermite/index.umd.min.js +2 -2
- package/lib/Matrix4/index.umd.js +119 -119
- package/lib/Matrix4/index.umd.min.js +2 -2
- package/lib/Mercator/index.umd.js +20 -20
- package/lib/Mercator/index.umd.min.js +2 -2
- package/lib/OralCanvas/index.es.js +598 -598
- package/lib/OralCanvas/index.es.min.js +2 -2
- package/lib/OralWebGL/index.es.js +524 -524
- package/lib/OralWebGL/index.es.min.js +2 -2
- package/lib/SVG/index.umd.js +406 -406
- package/lib/SVG/index.umd.min.js +2 -2
- package/lib/Shader/index.umd.js +61 -61
- package/lib/Shader/index.umd.min.js +2 -2
- package/lib/Texture/index.umd.js +53 -53
- package/lib/Texture/index.umd.min.js +2 -2
- package/lib/TreeLayout/index.umd.js +363 -363
- package/lib/TreeLayout/index.umd.min.js +2 -2
- package/lib/WebGL/index.umd.js +571 -571
- package/lib/WebGL/index.umd.min.js +2 -2
- package/lib/animation/index.umd.js +72 -72
- package/lib/animation/index.umd.min.js +2 -2
- package/lib/formatColor/index.umd.js +40 -40
- package/lib/formatColor/index.umd.min.js +2 -2
- package/lib/getLoopColors/index.umd.js +36 -36
- package/lib/getLoopColors/index.umd.min.js +2 -2
- package/lib/getWebGLContext/index.umd.js +44 -44
- package/lib/getWebGLContext/index.umd.min.js +2 -2
- package/lib/index.umd.js +2647 -2647
- package/lib/index.umd.min.js +2 -2
- package/lib/resizeObserver/index.umd.js +29 -29
- package/lib/resizeObserver/index.umd.min.js +2 -2
- package/lib/rotate/index.umd.js +8 -8
- package/lib/rotate/index.umd.min.js +2 -2
- package/lib/ruler/index.umd.js +126 -126
- package/lib/ruler/index.umd.min.js +2 -2
- package/lib/throttle/index.umd.js +49 -49
- package/lib/throttle/index.umd.min.js +2 -2
- package/lib/viewHandler/index.umd.js +120 -120
- package/lib/viewHandler/index.umd.min.js +2 -2
- package/package/Geometry/index.ts +2 -2
- package/package/index.ts +72 -72
- package/package.json +66 -66
- package/src/Eoap.ts +66 -66
- package/src/Geometry.ts +82 -82
- package/src/Matrix4/index.ts +76 -76
- package/src/Mercator.ts +27 -27
- package/src/TreeLayout/index.ts +186 -186
- package/src/common/geometry/prism-horizontal.ts +33 -33
- package/src/common/geometry/prism-vertical.ts +40 -40
- package/src/common/geometry/sphere-fragment.ts +39 -39
- package/src/common/geometry/tool/circle.ts +11 -11
- package/src/common/svg/index.ts +344 -344
- package/src/rotate.ts +7 -7
- package/types/CanvasConfig.d.ts +106 -106
- package/types/Geometry.d.ts +40 -40
- package/types/GeometryOption.d.ts +11 -11
- package/types/GeometryResult.d.ts +18 -18
- package/types/Map.d.ts +9 -9
- package/types/Matrix4.d.ts +42 -42
- package/types/SVG.d.ts +215 -215
- package/types/TreeLayout.d.ts +54 -54
- package/types/index.d.ts +169 -169
- package/types/rotate.d.ts +2 -2
- package/uni-app/ui-canvas.vue +206 -202
package/src/TreeLayout/index.ts
CHANGED
|
@@ -1,187 +1,187 @@
|
|
|
1
|
-
import type TreeLayoutType from '../../types/TreeLayout'
|
|
2
|
-
import type { TreeResultType } from '../../types/Tree'
|
|
3
|
-
import type TreeOptionType from '../../types/TreeOption'
|
|
4
|
-
|
|
5
|
-
import Tree from '../common/tree/index'
|
|
6
|
-
import mergeOption from '../common/mergeOption'
|
|
7
|
-
import animation from '../animation'
|
|
8
|
-
import rotate from '../rotate'
|
|
9
|
-
|
|
10
|
-
class TreeLayout extends Tree implements TreeLayoutType {
|
|
11
|
-
readonly name: string = 'TreeLayout'
|
|
12
|
-
|
|
13
|
-
private __option: TreeOptionType = {
|
|
14
|
-
offsetX: 0,
|
|
15
|
-
offsetY: 0,
|
|
16
|
-
duration: 500,
|
|
17
|
-
type: "plain",
|
|
18
|
-
direction: "LR",
|
|
19
|
-
x: 100,
|
|
20
|
-
y: 100,
|
|
21
|
-
width: 100,
|
|
22
|
-
height: 100,
|
|
23
|
-
radius: 100
|
|
24
|
-
}
|
|
25
|
-
|
|
26
|
-
private __rback: (tree: TreeResultType) => void
|
|
27
|
-
private __oralTree: any
|
|
28
|
-
private __preTree: TreeResultType
|
|
29
|
-
|
|
30
|
-
private __noOpens = {}
|
|
31
|
-
|
|
32
|
-
setOption(option: TreeOptionType) {
|
|
33
|
-
mergeOption(option, this.__option)
|
|
34
|
-
return this
|
|
35
|
-
}
|
|
36
|
-
|
|
37
|
-
use(initTree: any, noOpens = {}) {
|
|
38
|
-
let tree = super.use(initTree, noOpens)
|
|
39
|
-
|
|
40
|
-
// 校对偏差
|
|
41
|
-
if (this.__option.offsetX != 0 || this.__option.offsetY != 0) {
|
|
42
|
-
for (let key in tree.node) {
|
|
43
|
-
if (!tree.node[key].show) {
|
|
44
|
-
|
|
45
|
-
let deep = 0, pid = key
|
|
46
|
-
do {
|
|
47
|
-
pid = tree.node[pid].pid
|
|
48
|
-
deep++
|
|
49
|
-
} while (!tree.node[pid].show)
|
|
50
|
-
|
|
51
|
-
tree.node[key].left += this.__option.offsetX * deep
|
|
52
|
-
tree.node[key].top += this.__option.offsetY * deep
|
|
53
|
-
}
|
|
54
|
-
}
|
|
55
|
-
}
|
|
56
|
-
|
|
57
|
-
if (this.__option.type == 'rect') {
|
|
58
|
-
if (this.__option.direction == 'LR' || this.__option.direction == "RL") {
|
|
59
|
-
|
|
60
|
-
let perW = this.__option.height / tree.size
|
|
61
|
-
let perD = this.__option.width / (tree.deep - 1)
|
|
62
|
-
|
|
63
|
-
let balanceW = this.__option.y - this.__option.height * 0.5
|
|
64
|
-
let flag = this.__option.direction == 'LR' ? 1 : -1
|
|
65
|
-
|
|
66
|
-
for (let key in tree.node) {
|
|
67
|
-
if (tree.deep == 1) {
|
|
68
|
-
tree.node[key].left = this.__option.x + this.__option.width * 0.5 * flag
|
|
69
|
-
tree.node[key].top = this.__option.y
|
|
70
|
-
} else {
|
|
71
|
-
tree.node[key].left = this.__option.x + (tree.node[key].left - 0.5) * perD * flag
|
|
72
|
-
tree.node[key].top = tree.node[key].top * perW + balanceW
|
|
73
|
-
}
|
|
74
|
-
}
|
|
75
|
-
} else if (this.__option.direction == 'TB' || this.__option.direction == "BT") {
|
|
76
|
-
|
|
77
|
-
let perW = this.__option.width / tree.size
|
|
78
|
-
let perD = this.__option.height / (tree.deep - 1)
|
|
79
|
-
|
|
80
|
-
let balanceW = this.__option.x - this.__option.width * 0.5
|
|
81
|
-
let flag = this.__option.direction == 'TB' ? 1 : -1
|
|
82
|
-
|
|
83
|
-
for (let key in tree.node) {
|
|
84
|
-
if (tree.deep == 1) {
|
|
85
|
-
tree.node[key].left = this.__option.x
|
|
86
|
-
tree.node[key].top = this.__option.y + this.__option.height * 0.5 * flag
|
|
87
|
-
} else {
|
|
88
|
-
let left = tree.node[key].left
|
|
89
|
-
|
|
90
|
-
tree.node[key].left = tree.node[key].top * perW + balanceW
|
|
91
|
-
tree.node[key].top = this.__option.y + (left - 0.5) * perD * flag
|
|
92
|
-
}
|
|
93
|
-
}
|
|
94
|
-
|
|
95
|
-
}
|
|
96
|
-
|
|
97
|
-
} else if (this.__option.type == 'circle') {
|
|
98
|
-
let cx = this.__option.x, cy = this.__option.y
|
|
99
|
-
let deg = Math.PI * 2 / tree.size
|
|
100
|
-
let per = this.__option.radius / (tree.deep - 1)
|
|
101
|
-
|
|
102
|
-
for (let key in tree.node) {
|
|
103
|
-
if (tree.node[key].left == 0.5) {
|
|
104
|
-
tree.node[key].left = cx
|
|
105
|
-
tree.node[key].top = cy
|
|
106
|
-
} else {
|
|
107
|
-
let position = rotate(cx, cy, deg * tree.node[key].top, cx + (tree.node[key].left - 0.5) * per, cy)
|
|
108
|
-
|
|
109
|
-
tree.node[key].left = position[0]
|
|
110
|
-
tree.node[key].top = position[1]
|
|
111
|
-
}
|
|
112
|
-
}
|
|
113
|
-
}
|
|
114
|
-
|
|
115
|
-
return tree
|
|
116
|
-
}
|
|
117
|
-
|
|
118
|
-
bind(initTree: any, renderBack: (tree: TreeResultType) => void, noOpens = {}) {
|
|
119
|
-
this.__rback = renderBack
|
|
120
|
-
this.__oralTree = initTree
|
|
121
|
-
this.__noOpens = noOpens
|
|
122
|
-
|
|
123
|
-
this.__preTree = this.use(this.__oralTree, this.__noOpens)
|
|
124
|
-
this.__rback(this.__preTree)
|
|
125
|
-
|
|
126
|
-
return this
|
|
127
|
-
}
|
|
128
|
-
|
|
129
|
-
unbind() {
|
|
130
|
-
this.__rback = null
|
|
131
|
-
this.__oralTree = null
|
|
132
|
-
this.__preTree = null
|
|
133
|
-
this.__noOpens = {}
|
|
134
|
-
return this
|
|
135
|
-
}
|
|
136
|
-
|
|
137
|
-
private doUpdate() {
|
|
138
|
-
let newTree = this.use(this.__oralTree, this.__noOpens)
|
|
139
|
-
|
|
140
|
-
let cacheTree = JSON.parse(JSON.stringify(newTree))
|
|
141
|
-
|
|
142
|
-
animation((deep) => {
|
|
143
|
-
|
|
144
|
-
for (let key in cacheTree.node) {
|
|
145
|
-
if (newTree.node[key].show || this.__preTree.node[key].show) {
|
|
146
|
-
cacheTree.node[key].show = true
|
|
147
|
-
|
|
148
|
-
cacheTree.node[key].left = this.__preTree.node[key].left + (newTree.node[key].left - this.__preTree.node[key].left) * deep
|
|
149
|
-
cacheTree.node[key].top = this.__preTree.node[key].top + (newTree.node[key].top - this.__preTree.node[key].top) * deep
|
|
150
|
-
}
|
|
151
|
-
}
|
|
152
|
-
this.__rback(cacheTree)
|
|
153
|
-
|
|
154
|
-
|
|
155
|
-
}, this.__option.duration, () => {
|
|
156
|
-
this.__preTree = newTree
|
|
157
|
-
this.__rback(this.__preTree)
|
|
158
|
-
})
|
|
159
|
-
}
|
|
160
|
-
|
|
161
|
-
closeNode(id: string) {
|
|
162
|
-
if (!this.__preTree) return
|
|
163
|
-
this.__noOpens[id] = true
|
|
164
|
-
|
|
165
|
-
this.doUpdate()
|
|
166
|
-
return this
|
|
167
|
-
}
|
|
168
|
-
|
|
169
|
-
openNode(id: string) {
|
|
170
|
-
if (!this.__preTree) return
|
|
171
|
-
this.__noOpens[id] = false
|
|
172
|
-
|
|
173
|
-
this.doUpdate()
|
|
174
|
-
return this
|
|
175
|
-
}
|
|
176
|
-
|
|
177
|
-
toggleNode(id: string) {
|
|
178
|
-
if (!this.__preTree) return
|
|
179
|
-
this.__noOpens[id] = !this.__noOpens[id]
|
|
180
|
-
|
|
181
|
-
this.doUpdate()
|
|
182
|
-
return this
|
|
183
|
-
}
|
|
184
|
-
|
|
185
|
-
}
|
|
186
|
-
|
|
1
|
+
import type TreeLayoutType from '../../types/TreeLayout'
|
|
2
|
+
import type { TreeResultType } from '../../types/Tree'
|
|
3
|
+
import type TreeOptionType from '../../types/TreeOption'
|
|
4
|
+
|
|
5
|
+
import Tree from '../common/tree/index'
|
|
6
|
+
import mergeOption from '../common/mergeOption'
|
|
7
|
+
import animation from '../animation'
|
|
8
|
+
import rotate from '../rotate'
|
|
9
|
+
|
|
10
|
+
class TreeLayout extends Tree implements TreeLayoutType {
|
|
11
|
+
readonly name: string = 'TreeLayout'
|
|
12
|
+
|
|
13
|
+
private __option: TreeOptionType = {
|
|
14
|
+
offsetX: 0,
|
|
15
|
+
offsetY: 0,
|
|
16
|
+
duration: 500,
|
|
17
|
+
type: "plain",
|
|
18
|
+
direction: "LR",
|
|
19
|
+
x: 100,
|
|
20
|
+
y: 100,
|
|
21
|
+
width: 100,
|
|
22
|
+
height: 100,
|
|
23
|
+
radius: 100
|
|
24
|
+
}
|
|
25
|
+
|
|
26
|
+
private __rback: (tree: TreeResultType) => void
|
|
27
|
+
private __oralTree: any
|
|
28
|
+
private __preTree: TreeResultType
|
|
29
|
+
|
|
30
|
+
private __noOpens = {}
|
|
31
|
+
|
|
32
|
+
setOption(option: TreeOptionType) {
|
|
33
|
+
mergeOption(option, this.__option)
|
|
34
|
+
return this
|
|
35
|
+
}
|
|
36
|
+
|
|
37
|
+
use(initTree: any, noOpens = {}) {
|
|
38
|
+
let tree = super.use(initTree, noOpens)
|
|
39
|
+
|
|
40
|
+
// 校对偏差
|
|
41
|
+
if (this.__option.offsetX != 0 || this.__option.offsetY != 0) {
|
|
42
|
+
for (let key in tree.node) {
|
|
43
|
+
if (!tree.node[key].show) {
|
|
44
|
+
|
|
45
|
+
let deep = 0, pid = key
|
|
46
|
+
do {
|
|
47
|
+
pid = tree.node[pid].pid
|
|
48
|
+
deep++
|
|
49
|
+
} while (!tree.node[pid].show)
|
|
50
|
+
|
|
51
|
+
tree.node[key].left += this.__option.offsetX * deep
|
|
52
|
+
tree.node[key].top += this.__option.offsetY * deep
|
|
53
|
+
}
|
|
54
|
+
}
|
|
55
|
+
}
|
|
56
|
+
|
|
57
|
+
if (this.__option.type == 'rect') {
|
|
58
|
+
if (this.__option.direction == 'LR' || this.__option.direction == "RL") {
|
|
59
|
+
|
|
60
|
+
let perW = this.__option.height / tree.size
|
|
61
|
+
let perD = this.__option.width / (tree.deep - 1)
|
|
62
|
+
|
|
63
|
+
let balanceW = this.__option.y - this.__option.height * 0.5
|
|
64
|
+
let flag = this.__option.direction == 'LR' ? 1 : -1
|
|
65
|
+
|
|
66
|
+
for (let key in tree.node) {
|
|
67
|
+
if (tree.deep == 1) {
|
|
68
|
+
tree.node[key].left = this.__option.x + this.__option.width * 0.5 * flag
|
|
69
|
+
tree.node[key].top = this.__option.y
|
|
70
|
+
} else {
|
|
71
|
+
tree.node[key].left = this.__option.x + (tree.node[key].left - 0.5) * perD * flag
|
|
72
|
+
tree.node[key].top = tree.node[key].top * perW + balanceW
|
|
73
|
+
}
|
|
74
|
+
}
|
|
75
|
+
} else if (this.__option.direction == 'TB' || this.__option.direction == "BT") {
|
|
76
|
+
|
|
77
|
+
let perW = this.__option.width / tree.size
|
|
78
|
+
let perD = this.__option.height / (tree.deep - 1)
|
|
79
|
+
|
|
80
|
+
let balanceW = this.__option.x - this.__option.width * 0.5
|
|
81
|
+
let flag = this.__option.direction == 'TB' ? 1 : -1
|
|
82
|
+
|
|
83
|
+
for (let key in tree.node) {
|
|
84
|
+
if (tree.deep == 1) {
|
|
85
|
+
tree.node[key].left = this.__option.x
|
|
86
|
+
tree.node[key].top = this.__option.y + this.__option.height * 0.5 * flag
|
|
87
|
+
} else {
|
|
88
|
+
let left = tree.node[key].left
|
|
89
|
+
|
|
90
|
+
tree.node[key].left = tree.node[key].top * perW + balanceW
|
|
91
|
+
tree.node[key].top = this.__option.y + (left - 0.5) * perD * flag
|
|
92
|
+
}
|
|
93
|
+
}
|
|
94
|
+
|
|
95
|
+
}
|
|
96
|
+
|
|
97
|
+
} else if (this.__option.type == 'circle') {
|
|
98
|
+
let cx = this.__option.x, cy = this.__option.y
|
|
99
|
+
let deg = Math.PI * 2 / tree.size
|
|
100
|
+
let per = this.__option.radius / (tree.deep - 1)
|
|
101
|
+
|
|
102
|
+
for (let key in tree.node) {
|
|
103
|
+
if (tree.node[key].left == 0.5) {
|
|
104
|
+
tree.node[key].left = cx
|
|
105
|
+
tree.node[key].top = cy
|
|
106
|
+
} else {
|
|
107
|
+
let position = rotate(cx, cy, deg * tree.node[key].top, cx + (tree.node[key].left - 0.5) * per, cy)
|
|
108
|
+
|
|
109
|
+
tree.node[key].left = position[0]
|
|
110
|
+
tree.node[key].top = position[1]
|
|
111
|
+
}
|
|
112
|
+
}
|
|
113
|
+
}
|
|
114
|
+
|
|
115
|
+
return tree
|
|
116
|
+
}
|
|
117
|
+
|
|
118
|
+
bind(initTree: any, renderBack: (tree: TreeResultType) => void, noOpens = {}) {
|
|
119
|
+
this.__rback = renderBack
|
|
120
|
+
this.__oralTree = initTree
|
|
121
|
+
this.__noOpens = noOpens
|
|
122
|
+
|
|
123
|
+
this.__preTree = this.use(this.__oralTree, this.__noOpens)
|
|
124
|
+
this.__rback(this.__preTree)
|
|
125
|
+
|
|
126
|
+
return this
|
|
127
|
+
}
|
|
128
|
+
|
|
129
|
+
unbind() {
|
|
130
|
+
this.__rback = null
|
|
131
|
+
this.__oralTree = null
|
|
132
|
+
this.__preTree = null
|
|
133
|
+
this.__noOpens = {}
|
|
134
|
+
return this
|
|
135
|
+
}
|
|
136
|
+
|
|
137
|
+
private doUpdate() {
|
|
138
|
+
let newTree = this.use(this.__oralTree, this.__noOpens)
|
|
139
|
+
|
|
140
|
+
let cacheTree = JSON.parse(JSON.stringify(newTree))
|
|
141
|
+
|
|
142
|
+
animation((deep) => {
|
|
143
|
+
|
|
144
|
+
for (let key in cacheTree.node) {
|
|
145
|
+
if (newTree.node[key].show || this.__preTree.node[key].show) {
|
|
146
|
+
cacheTree.node[key].show = true
|
|
147
|
+
|
|
148
|
+
cacheTree.node[key].left = this.__preTree.node[key].left + (newTree.node[key].left - this.__preTree.node[key].left) * deep
|
|
149
|
+
cacheTree.node[key].top = this.__preTree.node[key].top + (newTree.node[key].top - this.__preTree.node[key].top) * deep
|
|
150
|
+
}
|
|
151
|
+
}
|
|
152
|
+
this.__rback(cacheTree)
|
|
153
|
+
|
|
154
|
+
|
|
155
|
+
}, this.__option.duration, () => {
|
|
156
|
+
this.__preTree = newTree
|
|
157
|
+
this.__rback(this.__preTree)
|
|
158
|
+
})
|
|
159
|
+
}
|
|
160
|
+
|
|
161
|
+
closeNode(id: string) {
|
|
162
|
+
if (!this.__preTree) return
|
|
163
|
+
this.__noOpens[id] = true
|
|
164
|
+
|
|
165
|
+
this.doUpdate()
|
|
166
|
+
return this
|
|
167
|
+
}
|
|
168
|
+
|
|
169
|
+
openNode(id: string) {
|
|
170
|
+
if (!this.__preTree) return
|
|
171
|
+
this.__noOpens[id] = false
|
|
172
|
+
|
|
173
|
+
this.doUpdate()
|
|
174
|
+
return this
|
|
175
|
+
}
|
|
176
|
+
|
|
177
|
+
toggleNode(id: string) {
|
|
178
|
+
if (!this.__preTree) return
|
|
179
|
+
this.__noOpens[id] = !this.__noOpens[id]
|
|
180
|
+
|
|
181
|
+
this.doUpdate()
|
|
182
|
+
return this
|
|
183
|
+
}
|
|
184
|
+
|
|
185
|
+
}
|
|
186
|
+
|
|
187
187
|
export default TreeLayout
|
|
@@ -1,33 +1,33 @@
|
|
|
1
|
-
import rotate from '../../rotate'
|
|
2
|
-
|
|
3
|
-
// 棱柱水平部分
|
|
4
|
-
|
|
5
|
-
export default function (normal: boolean, x: number, y: number, z: number, radius: number, num: number, d: number) {
|
|
6
|
-
|
|
7
|
-
let beginX: number, beginZ: number
|
|
8
|
-
if (num == 4) {
|
|
9
|
-
let temp = radius / 1.414
|
|
10
|
-
beginX = x + temp
|
|
11
|
-
beginZ = z + temp
|
|
12
|
-
|
|
13
|
-
} else {
|
|
14
|
-
beginX = x + radius
|
|
15
|
-
beginZ = z
|
|
16
|
-
}
|
|
17
|
-
|
|
18
|
-
let point = [beginX, beginZ], points = [], deg = Math.PI * 2 / num
|
|
19
|
-
for (let i = 0; i < num; i++) {
|
|
20
|
-
|
|
21
|
-
points.push(x, y, z)
|
|
22
|
-
if (normal) points.push(0, d, 0)
|
|
23
|
-
|
|
24
|
-
points.push(point[0], y, point[1])
|
|
25
|
-
if (normal) points.push(0, d, 0)
|
|
26
|
-
|
|
27
|
-
point = rotate(x, z, deg * (i + 1), beginX, beginZ)
|
|
28
|
-
points.push(point[0], y, point[1])
|
|
29
|
-
if (normal) points.push(0, d, 0)
|
|
30
|
-
}
|
|
31
|
-
|
|
32
|
-
return points
|
|
33
|
-
}
|
|
1
|
+
import rotate from '../../rotate'
|
|
2
|
+
|
|
3
|
+
// 棱柱水平部分
|
|
4
|
+
|
|
5
|
+
export default function (normal: boolean, x: number, y: number, z: number, radius: number, num: number, d: number) {
|
|
6
|
+
|
|
7
|
+
let beginX: number, beginZ: number
|
|
8
|
+
if (num == 4) {
|
|
9
|
+
let temp = radius / 1.414
|
|
10
|
+
beginX = x + temp
|
|
11
|
+
beginZ = z + temp
|
|
12
|
+
|
|
13
|
+
} else {
|
|
14
|
+
beginX = x + radius
|
|
15
|
+
beginZ = z
|
|
16
|
+
}
|
|
17
|
+
|
|
18
|
+
let point = [beginX, beginZ], points = [], deg = Math.PI * 2 / num
|
|
19
|
+
for (let i = 0; i < num; i++) {
|
|
20
|
+
|
|
21
|
+
points.push(x, y, z)
|
|
22
|
+
if (normal) points.push(0, d, 0)
|
|
23
|
+
|
|
24
|
+
points.push(point[0], y, point[1])
|
|
25
|
+
if (normal) points.push(0, d, 0)
|
|
26
|
+
|
|
27
|
+
point = rotate(x, z, deg * (i + 1), beginX, beginZ)
|
|
28
|
+
points.push(point[0], y, point[1])
|
|
29
|
+
if (normal) points.push(0, d, 0)
|
|
30
|
+
}
|
|
31
|
+
|
|
32
|
+
return points
|
|
33
|
+
}
|
|
@@ -1,40 +1,40 @@
|
|
|
1
|
-
import rotate from '../../rotate'
|
|
2
|
-
|
|
3
|
-
// 棱柱垂直部分
|
|
4
|
-
|
|
5
|
-
export default function (normal: boolean, x: number, y: number, z: number, radius: number, height: number, num: number) {
|
|
6
|
-
let points = []
|
|
7
|
-
let beginPosition: [number, number]
|
|
8
|
-
|
|
9
|
-
if (num == 4) {
|
|
10
|
-
beginPosition = rotate(x, z, Math.PI * 0.25, x - radius, z)
|
|
11
|
-
} else {
|
|
12
|
-
beginPosition = [x + radius, z]
|
|
13
|
-
}
|
|
14
|
-
|
|
15
|
-
let deg = Math.PI * 2 / num, degHalf = Math.PI * 2 / (num * 2)
|
|
16
|
-
|
|
17
|
-
let endPosition: [number, number], normalPosition = []
|
|
18
|
-
for (let i = 0; i < num; i++) {
|
|
19
|
-
|
|
20
|
-
endPosition = rotate(x, z, deg, ...beginPosition)
|
|
21
|
-
|
|
22
|
-
if (normal) {
|
|
23
|
-
let halfPosition = rotate(x, z, degHalf, ...beginPosition)
|
|
24
|
-
normalPosition = [halfPosition[0], 0, halfPosition[1]]
|
|
25
|
-
}
|
|
26
|
-
|
|
27
|
-
points.push(beginPosition[0], y, beginPosition[1], ...normalPosition)
|
|
28
|
-
points.push(beginPosition[0], y + height, beginPosition[1], ...normalPosition)
|
|
29
|
-
points.push(endPosition[0], y + height, endPosition[1], ...normalPosition)
|
|
30
|
-
|
|
31
|
-
points.push(beginPosition[0], y, beginPosition[1], ...normalPosition)
|
|
32
|
-
points.push(endPosition[0], y, endPosition[1], ...normalPosition)
|
|
33
|
-
points.push(endPosition[0], y + height, endPosition[1], ...normalPosition)
|
|
34
|
-
|
|
35
|
-
|
|
36
|
-
beginPosition = endPosition
|
|
37
|
-
}
|
|
38
|
-
|
|
39
|
-
return points
|
|
40
|
-
}
|
|
1
|
+
import rotate from '../../rotate'
|
|
2
|
+
|
|
3
|
+
// 棱柱垂直部分
|
|
4
|
+
|
|
5
|
+
export default function (normal: boolean, x: number, y: number, z: number, radius: number, height: number, num: number) {
|
|
6
|
+
let points = []
|
|
7
|
+
let beginPosition: [number, number]
|
|
8
|
+
|
|
9
|
+
if (num == 4) {
|
|
10
|
+
beginPosition = rotate(x, z, Math.PI * 0.25, x - radius, z)
|
|
11
|
+
} else {
|
|
12
|
+
beginPosition = [x + radius, z]
|
|
13
|
+
}
|
|
14
|
+
|
|
15
|
+
let deg = Math.PI * 2 / num, degHalf = Math.PI * 2 / (num * 2)
|
|
16
|
+
|
|
17
|
+
let endPosition: [number, number], normalPosition = []
|
|
18
|
+
for (let i = 0; i < num; i++) {
|
|
19
|
+
|
|
20
|
+
endPosition = rotate(x, z, deg, ...beginPosition)
|
|
21
|
+
|
|
22
|
+
if (normal) {
|
|
23
|
+
let halfPosition = rotate(x, z, degHalf, ...beginPosition)
|
|
24
|
+
normalPosition = [halfPosition[0], 0, halfPosition[1]]
|
|
25
|
+
}
|
|
26
|
+
|
|
27
|
+
points.push(beginPosition[0], y, beginPosition[1], ...normalPosition)
|
|
28
|
+
points.push(beginPosition[0], y + height, beginPosition[1], ...normalPosition)
|
|
29
|
+
points.push(endPosition[0], y + height, endPosition[1], ...normalPosition)
|
|
30
|
+
|
|
31
|
+
points.push(beginPosition[0], y, beginPosition[1], ...normalPosition)
|
|
32
|
+
points.push(endPosition[0], y, endPosition[1], ...normalPosition)
|
|
33
|
+
points.push(endPosition[0], y + height, endPosition[1], ...normalPosition)
|
|
34
|
+
|
|
35
|
+
|
|
36
|
+
beginPosition = endPosition
|
|
37
|
+
}
|
|
38
|
+
|
|
39
|
+
return points
|
|
40
|
+
}
|
|
@@ -1,39 +1,39 @@
|
|
|
1
|
-
import rotate from '../../rotate'
|
|
2
|
-
|
|
3
|
-
// 球体中的一瓣子
|
|
4
|
-
|
|
5
|
-
export default function (normal: boolean, cx: number, cy: number, cz: number, radius: number, num: number, index: number) {
|
|
6
|
-
let points = [cx, cy + radius, cz], deg = Math.PI * 2 / num, point: [number, number]
|
|
7
|
-
|
|
8
|
-
if (normal) points.push(0, radius, 0)
|
|
9
|
-
|
|
10
|
-
let copy2 = () => {
|
|
11
|
-
points.push(...points.slice(points.length - (normal ? 12 : 6)))
|
|
12
|
-
}
|
|
13
|
-
|
|
14
|
-
for (let i = 1; i < num * 0.5; i++) {
|
|
15
|
-
point = rotate(cx, cy, deg * i, cx, cy + radius)
|
|
16
|
-
|
|
17
|
-
if (i > 1) copy2()
|
|
18
|
-
|
|
19
|
-
// 第一个点
|
|
20
|
-
let point1 = rotate(cx, cz, deg * index, point[0], cz)
|
|
21
|
-
points.push(point1[0], point[1], point1[1])
|
|
22
|
-
|
|
23
|
-
if (normal) points.push(point1[0] - cx, point[1] - cy, point1[1] - cz)
|
|
24
|
-
|
|
25
|
-
if (i > 1) copy2()
|
|
26
|
-
|
|
27
|
-
// 下一个点
|
|
28
|
-
let point2 = rotate(cx, cz, deg * (index + 1), point[0], cz)
|
|
29
|
-
points.push(point2[0], point[1], point2[1])
|
|
30
|
-
|
|
31
|
-
if (normal) points.push(point2[0] - cx, point2[1] - cy, point2[1] - cz)
|
|
32
|
-
}
|
|
33
|
-
copy2()
|
|
34
|
-
points.push(cx, cy - radius, cz)
|
|
35
|
-
|
|
36
|
-
if (normal) points.push(0, - radius, 0)
|
|
37
|
-
|
|
38
|
-
return points
|
|
39
|
-
}
|
|
1
|
+
import rotate from '../../rotate'
|
|
2
|
+
|
|
3
|
+
// 球体中的一瓣子
|
|
4
|
+
|
|
5
|
+
export default function (normal: boolean, cx: number, cy: number, cz: number, radius: number, num: number, index: number) {
|
|
6
|
+
let points = [cx, cy + radius, cz], deg = Math.PI * 2 / num, point: [number, number]
|
|
7
|
+
|
|
8
|
+
if (normal) points.push(0, radius, 0)
|
|
9
|
+
|
|
10
|
+
let copy2 = () => {
|
|
11
|
+
points.push(...points.slice(points.length - (normal ? 12 : 6)))
|
|
12
|
+
}
|
|
13
|
+
|
|
14
|
+
for (let i = 1; i < num * 0.5; i++) {
|
|
15
|
+
point = rotate(cx, cy, deg * i, cx, cy + radius)
|
|
16
|
+
|
|
17
|
+
if (i > 1) copy2()
|
|
18
|
+
|
|
19
|
+
// 第一个点
|
|
20
|
+
let point1 = rotate(cx, cz, deg * index, point[0], cz)
|
|
21
|
+
points.push(point1[0], point[1], point1[1])
|
|
22
|
+
|
|
23
|
+
if (normal) points.push(point1[0] - cx, point[1] - cy, point1[1] - cz)
|
|
24
|
+
|
|
25
|
+
if (i > 1) copy2()
|
|
26
|
+
|
|
27
|
+
// 下一个点
|
|
28
|
+
let point2 = rotate(cx, cz, deg * (index + 1), point[0], cz)
|
|
29
|
+
points.push(point2[0], point[1], point2[1])
|
|
30
|
+
|
|
31
|
+
if (normal) points.push(point2[0] - cx, point2[1] - cy, point2[1] - cz)
|
|
32
|
+
}
|
|
33
|
+
copy2()
|
|
34
|
+
points.push(cx, cy - radius, cz)
|
|
35
|
+
|
|
36
|
+
if (normal) points.push(0, - radius, 0)
|
|
37
|
+
|
|
38
|
+
return points
|
|
39
|
+
}
|
|
@@ -1,12 +1,12 @@
|
|
|
1
|
-
// 计算切割份数
|
|
2
|
-
export let splitNum = function (precision: number, radius: number) {
|
|
3
|
-
|
|
4
|
-
// 根据切割弧度得出切割块数目
|
|
5
|
-
let num = Math.ceil(Math.PI * 2 /
|
|
6
|
-
|
|
7
|
-
// 为了满足最小精度而得出的切割弧度
|
|
8
|
-
Math.asin(precision / radius) * 2)
|
|
9
|
-
|
|
10
|
-
return (isNaN(num) || num < 12) ? 12 : num
|
|
11
|
-
|
|
1
|
+
// 计算切割份数
|
|
2
|
+
export let splitNum = function (precision: number, radius: number) {
|
|
3
|
+
|
|
4
|
+
// 根据切割弧度得出切割块数目
|
|
5
|
+
let num = Math.ceil(Math.PI * 2 /
|
|
6
|
+
|
|
7
|
+
// 为了满足最小精度而得出的切割弧度
|
|
8
|
+
Math.asin(precision / radius) * 2)
|
|
9
|
+
|
|
10
|
+
return (isNaN(num) || num < 12) ? 12 : num
|
|
11
|
+
|
|
12
12
|
}
|