@loaders.gl/raster 5.0.0-beta.1 → 5.0.0-beta.4

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.
Files changed (146) hide show
  1. package/README.md +6 -2
  2. package/THIRD-PARTY-NOTICES.md +1 -1
  3. package/dist/geotiff/advanced.cjs +16 -11
  4. package/dist/geotiff/advanced.cjs.map +2 -2
  5. package/dist/geotiff/geotiff-loader-types.d.ts +1 -1
  6. package/dist/geotiff/geotiff-loader-types.js +2 -2
  7. package/dist/geotiff/geotiff-loader-types.js.map +1 -1
  8. package/dist/geotiff/geotiff-raster-loader-types.d.ts.map +1 -1
  9. package/dist/geotiff/geotiff-raster-loader-types.js +2 -2
  10. package/dist/geotiff/geotiff-raster-loader-types.js.map +1 -1
  11. package/dist/geotiff/geotiff-source-loader-types.js +1 -1
  12. package/dist/geotiff/geotiff-source-loader-types.js.map +1 -1
  13. package/dist/geotiff/geotiff-source-loader.js +1 -1
  14. package/dist/geotiff/lib/ome/load-ome-tiff.d.ts +1 -0
  15. package/dist/geotiff/lib/ome/load-ome-tiff.d.ts.map +1 -1
  16. package/dist/geotiff/lib/ome/load-ome-tiff.js +7 -1
  17. package/dist/geotiff/lib/ome/load-ome-tiff.js.map +1 -1
  18. package/dist/geotiff/lib/ome/omexml.d.ts.map +1 -1
  19. package/dist/geotiff/lib/ome/omexml.js +5 -4
  20. package/dist/geotiff/lib/ome/omexml.js.map +1 -1
  21. package/dist/geotiff/lib/tiff/tiff-gdal-metadata.d.ts.map +1 -1
  22. package/dist/geotiff/lib/tiff/tiff-gdal-metadata.js +6 -5
  23. package/dist/geotiff/lib/tiff/tiff-gdal-metadata.js.map +1 -1
  24. package/dist/geotiff/loaders.js +1 -1
  25. package/dist/geotiff/ometiff-source-loader-types.js +1 -1
  26. package/dist/geotiff/ometiff-source-loader-types.js.map +1 -1
  27. package/dist/geotiff/ometiff-source-loader.js +1 -1
  28. package/dist/geotiff-loader-types.d.ts +2 -0
  29. package/dist/geotiff-loader-types.d.ts.map +1 -0
  30. package/dist/geotiff-loader-types.js +2 -0
  31. package/dist/geotiff-loader-types.js.map +1 -0
  32. package/dist/geotiff-loader.d.ts +2 -0
  33. package/dist/geotiff-loader.d.ts.map +1 -0
  34. package/dist/geotiff-loader.js +2 -0
  35. package/dist/geotiff-loader.js.map +1 -0
  36. package/dist/geotiff-raster-loader-types.d.ts +2 -0
  37. package/dist/geotiff-raster-loader-types.d.ts.map +1 -0
  38. package/dist/geotiff-raster-loader-types.js +2 -0
  39. package/dist/geotiff-raster-loader-types.js.map +1 -0
  40. package/dist/geotiff-raster-loader.d.ts +2 -0
  41. package/dist/geotiff-raster-loader.d.ts.map +1 -0
  42. package/dist/geotiff-raster-loader.js +2 -0
  43. package/dist/geotiff-raster-loader.js.map +1 -0
  44. package/dist/geotiff-source-loader-types.d.ts +2 -0
  45. package/dist/geotiff-source-loader-types.d.ts.map +1 -0
  46. package/dist/geotiff-source-loader-types.js +2 -0
  47. package/dist/geotiff-source-loader-types.js.map +1 -0
  48. package/dist/geotiff-source-loader.d.ts +2 -0
  49. package/dist/geotiff-source-loader.d.ts.map +1 -0
  50. package/dist/geotiff-source-loader.js +2 -0
  51. package/dist/geotiff-source-loader.js.map +1 -0
  52. package/dist/index.cjs +11 -11
  53. package/dist/index.cjs.map +2 -2
  54. package/dist/lerc/lerc-loader-types.d.ts +1 -1
  55. package/dist/lerc/lerc-loader-types.js +2 -2
  56. package/dist/lerc/lerc-loader-types.js.map +1 -1
  57. package/dist/lerc-loader-types.d.ts +2 -0
  58. package/dist/lerc-loader-types.d.ts.map +1 -0
  59. package/dist/lerc-loader-types.js +2 -0
  60. package/dist/lerc-loader-types.js.map +1 -0
  61. package/dist/lerc-loader.d.ts +2 -0
  62. package/dist/lerc-loader.d.ts.map +1 -0
  63. package/dist/lerc-loader.js +2 -0
  64. package/dist/lerc-loader.js.map +1 -0
  65. package/dist/ometiff-source-loader-types.d.ts +2 -0
  66. package/dist/ometiff-source-loader-types.d.ts.map +1 -0
  67. package/dist/ometiff-source-loader-types.js +2 -0
  68. package/dist/ometiff-source-loader-types.js.map +1 -0
  69. package/dist/ometiff-source-loader.d.ts +2 -0
  70. package/dist/ometiff-source-loader.d.ts.map +1 -0
  71. package/dist/ometiff-source-loader.js +2 -0
  72. package/dist/ometiff-source-loader.js.map +1 -0
  73. package/dist/quantized-mesh-loader-types.d.ts +2 -0
  74. package/dist/quantized-mesh-loader-types.d.ts.map +1 -0
  75. package/dist/quantized-mesh-loader-types.js +2 -0
  76. package/dist/quantized-mesh-loader-types.js.map +1 -0
  77. package/dist/quantized-mesh-loader.d.ts +2 -0
  78. package/dist/quantized-mesh-loader.d.ts.map +1 -0
  79. package/dist/quantized-mesh-loader.js +2 -0
  80. package/dist/quantized-mesh-loader.js.map +1 -0
  81. package/dist/quantized-mesh-worker.js +600 -123
  82. package/dist/quantized-mesh-writer.d.ts +2 -0
  83. package/dist/quantized-mesh-writer.d.ts.map +1 -0
  84. package/dist/quantized-mesh-writer.js +2 -0
  85. package/dist/quantized-mesh-writer.js.map +1 -0
  86. package/dist/terrain/index.cjs +24 -523
  87. package/dist/terrain/index.cjs.map +4 -4
  88. package/dist/terrain/lib/parse-terrain.d.ts +2 -0
  89. package/dist/terrain/lib/parse-terrain.d.ts.map +1 -1
  90. package/dist/terrain/lib/parse-terrain.js +23 -38
  91. package/dist/terrain/lib/parse-terrain.js.map +1 -1
  92. package/dist/terrain/lib/utils/version.js +1 -1
  93. package/dist/terrain/quantized-mesh-loader-types.d.ts.map +1 -1
  94. package/dist/terrain/quantized-mesh-loader-types.js +1 -2
  95. package/dist/terrain/quantized-mesh-loader-types.js.map +1 -1
  96. package/dist/terrain/terrain-loader-types.d.ts +2 -2
  97. package/dist/terrain/terrain-loader-types.d.ts.map +1 -1
  98. package/dist/terrain/terrain-loader-types.js +1 -1
  99. package/dist/terrain/terrain-loader-types.js.map +1 -1
  100. package/dist/terrain/terrain-loader.js +3 -3
  101. package/dist/terrain/terrain-loader.js.map +1 -1
  102. package/dist/terrain-loader-types.d.ts +2 -0
  103. package/dist/terrain-loader-types.d.ts.map +1 -0
  104. package/dist/terrain-loader-types.js +2 -0
  105. package/dist/terrain-loader-types.js.map +1 -0
  106. package/dist/terrain-loader.d.ts +2 -0
  107. package/dist/terrain-loader.d.ts.map +1 -0
  108. package/dist/terrain-loader.js +2 -0
  109. package/dist/terrain-loader.js.map +1 -0
  110. package/dist/terrain-worker.js +4641 -3581
  111. package/package.json +80 -54
  112. package/src/geotiff/geotiff-loader-types.ts +1 -1
  113. package/src/geotiff/geotiff-raster-loader-types.ts +1 -3
  114. package/src/geotiff/geotiff-source-loader-types.ts +1 -1
  115. package/src/geotiff/lib/ome/load-ome-tiff.ts +7 -1
  116. package/src/geotiff/lib/ome/omexml.ts +5 -4
  117. package/src/geotiff/lib/tiff/tiff-gdal-metadata.ts +6 -5
  118. package/src/geotiff/ometiff-source-loader-types.ts +1 -1
  119. package/src/geotiff-loader-types.ts +1 -0
  120. package/src/geotiff-loader.ts +1 -0
  121. package/src/geotiff-raster-loader-types.ts +1 -0
  122. package/src/geotiff-raster-loader.ts +1 -0
  123. package/src/geotiff-source-loader-types.ts +1 -0
  124. package/src/geotiff-source-loader.ts +1 -0
  125. package/src/lerc/lerc-loader-types.ts +1 -1
  126. package/src/lerc-loader-types.ts +1 -0
  127. package/src/lerc-loader.ts +1 -0
  128. package/src/ometiff-source-loader-types.ts +1 -0
  129. package/src/ometiff-source-loader.ts +1 -0
  130. package/src/quantized-mesh-loader-types.ts +1 -0
  131. package/src/quantized-mesh-loader.ts +1 -0
  132. package/src/quantized-mesh-writer.ts +1 -0
  133. package/src/terrain/lib/parse-terrain.ts +36 -40
  134. package/src/terrain/quantized-mesh-loader-types.ts +1 -2
  135. package/src/terrain/terrain-loader-types.ts +3 -4
  136. package/src/terrain/terrain-loader.ts +3 -3
  137. package/src/terrain-loader-types.ts +1 -0
  138. package/src/terrain-loader.ts +1 -0
  139. package/dist/terrain/libs/README.md +0 -10
  140. package/dist/terrain/libs/martini-LICENSE +0 -15
  141. package/dist/terrain/libs/martini.d.mts +0 -19
  142. package/dist/terrain/libs/martini.mjs +0 -164
  143. package/src/terrain/libs/README.md +0 -10
  144. package/src/terrain/libs/martini-LICENSE +0 -15
  145. package/src/terrain/libs/martini.d.mts +0 -19
  146. package/src/terrain/libs/martini.mjs +0 -164
@@ -1,19 +0,0 @@
1
- /** Pinned Martini terrain tessellator. */
2
- export default class Martini {
3
- /** Creates a tessellator for a 2^n+1 grid. */
4
- constructor(gridSize?: number);
5
- /** Creates a tile from one padded elevation grid. */
6
- createTile(terrain: Float32Array): MartiniTile;
7
- }
8
- /** One heightmap tile's mesh decoder. */
9
- export interface MartiniTile {
10
- /** Builds mesh vertices and triangle indices at the requested maximum error. */
11
- getMesh(maxError?: number): MartiniMesh;
12
- }
13
- /** Generated integer-grid mesh buffers. */
14
- export interface MartiniMesh {
15
- /** Paired grid coordinates of each vertex. */
16
- readonly vertices: Uint16Array;
17
- /** Triangle vertex indices. */
18
- readonly triangles: Uint32Array;
19
- }
@@ -1,164 +0,0 @@
1
-
2
- export default class Martini {
3
- constructor(gridSize = 257) {
4
- this.gridSize = gridSize;
5
- const tileSize = gridSize - 1;
6
- if (tileSize & (tileSize - 1)) throw new Error(
7
- `Expected grid size to be 2^n+1, got ${gridSize}.`);
8
-
9
- this.numTriangles = tileSize * tileSize * 2 - 2;
10
- this.numParentTriangles = this.numTriangles - tileSize * tileSize;
11
-
12
- this.indices = new Uint32Array(this.gridSize * this.gridSize);
13
-
14
- // coordinates for all possible triangles in an RTIN tile
15
- this.coords = new Uint16Array(this.numTriangles * 4);
16
-
17
- // get triangle coordinates from its index in an implicit binary tree
18
- for (let i = 0; i < this.numTriangles; i++) {
19
- let id = i + 2;
20
- let ax = 0, ay = 0, bx = 0, by = 0, cx = 0, cy = 0;
21
- if (id & 1) {
22
- bx = by = cx = tileSize; // bottom-left triangle
23
- } else {
24
- ax = ay = cy = tileSize; // top-right triangle
25
- }
26
- while ((id >>= 1) > 1) {
27
- const mx = (ax + bx) >> 1;
28
- const my = (ay + by) >> 1;
29
-
30
- if (id & 1) { // left half
31
- bx = ax; by = ay;
32
- ax = cx; ay = cy;
33
- } else { // right half
34
- ax = bx; ay = by;
35
- bx = cx; by = cy;
36
- }
37
- cx = mx; cy = my;
38
- }
39
- const k = i * 4;
40
- this.coords[k + 0] = ax;
41
- this.coords[k + 1] = ay;
42
- this.coords[k + 2] = bx;
43
- this.coords[k + 3] = by;
44
- }
45
- }
46
-
47
- createTile(terrain) {
48
- return new Tile(terrain, this);
49
- }
50
- }
51
-
52
- class Tile {
53
- constructor(terrain, martini) {
54
- const size = martini.gridSize;
55
- if (terrain.length !== size * size) throw new Error(
56
- `Expected terrain data of length ${size * size} (${size} x ${size}), got ${terrain.length}.`);
57
-
58
- this.terrain = terrain;
59
- this.martini = martini;
60
- this.errors = new Float32Array(terrain.length);
61
- this.update();
62
- }
63
-
64
- update() {
65
- const {numTriangles, numParentTriangles, coords, gridSize: size} = this.martini;
66
- const {terrain, errors} = this;
67
-
68
- // iterate over all possible triangles, starting from the smallest level
69
- for (let i = numTriangles - 1; i >= 0; i--) {
70
- const k = i * 4;
71
- const ax = coords[k + 0];
72
- const ay = coords[k + 1];
73
- const bx = coords[k + 2];
74
- const by = coords[k + 3];
75
- const mx = (ax + bx) >> 1;
76
- const my = (ay + by) >> 1;
77
- const cx = mx + my - ay;
78
- const cy = my + ax - mx;
79
-
80
- // calculate error in the middle of the long edge of the triangle
81
- const interpolatedHeight = (terrain[ay * size + ax] + terrain[by * size + bx]) / 2;
82
- const middleIndex = my * size + mx;
83
- const middleError = Math.abs(interpolatedHeight - terrain[middleIndex]);
84
-
85
- errors[middleIndex] = Math.max(errors[middleIndex], middleError);
86
-
87
- if (i < numParentTriangles) { // bigger triangles; accumulate error with children
88
- const leftChildIndex = ((ay + cy) >> 1) * size + ((ax + cx) >> 1);
89
- const rightChildIndex = ((by + cy) >> 1) * size + ((bx + cx) >> 1);
90
- errors[middleIndex] = Math.max(errors[middleIndex], errors[leftChildIndex], errors[rightChildIndex]);
91
- }
92
- }
93
- }
94
-
95
- getMesh(maxError = 0) {
96
- const {gridSize: size, indices} = this.martini;
97
- const {errors} = this;
98
- let numVertices = 0;
99
- let numTriangles = 0;
100
- const max = size - 1;
101
-
102
- // use an index grid to keep track of vertices that were already used to avoid duplication
103
- indices.fill(0);
104
-
105
- // retrieve mesh in two stages that both traverse the error map:
106
- // - countElements: find used vertices (and assign each an index), and count triangles (for minimum allocation)
107
- // - processTriangle: fill the allocated vertices & triangles typed arrays
108
-
109
- function countElements(ax, ay, bx, by, cx, cy) {
110
- const mx = (ax + bx) >> 1;
111
- const my = (ay + by) >> 1;
112
-
113
- if (Math.abs(ax - cx) + Math.abs(ay - cy) > 1 && errors[my * size + mx] > maxError) {
114
- countElements(cx, cy, ax, ay, mx, my);
115
- countElements(bx, by, cx, cy, mx, my);
116
- } else {
117
- indices[ay * size + ax] = indices[ay * size + ax] || ++numVertices;
118
- indices[by * size + bx] = indices[by * size + bx] || ++numVertices;
119
- indices[cy * size + cx] = indices[cy * size + cx] || ++numVertices;
120
- numTriangles++;
121
- }
122
- }
123
- countElements(0, 0, max, max, max, 0);
124
- countElements(max, max, 0, 0, 0, max);
125
-
126
- const vertices = new Uint16Array(numVertices * 2);
127
- const triangles = new Uint32Array(numTriangles * 3);
128
- let triIndex = 0;
129
-
130
- function processTriangle(ax, ay, bx, by, cx, cy) {
131
- const mx = (ax + bx) >> 1;
132
- const my = (ay + by) >> 1;
133
-
134
- if (Math.abs(ax - cx) + Math.abs(ay - cy) > 1 && errors[my * size + mx] > maxError) {
135
- // triangle doesn't approximate the surface well enough; drill down further
136
- processTriangle(cx, cy, ax, ay, mx, my);
137
- processTriangle(bx, by, cx, cy, mx, my);
138
-
139
- } else {
140
- // add a triangle
141
- const a = indices[ay * size + ax] - 1;
142
- const b = indices[by * size + bx] - 1;
143
- const c = indices[cy * size + cx] - 1;
144
-
145
- vertices[2 * a] = ax;
146
- vertices[2 * a + 1] = ay;
147
-
148
- vertices[2 * b] = bx;
149
- vertices[2 * b + 1] = by;
150
-
151
- vertices[2 * c] = cx;
152
- vertices[2 * c + 1] = cy;
153
-
154
- triangles[triIndex++] = a;
155
- triangles[triIndex++] = b;
156
- triangles[triIndex++] = c;
157
- }
158
- }
159
- processTriangle(0, 0, max, max, max, 0);
160
- processTriangle(max, max, 0, 0, 0, max);
161
-
162
- return {vertices, triangles};
163
- }
164
- }
@@ -1,10 +0,0 @@
1
- # Martini
2
-
3
- martini.mjs is copied unchanged from the ISC-licensed @mapbox/martini 0.2.0
4
- package. See martini-LICENSE. Upstream: https://github.com/mapbox/martini/tree/v0.2.0
5
-
6
- SHA-256: 4df72465a6d168d419ad41593bbeea72025f0be083b01ce16372b071e316430c
7
-
8
- Retain the pinned development dependency for source verification when updating.
9
- The existing vendored-library coverage exclusion applies; terrain adapter tests
10
- exercise mesh generation through this implementation.
@@ -1,15 +0,0 @@
1
- ISC License
2
-
3
- Copyright (c) 2019, Mapbox
4
-
5
- Permission to use, copy, modify, and/or distribute this software for any purpose
6
- with or without fee is hereby granted, provided that the above copyright notice
7
- and this permission notice appear in all copies.
8
-
9
- THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH
10
- REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND
11
- FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,
12
- INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS
13
- OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
14
- TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF
15
- THIS SOFTWARE.
@@ -1,19 +0,0 @@
1
- /** Pinned Martini terrain tessellator. */
2
- export default class Martini {
3
- /** Creates a tessellator for a 2^n+1 grid. */
4
- constructor(gridSize?: number);
5
- /** Creates a tile from one padded elevation grid. */
6
- createTile(terrain: Float32Array): MartiniTile;
7
- }
8
- /** One heightmap tile's mesh decoder. */
9
- export interface MartiniTile {
10
- /** Builds mesh vertices and triangle indices at the requested maximum error. */
11
- getMesh(maxError?: number): MartiniMesh;
12
- }
13
- /** Generated integer-grid mesh buffers. */
14
- export interface MartiniMesh {
15
- /** Paired grid coordinates of each vertex. */
16
- readonly vertices: Uint16Array;
17
- /** Triangle vertex indices. */
18
- readonly triangles: Uint32Array;
19
- }
@@ -1,164 +0,0 @@
1
-
2
- export default class Martini {
3
- constructor(gridSize = 257) {
4
- this.gridSize = gridSize;
5
- const tileSize = gridSize - 1;
6
- if (tileSize & (tileSize - 1)) throw new Error(
7
- `Expected grid size to be 2^n+1, got ${gridSize}.`);
8
-
9
- this.numTriangles = tileSize * tileSize * 2 - 2;
10
- this.numParentTriangles = this.numTriangles - tileSize * tileSize;
11
-
12
- this.indices = new Uint32Array(this.gridSize * this.gridSize);
13
-
14
- // coordinates for all possible triangles in an RTIN tile
15
- this.coords = new Uint16Array(this.numTriangles * 4);
16
-
17
- // get triangle coordinates from its index in an implicit binary tree
18
- for (let i = 0; i < this.numTriangles; i++) {
19
- let id = i + 2;
20
- let ax = 0, ay = 0, bx = 0, by = 0, cx = 0, cy = 0;
21
- if (id & 1) {
22
- bx = by = cx = tileSize; // bottom-left triangle
23
- } else {
24
- ax = ay = cy = tileSize; // top-right triangle
25
- }
26
- while ((id >>= 1) > 1) {
27
- const mx = (ax + bx) >> 1;
28
- const my = (ay + by) >> 1;
29
-
30
- if (id & 1) { // left half
31
- bx = ax; by = ay;
32
- ax = cx; ay = cy;
33
- } else { // right half
34
- ax = bx; ay = by;
35
- bx = cx; by = cy;
36
- }
37
- cx = mx; cy = my;
38
- }
39
- const k = i * 4;
40
- this.coords[k + 0] = ax;
41
- this.coords[k + 1] = ay;
42
- this.coords[k + 2] = bx;
43
- this.coords[k + 3] = by;
44
- }
45
- }
46
-
47
- createTile(terrain) {
48
- return new Tile(terrain, this);
49
- }
50
- }
51
-
52
- class Tile {
53
- constructor(terrain, martini) {
54
- const size = martini.gridSize;
55
- if (terrain.length !== size * size) throw new Error(
56
- `Expected terrain data of length ${size * size} (${size} x ${size}), got ${terrain.length}.`);
57
-
58
- this.terrain = terrain;
59
- this.martini = martini;
60
- this.errors = new Float32Array(terrain.length);
61
- this.update();
62
- }
63
-
64
- update() {
65
- const {numTriangles, numParentTriangles, coords, gridSize: size} = this.martini;
66
- const {terrain, errors} = this;
67
-
68
- // iterate over all possible triangles, starting from the smallest level
69
- for (let i = numTriangles - 1; i >= 0; i--) {
70
- const k = i * 4;
71
- const ax = coords[k + 0];
72
- const ay = coords[k + 1];
73
- const bx = coords[k + 2];
74
- const by = coords[k + 3];
75
- const mx = (ax + bx) >> 1;
76
- const my = (ay + by) >> 1;
77
- const cx = mx + my - ay;
78
- const cy = my + ax - mx;
79
-
80
- // calculate error in the middle of the long edge of the triangle
81
- const interpolatedHeight = (terrain[ay * size + ax] + terrain[by * size + bx]) / 2;
82
- const middleIndex = my * size + mx;
83
- const middleError = Math.abs(interpolatedHeight - terrain[middleIndex]);
84
-
85
- errors[middleIndex] = Math.max(errors[middleIndex], middleError);
86
-
87
- if (i < numParentTriangles) { // bigger triangles; accumulate error with children
88
- const leftChildIndex = ((ay + cy) >> 1) * size + ((ax + cx) >> 1);
89
- const rightChildIndex = ((by + cy) >> 1) * size + ((bx + cx) >> 1);
90
- errors[middleIndex] = Math.max(errors[middleIndex], errors[leftChildIndex], errors[rightChildIndex]);
91
- }
92
- }
93
- }
94
-
95
- getMesh(maxError = 0) {
96
- const {gridSize: size, indices} = this.martini;
97
- const {errors} = this;
98
- let numVertices = 0;
99
- let numTriangles = 0;
100
- const max = size - 1;
101
-
102
- // use an index grid to keep track of vertices that were already used to avoid duplication
103
- indices.fill(0);
104
-
105
- // retrieve mesh in two stages that both traverse the error map:
106
- // - countElements: find used vertices (and assign each an index), and count triangles (for minimum allocation)
107
- // - processTriangle: fill the allocated vertices & triangles typed arrays
108
-
109
- function countElements(ax, ay, bx, by, cx, cy) {
110
- const mx = (ax + bx) >> 1;
111
- const my = (ay + by) >> 1;
112
-
113
- if (Math.abs(ax - cx) + Math.abs(ay - cy) > 1 && errors[my * size + mx] > maxError) {
114
- countElements(cx, cy, ax, ay, mx, my);
115
- countElements(bx, by, cx, cy, mx, my);
116
- } else {
117
- indices[ay * size + ax] = indices[ay * size + ax] || ++numVertices;
118
- indices[by * size + bx] = indices[by * size + bx] || ++numVertices;
119
- indices[cy * size + cx] = indices[cy * size + cx] || ++numVertices;
120
- numTriangles++;
121
- }
122
- }
123
- countElements(0, 0, max, max, max, 0);
124
- countElements(max, max, 0, 0, 0, max);
125
-
126
- const vertices = new Uint16Array(numVertices * 2);
127
- const triangles = new Uint32Array(numTriangles * 3);
128
- let triIndex = 0;
129
-
130
- function processTriangle(ax, ay, bx, by, cx, cy) {
131
- const mx = (ax + bx) >> 1;
132
- const my = (ay + by) >> 1;
133
-
134
- if (Math.abs(ax - cx) + Math.abs(ay - cy) > 1 && errors[my * size + mx] > maxError) {
135
- // triangle doesn't approximate the surface well enough; drill down further
136
- processTriangle(cx, cy, ax, ay, mx, my);
137
- processTriangle(bx, by, cx, cy, mx, my);
138
-
139
- } else {
140
- // add a triangle
141
- const a = indices[ay * size + ax] - 1;
142
- const b = indices[by * size + bx] - 1;
143
- const c = indices[cy * size + cx] - 1;
144
-
145
- vertices[2 * a] = ax;
146
- vertices[2 * a + 1] = ay;
147
-
148
- vertices[2 * b] = bx;
149
- vertices[2 * b + 1] = by;
150
-
151
- vertices[2 * c] = cx;
152
- vertices[2 * c + 1] = cy;
153
-
154
- triangles[triIndex++] = a;
155
- triangles[triIndex++] = b;
156
- triangles[triIndex++] = c;
157
- }
158
- }
159
- processTriangle(0, 0, max, max, max, 0);
160
- processTriangle(max, max, 0, 0, 0, max);
161
-
162
- return {vertices, triangles};
163
- }
164
- }