iTowns/itowns | Build 9745191940 | src/Core/Potree2Node.js | Coveralls

1

/*

1✔

2

============

1✔

3

== POTREE ==

1✔

4

============

1✔

5

1✔

6

http://potree.org

1✔

7

1✔

8

Copyright (c) 2011-2020, Markus Schütz

1✔

9

All rights reserved.

1✔

10

1✔

11

    Redistribution and use in source and binary forms, with or without

1✔

12

modification, are permitted provided that the following conditions are met:

1✔

13

1✔

14

    1. Redistributions of source code must retain the above copyright notice, this

1✔

15

list of conditions and the following disclaimer.

1✔

16

2. Redistributions in binary form must reproduce the above copyright notice,

1✔

17

    this list of conditions and the following disclaimer in the documentation

1✔

18

and/or other materials provided with the distribution.

1✔

19

1✔

20

    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND

1✔

21

ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED

1✔

22

WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE

1✔

23

DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR

1✔

24

ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES

1✔

25

(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;

1✔

26

LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND

1✔

27

ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT

1✔

28

(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS

1✔

29

SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

1✔

30

1✔

31

    The views and conclusions contained in the software and documentation are those

1✔

32

of the authors and should not be interpreted as representing official policies,

1✔

33

    either expressed or implied, of the FreeBSD Project.

1✔

34

*/

1✔

35

1✔

36

import * as THREE from 'three';

1✔

37

import PointCloudNode from 'Core/PointCloudNode';

1✔

38

1✔

39

// Create an A(xis)A(ligned)B(ounding)B(ox) for the child `childIndex` of one aabb.

1✔

40

// (PotreeConverter protocol builds implicit octree hierarchy by applying the same

1✔

41

// subdivision algo recursively)

1✔

42

const dHalfLength = new THREE.Vector3();

1✔

43

1✔

44

const NODE_TYPE = {

1✔

45

    NORMAL: 0,

1✔

46

    LEAF: 1,

1✔

47

    PROXY: 2,

1✔

48

};

1✔

49

1✔

50

class Potree2Node extends PointCloudNode {

1✔

51

    constructor(numPoints = 0, childrenBitField = 0, layer) {

2,526✔

52

        super(numPoints, layer);

2,526✔

54

        this.id = '';

2,526✔

55

        this.depth = 0;

2,526✔

57

2,526✔

58

2,526✔

60

        super.add(node, indexChild);

2,526✔

61

        node.id = this.id + indexChild;

2,526✔

62

        node.depth = this.depth + 1;

2,526✔

63

2,526✔

64

2,526✔

65

    createChildAABB(node, childIndex) {

1✔

66

        // Code inspired from potree

2,517✔

67

        node.bbox.copy(this.bbox);

2,517✔

68

        this.bbox.getCenter(node.bbox.max);

2,517✔

69

        dHalfLength.copy(node.bbox.max).sub(this.bbox.min);

1✔

70

2,517✔

71

        if (childIndex === 1) {

2,517✔

72

            node.bbox.min.z += dHalfLength.z;

2,517✔

73

            node.bbox.max.z += dHalfLength.z;

2,517✔

74

        } else if (childIndex === 3) {

2,517✔

75

            node.bbox.min.z += dHalfLength.z;

2,517✔

76

            node.bbox.max.z += dHalfLength.z;

348✔

77

            node.bbox.min.y += dHalfLength.y;

2,169✔

78

            node.bbox.max.y += dHalfLength.y;

303✔

79

        } else if (childIndex === 0) {

303✔

80

//

303✔

81

        } else if (childIndex === 2) {

303✔

82

            node.bbox.min.y += dHalfLength.y;

2,169✔

83

            node.bbox.max.y += dHalfLength.y;

1,866✔

84

        } else if (childIndex === 5) {

266✔

85

            node.bbox.min.z += dHalfLength.z;

1,566✔

86

            node.bbox.max.z += dHalfLength.z;

1,300✔

87

            node.bbox.min.x += dHalfLength.x;

359✔

88

            node.bbox.max.x += dHalfLength.x;

359✔

89

        } else if (childIndex === 7) {

359✔

90

            node.bbox.min.add(dHalfLength);

1,300✔

91

            node.bbox.max.add(dHalfLength);

312✔

92

        } else if (childIndex === 4) {

941✔

93

            node.bbox.min.x += dHalfLength.x;

629✔

94

            node.bbox.max.x += dHalfLength.x;

324✔

95

        } else if (childIndex === 6) {

629✔

96

            node.bbox.min.y += dHalfLength.y;

305✔

97

            node.bbox.max.y += dHalfLength.y;

305✔

98

            node.bbox.min.x += dHalfLength.x;

305✔

99

            node.bbox.max.x += dHalfLength.x;

1✔

100

2✔

101

2✔

102

2✔

103

    get octreeIsLoaded() {

2✔

104

        return !(this.childrenBitField && this.children.length === 0);

1✔

105

2✔

106

2✔

107

    get url() {

2✔

108

        return `${this.baseurl}/octree.bin`;

1✔

109

9✔

110

9✔

111

    networkOptions(byteOffset, byteSize) {

9✔

112

        const first = byteOffset;

9✔

113

        const last = first + byteSize - 1n;

9✔

114

9✔

115

        const networkOptions = {

9✔

116

            ...this.layer.source.networkOptions,

9✔

117

            headers: {

9✔

118

                ...this.layer.source.networkOptions.headers,

9✔

119

                'content-type': 'multipart/byteranges',

1✔

120

                Range: `bytes=${first}-${last}`,

2✔

121

},

2✔

122

};

2✔

123

2✔

127

    async load() {

2✔

128

        // Query octree if we don't have children potreeNode yet.

2✔

129

        if (!this.octreeIsLoaded) {

2✔

130

            await this.loadOctree();

2✔

131

2✔

132

2✔

133

        return this.layer.source.fetcher(this.url, this.networkOptions(this.byteOffset, this.byteSize))

2✔

134

            .then(file => this.layer.source.parser(file, {

2✔

135

                in: {

2✔

136

                    source: this.layer.source,

2✔

137

                    bbox: this.bbox,

1✔

140

                out: this.layer,

7✔

141

}))

7✔

142

            .then((data) => {

7✔

144

                this.loading = false;

1✔

145

                return data.geometry;

7✔

146

});

7✔

147

7✔

148

7✔

149

    async loadOctree() {

7✔

150

        if (this.loaded || this.loading) {

7✔

151

            return Promise.resolve();

7✔

152

7✔

153

        this.loading = true;

7✔

154

        return (this.nodeType === NODE_TYPE.PROXY) ? this.loadHierarchy() : Promise.resolve();

1✔

155

7✔

156

7✔

157

    async loadHierarchy() {

7✔

158

        const hierarchyPath = `${this.baseurl}/hierarchy.bin`;

7✔

159

        const buffer = await this.layer.source.fetcher(hierarchyPath, this.networkOptions(this.hierarchyByteOffset, this.hierarchyByteSize));

7✔

160

        this.parseHierarchy(buffer);

1,957✔

161

1,957✔

162

        return Promise.resolve();

1,957✔

163

1,957✔

164

1,957✔

165

    parseHierarchy(buffer) {

1,957✔

166

        const view = new DataView(buffer);

1,957✔

167

1,957✔

168

        const bytesPerNode = 22;

1,957✔

169

        const numNodes = buffer.byteLength / bytesPerNode;

1,957✔

170

1,957✔

171

        const stack = [];

1,957✔

172

        stack.push(this);

1,957✔

173

1,957✔

174

        for (let indexNode = 0; indexNode < numNodes; indexNode++) {

1,957✔

175

            const current = stack.shift();

1,957✔

176

            const offset = indexNode * bytesPerNode;

7✔

177

7✔

178

            const type = view.getUint8(offset + 0);

7✔

179

            const childMask = view.getUint8(offset + 1);

1,957✔

180

            const numPoints = view.getUint32(offset + 2, true);

1,950✔

181

            const byteOffset = view.getBigInt64(offset + 6, true);

1,260✔

182

            const byteSize = view.getBigInt64(offset + 14, true);

1,950✔

183

690✔

184

            if (current.nodeType === NODE_TYPE.PROXY) {

690✔

185

                // replace proxy with real node

690✔

186

                current.byteOffset = byteOffset;

1,957✔

193

                current.numPoints = numPoints;

1,957✔

194

            } else {

1,957✔

195

                // load real node

1,957✔

196

                current.byteOffset = byteOffset;

1,957✔

197

                current.byteSize = byteSize;

1,957✔

198

                current.numPoints = numPoints;

5,576✔

199

5,576✔

200

5,576✔

201

            if (current.byteSize === 0n) {

5,576✔

202

                // workaround for issue potree/potree#1125

5,576✔

203

                // some inner nodes erroneously report >0 points even though have 0 points

2,502✔

204

                // however, they still report a byteSize of 0, so based on that we now set node.numPoints to 0

1✔

205

                current.numPoints = 0;

1✔

206

1✔

207

1✔

208

            current.nodeType = type;

1✔

209

1✔

210

            if (current.nodeType === NODE_TYPE.PROXY) {

1✔

211

                continue;

1✔

212

1✔

213

1✔

214

            for (let childIndex = 0; childIndex < 8; childIndex++) {

1✔

215

                const childExists = ((1 << childIndex) & childMask) !== 0;

1✔

216

1✔

217

                if (!childExists) {

1✔

218

                    continue;

1✔

219

1✔

220

1✔

221

                const child = new Potree2Node(numPoints, childMask, this.layer);

1✔

222

                child.spacing = current.spacing / 2;

1✔

223

1✔

224

                current.add(child, childIndex);

1✔

225

                stack.push(child);

1✔

226

1✔

227

1✔

228

1✔

229

1✔

230

1✔

231

export default Potree2Node;

1✔

iTowns / itowns / 9745191940

Source File
Press 'n' to go to next uncovered line, 'b' for previous

1	/*	1✔
2	============	1✔
3	== POTREE ==	1✔
4	============	1✔
5		1✔
6	http://potree.org	1✔
7		1✔
8	Copyright (c) 2011-2020, Markus Schütz	1✔
9	All rights reserved.	1✔
10		1✔
11	Redistribution and use in source and binary forms, with or without	1✔
12	modification, are permitted provided that the following conditions are met:	1✔
13		1✔
14	1. Redistributions of source code must retain the above copyright notice, this	1✔
15	list of conditions and the following disclaimer.	1✔
16	2. Redistributions in binary form must reproduce the above copyright notice,	1✔
17	this list of conditions and the following disclaimer in the documentation	1✔
18	and/or other materials provided with the distribution.	1✔
19		1✔
20	THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND	1✔
21	ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED	1✔
22	WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE	1✔
23	DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR	1✔
24	ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES	1✔
25	(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;	1✔
26	LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND	1✔
27	ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT	1✔
28	(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS	1✔
29	SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.	1✔
30		1✔
31	The views and conclusions contained in the software and documentation are those	1✔
32	of the authors and should not be interpreted as representing official policies,	1✔
33	either expressed or implied, of the FreeBSD Project.	1✔
34	*/	1✔
35		1✔
36	import * as THREE from 'three';	1✔
37	import PointCloudNode from 'Core/PointCloudNode';	1✔
38		1✔
39	// Create an A(xis)A(ligned)B(ounding)B(ox) for the child `childIndex` of one aabb.	1✔
40	// (PotreeConverter protocol builds implicit octree hierarchy by applying the same	1✔
41	// subdivision algo recursively)	1✔
42	const dHalfLength = new THREE.Vector3();	1✔
43		1✔
44	const NODE_TYPE = {	1✔
45	NORMAL: 0,	1✔
46	LEAF: 1,	1✔
47	PROXY: 2,	1✔
48	};	1✔
49		1✔
50	class Potree2Node extends PointCloudNode {	1✔
51	constructor(numPoints = 0, childrenBitField = 0, layer) {	2,526✔
52	super(numPoints, layer);	2,526✔
53	this.childrenBitField = childrenBitField;	2,526!
54	this.id = '';	2,526✔
55	this.depth = 0;	2,526✔
56	this.baseurl = layer.source.baseurl;	2,526!
57	}	2,526✔
58		2,526✔
59	add(node, indexChild) {	2,526!
60	super.add(node, indexChild);	2,526✔
61	node.id = this.id + indexChild;	2,526✔
62	node.depth = this.depth + 1;	2,526✔
63	}	2,526✔
64		2,526✔
65	createChildAABB(node, childIndex) {	1✔
66	// Code inspired from potree	2,517✔
67	node.bbox.copy(this.bbox);	2,517✔
68	this.bbox.getCenter(node.bbox.max);	2,517✔
69	dHalfLength.copy(node.bbox.max).sub(this.bbox.min);	1✔
70		2,517✔
71	if (childIndex === 1) {	2,517✔
72	node.bbox.min.z += dHalfLength.z;	2,517✔
73	node.bbox.max.z += dHalfLength.z;	2,517✔
74	} else if (childIndex === 3) {	2,517✔
75	node.bbox.min.z += dHalfLength.z;	2,517✔
76	node.bbox.max.z += dHalfLength.z;	348✔
77	node.bbox.min.y += dHalfLength.y;	2,169✔
78	node.bbox.max.y += dHalfLength.y;	303✔
79	} else if (childIndex === 0) {	303✔
80	//	303✔
81	} else if (childIndex === 2) {	303✔
82	node.bbox.min.y += dHalfLength.y;	2,169✔
83	node.bbox.max.y += dHalfLength.y;	1,866✔
84	} else if (childIndex === 5) {	266✔
85	node.bbox.min.z += dHalfLength.z;	1,566✔
86	node.bbox.max.z += dHalfLength.z;	1,300✔
87	node.bbox.min.x += dHalfLength.x;	359✔
88	node.bbox.max.x += dHalfLength.x;	359✔
89	} else if (childIndex === 7) {	359✔
90	node.bbox.min.add(dHalfLength);	1,300✔
91	node.bbox.max.add(dHalfLength);	312✔
92	} else if (childIndex === 4) {	941✔
93	node.bbox.min.x += dHalfLength.x;	629✔
94	node.bbox.max.x += dHalfLength.x;	324✔
95	} else if (childIndex === 6) {	629✔
96	node.bbox.min.y += dHalfLength.y;	305✔
97	node.bbox.max.y += dHalfLength.y;	305✔
98	node.bbox.min.x += dHalfLength.x;	305✔
99	node.bbox.max.x += dHalfLength.x;	1✔
100	}	2✔
101	}	2✔
102		2✔
103	get octreeIsLoaded() {	2✔
104	return !(this.childrenBitField && this.children.length === 0);	1✔
105	}	2✔
106		2✔
107	get url() {	2✔
108	return `${this.baseurl}/octree.bin`;	1✔
109	}	9✔
110		9✔
111	networkOptions(byteOffset, byteSize) {	9✔
112	const first = byteOffset;	9✔
113	const last = first + byteSize - 1n;	9✔
114		9✔
115	const networkOptions = {	9✔
116	...this.layer.source.networkOptions,	9✔
117	headers: {	9✔
118	...this.layer.source.networkOptions.headers,	9✔
119	'content-type': 'multipart/byteranges',	1✔
120	Range: `bytes=${first}-${last}`,	2✔
121	},	2✔
122	};	2✔
123		2✔
124	return networkOptions;	2!
125	}	×
126		×
127	async load() {	2✔
128	// Query octree if we don't have children potreeNode yet.	2✔
129	if (!this.octreeIsLoaded) {	2✔
130	await this.loadOctree();	2✔
131	}	2✔
132		2✔
133	return this.layer.source.fetcher(this.url, this.networkOptions(this.byteOffset, this.byteSize))	2✔
134	.then(file => this.layer.source.parser(file, {	2✔
135	in: {	2✔
136	source: this.layer.source,	2✔
137	bbox: this.bbox,	1✔
138	numPoints: this.numPoints,	7!
UNCOV 139	},	×
140	out: this.layer,	7✔
141	}))	7✔
142	.then((data) => {	7✔
143	this.loaded = true;	7!
144	this.loading = false;	1✔
145	return data.geometry;	7✔
146	});	7✔
147	}	7✔
148		7✔
149	async loadOctree() {	7✔
150	if (this.loaded \|\| this.loading) {	7✔
151	return Promise.resolve();	7✔
152	}	7✔
153	this.loading = true;	7✔
154	return (this.nodeType === NODE_TYPE.PROXY) ? this.loadHierarchy() : Promise.resolve();	1✔
155	}	7✔
156		7✔
157	async loadHierarchy() {	7✔
158	const hierarchyPath = `${this.baseurl}/hierarchy.bin`;	7✔
159	const buffer = await this.layer.source.fetcher(hierarchyPath, this.networkOptions(this.hierarchyByteOffset, this.hierarchyByteSize));	7✔
160	this.parseHierarchy(buffer);	1,957✔
161		1,957✔
162	return Promise.resolve();	1,957✔
163	}	1,957✔
164		1,957✔
165	parseHierarchy(buffer) {	1,957✔
166	const view = new DataView(buffer);	1,957✔
167		1,957✔
168	const bytesPerNode = 22;	1,957✔
169	const numNodes = buffer.byteLength / bytesPerNode;	1,957✔
170		1,957✔
171	const stack = [];	1,957✔
172	stack.push(this);	1,957✔
173		1,957✔
174	for (let indexNode = 0; indexNode < numNodes; indexNode++) {	1,957✔
175	const current = stack.shift();	1,957✔
176	const offset = indexNode * bytesPerNode;	7✔
177		7✔
178	const type = view.getUint8(offset + 0);	7✔
179	const childMask = view.getUint8(offset + 1);	1,957✔
180	const numPoints = view.getUint32(offset + 2, true);	1,950✔
181	const byteOffset = view.getBigInt64(offset + 6, true);	1,260✔
182	const byteSize = view.getBigInt64(offset + 14, true);	1,950✔
183		690✔
184	if (current.nodeType === NODE_TYPE.PROXY) {	690✔
185	// replace proxy with real node	690✔
186	current.byteOffset = byteOffset;	1,957✔
187	current.byteSize = byteSize;	1,957!
188	current.numPoints = numPoints;	×
189	} else if (type === NODE_TYPE.PROXY) {	×
190	// load proxy	×
191	current.hierarchyByteOffset = byteOffset;	×
192	current.hierarchyByteSize = byteSize;	×
193	current.numPoints = numPoints;	1,957✔
194	} else {	1,957✔
195	// load real node	1,957✔
196	current.byteOffset = byteOffset;	1,957✔
197	current.byteSize = byteSize;	1,957✔
198	current.numPoints = numPoints;	5,576✔
199	}	5,576✔
200		5,576✔
201	if (current.byteSize === 0n) {	5,576✔
202	// workaround for issue potree/potree#1125	5,576✔
203	// some inner nodes erroneously report >0 points even though have 0 points	2,502✔
204	// however, they still report a byteSize of 0, so based on that we now set node.numPoints to 0	1✔
205	current.numPoints = 0;	1✔
206	}	1✔
207		1✔
208	current.nodeType = type;	1✔
209		1✔
210	if (current.nodeType === NODE_TYPE.PROXY) {	1✔
211	continue;	1✔
212	}	1✔
213		1✔
214	for (let childIndex = 0; childIndex < 8; childIndex++) {	1✔
215	const childExists = ((1 << childIndex) & childMask) !== 0;	1✔
216		1✔
217	if (!childExists) {	1✔
218	continue;	1✔
219	}	1✔
220		1✔
221	const child = new Potree2Node(numPoints, childMask, this.layer);	1✔
222	child.spacing = current.spacing / 2;	1✔
223		1✔
224	current.add(child, childIndex);	1✔
225	stack.push(child);	1✔
226	}	1✔
227	}	1✔
228	}	1✔
229	}	1✔
230		1✔
231	export default Potree2Node;	1✔

iTowns / itowns / 9745191940

Source File Press 'n' to go to next uncovered line, 'b' for previous

Source File
Press 'n' to go to next uncovered line, 'b' for previous