Press n or j to go to the next uncovered block, b, p or k for the previous block.
| 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 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 | 1x 1x 1x 1x 1x 1x 1x 37x 37x 37x 37x 37x 1x 36x 1x 35x 1x 34x 34x 34x 34x 34x 34x 34x 34x 34x 34x 34x 34x 4x 34x 5x 34x 1x 6x 1x 5x 1x 4x 4x 4x 4x 4x 11x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 1x 1x 1x 1x 4x 1x 3x 3x 3x 3x 9x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 1x 2x 2x 2x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 2x 2x 2x 2x 1x 1x 1x 21x 21x 21x 21x 21x 21x 21x 21x 3x 18x 18x 18x 18x 18x 18x 18x 18x 18x 18x 18x 18x 18x 18x 18x 18x 18x 18x 18x 18x 18x 18x 18x 59x 59x 59x 59x 59x 59x 59x 59x 59x 59x 59x 12x 12x 12x 12x 59x 19x 19x 19x 15x 19x 9x 9x 9x 9x 19x 5x 14x 14x 9x 14x 9x 19x 19x 19x 19x 19x 19x 19x 19x 12x 12x 12x 12x 12x 12x 19x 12x 12x 12x 12x 12x 12x 18x 18x 18x 18x 4x 18x 3x 18x 3x 18x 3x 18x 18x 18x 18x 18x 41x 41x 41x 41x 41x 11x 30x 30x 30x 30x 30x 30x 30x 30x 18x | import BoundingSphere from "./BoundingSphere.js";
import Cartesian3 from "./Cartesian3.js";
import ComponentDatatype from "./ComponentDatatype.js";
import Frozen from "./Frozen.js";
import defined from "./defined.js";
import DeveloperError from "./DeveloperError.js";
import Ellipsoid from "./Ellipsoid.js";
import Geometry from "./Geometry.js";
import GeometryAttribute from "./GeometryAttribute.js";
import GeometryAttributes from "./GeometryAttributes.js";
import IndexDatatype from "./IndexDatatype.js";
import CesiumMath from "./Math.js";
import PrimitiveType from "./PrimitiveType.js";
import VertexFormat from "./VertexFormat.js";
import WallGeometryLibrary from "./WallGeometryLibrary.js";
const scratchCartesian3Position1 = new Cartesian3();
const scratchCartesian3Position2 = new Cartesian3();
const scratchCartesian3Position4 = new Cartesian3();
const scratchCartesian3Position5 = new Cartesian3();
const scratchBitangent = new Cartesian3();
const scratchTangent = new Cartesian3();
const scratchNormal = new Cartesian3();
/**
* A description of a wall, which is similar to a KML line string. A wall is defined by a series of points,
* which extrude down to the ground. Optionally, they can extrude downwards to a specified height.
*
* @alias WallGeometry
* @constructor
*
* @param {object} options Object with the following properties:
* @param {Cartesian3[]} options.positions An array of Cartesian objects, which are the points of the wall.
* @param {number} [options.granularity=CesiumMath.RADIANS_PER_DEGREE] The distance, in radians, between each latitude and longitude. Determines the number of positions in the buffer.
* @param {number[]} [options.maximumHeights] An array parallel to <code>positions</code> that give the maximum height of the
* wall at <code>positions</code>. If undefined, the height of each position in used.
* @param {number[]} [options.minimumHeights] An array parallel to <code>positions</code> that give the minimum height of the
* wall at <code>positions</code>. If undefined, the height at each position is 0.0.
* @param {Ellipsoid} [options.ellipsoid=Ellipsoid.default] The ellipsoid for coordinate manipulation
* @param {VertexFormat} [options.vertexFormat=VertexFormat.DEFAULT] The vertex attributes to be computed.
*
* @exception {DeveloperError} positions length must be greater than or equal to 2.
* @exception {DeveloperError} positions and maximumHeights must have the same length.
* @exception {DeveloperError} positions and minimumHeights must have the same length.
*
* @see WallGeometry#createGeometry
* @see WallGeometry#fromConstantHeight
*
* @demo {@link https://sandcastle.cesium.com/index.html?src=Wall.html|Cesium Sandcastle Wall Demo}
*
* @example
* // create a wall that spans from ground level to 10000 meters
* const wall = new Cesium.WallGeometry({
* positions : Cesium.Cartesian3.fromDegreesArrayHeights([
* 19.0, 47.0, 10000.0,
* 19.0, 48.0, 10000.0,
* 20.0, 48.0, 10000.0,
* 20.0, 47.0, 10000.0,
* 19.0, 47.0, 10000.0
* ])
* });
* const geometry = Cesium.WallGeometry.createGeometry(wall);
*/
function WallGeometry(options) {
options = options ?? Frozen.EMPTY_OBJECT;
const wallPositions = options.positions;
const maximumHeights = options.maximumHeights;
const minimumHeights = options.minimumHeights;
//>>includeStart('debug', pragmas.debug);
if (!defined(wallPositions)) {
throw new DeveloperError("options.positions is required.");
}
if (
defined(maximumHeights) &&
maximumHeights.length !== wallPositions.length
) {
throw new DeveloperError(
"options.positions and options.maximumHeights must have the same length.",
);
}
if (
defined(minimumHeights) &&
minimumHeights.length !== wallPositions.length
) {
throw new DeveloperError(
"options.positions and options.minimumHeights must have the same length.",
);
}
//>>includeEnd('debug');
const vertexFormat = options.vertexFormat ?? VertexFormat.DEFAULT;
const granularity = options.granularity ?? CesiumMath.RADIANS_PER_DEGREE;
const ellipsoid = options.ellipsoid ?? Ellipsoid.default;
this._positions = wallPositions;
this._minimumHeights = minimumHeights;
this._maximumHeights = maximumHeights;
this._vertexFormat = VertexFormat.clone(vertexFormat);
this._granularity = granularity;
this._ellipsoid = Ellipsoid.clone(ellipsoid);
this._workerName = "createWallGeometry";
let numComponents = 1 + wallPositions.length * Cartesian3.packedLength + 2;
if (defined(minimumHeights)) {
numComponents += minimumHeights.length;
}
if (defined(maximumHeights)) {
numComponents += maximumHeights.length;
}
/**
* The number of elements used to pack the object into an array.
* @type {number}
*/
this.packedLength =
numComponents + Ellipsoid.packedLength + VertexFormat.packedLength + 1;
}
/**
* Stores the provided instance into the provided array.
*
* @param {WallGeometry} value The value to pack.
* @param {number[]} array The array to pack into.
* @param {number} [startingIndex=0] The index into the array at which to start packing the elements.
*
* @returns {number[]} The array that was packed into
*/
WallGeometry.pack = function (value, array, startingIndex) {
//>>includeStart('debug', pragmas.debug);
if (!defined(value)) {
throw new DeveloperError("value is required");
}
if (!defined(array)) {
throw new DeveloperError("array is required");
}
//>>includeEnd('debug');
startingIndex = startingIndex ?? 0;
let i;
const positions = value._positions;
let length = positions.length;
array[startingIndex++] = length;
for (i = 0; i < length; ++i, startingIndex += Cartesian3.packedLength) {
Cartesian3.pack(positions[i], array, startingIndex);
}
const minimumHeights = value._minimumHeights;
length = defined(minimumHeights) ? minimumHeights.length : 0;
array[startingIndex++] = length;
Iif (defined(minimumHeights)) {
for (i = 0; i < length; ++i) {
array[startingIndex++] = minimumHeights[i];
}
}
const maximumHeights = value._maximumHeights;
length = defined(maximumHeights) ? maximumHeights.length : 0;
array[startingIndex++] = length;
Iif (defined(maximumHeights)) {
for (i = 0; i < length; ++i) {
array[startingIndex++] = maximumHeights[i];
}
}
Ellipsoid.pack(value._ellipsoid, array, startingIndex);
startingIndex += Ellipsoid.packedLength;
VertexFormat.pack(value._vertexFormat, array, startingIndex);
startingIndex += VertexFormat.packedLength;
array[startingIndex] = value._granularity;
return array;
};
const scratchEllipsoid = Ellipsoid.clone(Ellipsoid.UNIT_SPHERE);
const scratchVertexFormat = new VertexFormat();
const scratchOptions = {
positions: undefined,
minimumHeights: undefined,
maximumHeights: undefined,
ellipsoid: scratchEllipsoid,
vertexFormat: scratchVertexFormat,
granularity: undefined,
};
/**
* Retrieves an instance from a packed array.
*
* @param {number[]} array The packed array.
* @param {number} [startingIndex=0] The starting index of the element to be unpacked.
* @param {WallGeometry} [result] The object into which to store the result.
* @returns {WallGeometry} The modified result parameter or a new WallGeometry instance if one was not provided.
*/
WallGeometry.unpack = function (array, startingIndex, result) {
//>>includeStart('debug', pragmas.debug);
if (!defined(array)) {
throw new DeveloperError("array is required");
}
//>>includeEnd('debug');
startingIndex = startingIndex ?? 0;
let i;
let length = array[startingIndex++];
const positions = new Array(length);
for (i = 0; i < length; ++i, startingIndex += Cartesian3.packedLength) {
positions[i] = Cartesian3.unpack(array, startingIndex);
}
length = array[startingIndex++];
let minimumHeights;
Iif (length > 0) {
minimumHeights = new Array(length);
for (i = 0; i < length; ++i) {
minimumHeights[i] = array[startingIndex++];
}
}
length = array[startingIndex++];
let maximumHeights;
Iif (length > 0) {
maximumHeights = new Array(length);
for (i = 0; i < length; ++i) {
maximumHeights[i] = array[startingIndex++];
}
}
const ellipsoid = Ellipsoid.unpack(array, startingIndex, scratchEllipsoid);
startingIndex += Ellipsoid.packedLength;
const vertexFormat = VertexFormat.unpack(
array,
startingIndex,
scratchVertexFormat,
);
startingIndex += VertexFormat.packedLength;
const granularity = array[startingIndex];
Eif (!defined(result)) {
scratchOptions.positions = positions;
scratchOptions.minimumHeights = minimumHeights;
scratchOptions.maximumHeights = maximumHeights;
scratchOptions.granularity = granularity;
return new WallGeometry(scratchOptions);
}
result._positions = positions;
result._minimumHeights = minimumHeights;
result._maximumHeights = maximumHeights;
result._ellipsoid = Ellipsoid.clone(ellipsoid, result._ellipsoid);
result._vertexFormat = VertexFormat.clone(vertexFormat, result._vertexFormat);
result._granularity = granularity;
return result;
};
/**
* A description of a wall, which is similar to a KML line string. A wall is defined by a series of points,
* which extrude down to the ground. Optionally, they can extrude downwards to a specified height.
*
* @param {object} options Object with the following properties:
* @param {Cartesian3[]} options.positions An array of Cartesian objects, which are the points of the wall.
* @param {number} [options.maximumHeight] A constant that defines the maximum height of the
* wall at <code>positions</code>. If undefined, the height of each position in used.
* @param {number} [options.minimumHeight] A constant that defines the minimum height of the
* wall at <code>positions</code>. If undefined, the height at each position is 0.0.
* @param {Ellipsoid} [options.ellipsoid=Ellipsoid.default] The ellipsoid for coordinate manipulation
* @param {VertexFormat} [options.vertexFormat=VertexFormat.DEFAULT] The vertex attributes to be computed.
* @returns {WallGeometry}
*
*
* @example
* // create a wall that spans from 10000 meters to 20000 meters
* const wall = Cesium.WallGeometry.fromConstantHeights({
* positions : Cesium.Cartesian3.fromDegreesArray([
* 19.0, 47.0,
* 19.0, 48.0,
* 20.0, 48.0,
* 20.0, 47.0,
* 19.0, 47.0,
* ]),
* minimumHeight : 20000.0,
* maximumHeight : 10000.0
* });
* const geometry = Cesium.WallGeometry.createGeometry(wall);
*
* @see WallGeometry#createGeometry
*/
WallGeometry.fromConstantHeights = function (options) {
options = options ?? Frozen.EMPTY_OBJECT;
const positions = options.positions;
//>>includeStart('debug', pragmas.debug);
if (!defined(positions)) {
throw new DeveloperError("options.positions is required.");
}
//>>includeEnd('debug');
let minHeights;
let maxHeights;
const min = options.minimumHeight;
const max = options.maximumHeight;
const doMin = defined(min);
const doMax = defined(max);
Eif (doMin || doMax) {
const length = positions.length;
minHeights = doMin ? new Array(length) : undefined;
maxHeights = doMax ? new Array(length) : undefined;
for (let i = 0; i < length; ++i) {
Eif (doMin) {
minHeights[i] = min;
}
Eif (doMax) {
maxHeights[i] = max;
}
}
}
const newOptions = {
positions: positions,
maximumHeights: maxHeights,
minimumHeights: minHeights,
ellipsoid: options.ellipsoid,
vertexFormat: options.vertexFormat,
};
return new WallGeometry(newOptions);
};
/**
* Computes the geometric representation of a wall, including its vertices, indices, and a bounding sphere.
*
* @param {WallGeometry} wallGeometry A description of the wall.
* @returns {Geometry|undefined} The computed vertices and indices.
*/
WallGeometry.createGeometry = function (wallGeometry) {
const wallPositions = wallGeometry._positions;
const minimumHeights = wallGeometry._minimumHeights;
const maximumHeights = wallGeometry._maximumHeights;
const vertexFormat = wallGeometry._vertexFormat;
const granularity = wallGeometry._granularity;
const ellipsoid = wallGeometry._ellipsoid;
const pos = WallGeometryLibrary.computePositions(
ellipsoid,
wallPositions,
maximumHeights,
minimumHeights,
granularity,
true,
);
if (!defined(pos)) {
return;
}
const bottomPositions = pos.bottomPositions;
const topPositions = pos.topPositions;
const numCorners = pos.numCorners;
let length = topPositions.length;
let size = length * 2;
const positions = vertexFormat.position ? new Float64Array(size) : undefined;
const normals = vertexFormat.normal ? new Float32Array(size) : undefined;
const tangents = vertexFormat.tangent ? new Float32Array(size) : undefined;
const bitangents = vertexFormat.bitangent
? new Float32Array(size)
: undefined;
const textureCoordinates = vertexFormat.st
? new Float32Array((size / 3) * 2)
: undefined;
let positionIndex = 0;
let normalIndex = 0;
let bitangentIndex = 0;
let tangentIndex = 0;
let stIndex = 0;
// add lower and upper points one after the other, lower
// points being even and upper points being odd
let normal = scratchNormal;
let tangent = scratchTangent;
let bitangent = scratchBitangent;
let recomputeNormal = true;
length /= 3;
let i;
let s = 0;
const ds = 1 / (length - numCorners - 1);
for (i = 0; i < length; ++i) {
const i3 = i * 3;
const topPosition = Cartesian3.fromArray(
topPositions,
i3,
scratchCartesian3Position1,
);
const bottomPosition = Cartesian3.fromArray(
bottomPositions,
i3,
scratchCartesian3Position2,
);
Eif (vertexFormat.position) {
// insert the lower point
positions[positionIndex++] = bottomPosition.x;
positions[positionIndex++] = bottomPosition.y;
positions[positionIndex++] = bottomPosition.z;
// insert the upper point
positions[positionIndex++] = topPosition.x;
positions[positionIndex++] = topPosition.y;
positions[positionIndex++] = topPosition.z;
}
if (vertexFormat.st) {
textureCoordinates[stIndex++] = s;
textureCoordinates[stIndex++] = 0.0;
textureCoordinates[stIndex++] = s;
textureCoordinates[stIndex++] = 1.0;
}
if (vertexFormat.normal || vertexFormat.tangent || vertexFormat.bitangent) {
let nextTop = Cartesian3.clone(
Cartesian3.ZERO,
scratchCartesian3Position5,
);
const groundPosition = Cartesian3.subtract(
topPosition,
ellipsoid.geodeticSurfaceNormal(
topPosition,
scratchCartesian3Position2,
),
scratchCartesian3Position2,
);
if (i + 1 < length) {
nextTop = Cartesian3.fromArray(
topPositions,
i3 + 3,
scratchCartesian3Position5,
);
}
if (recomputeNormal) {
const scalednextPosition = Cartesian3.subtract(
nextTop,
topPosition,
scratchCartesian3Position4,
);
const scaledGroundPosition = Cartesian3.subtract(
groundPosition,
topPosition,
scratchCartesian3Position1,
);
normal = Cartesian3.normalize(
Cartesian3.cross(scaledGroundPosition, scalednextPosition, normal),
normal,
);
recomputeNormal = false;
}
if (
Cartesian3.equalsEpsilon(topPosition, nextTop, CesiumMath.EPSILON10)
) {
recomputeNormal = true;
} else {
s += ds;
if (vertexFormat.tangent) {
tangent = Cartesian3.normalize(
Cartesian3.subtract(nextTop, topPosition, tangent),
tangent,
);
}
if (vertexFormat.bitangent) {
bitangent = Cartesian3.normalize(
Cartesian3.cross(normal, tangent, bitangent),
bitangent,
);
}
}
Eif (vertexFormat.normal) {
normals[normalIndex++] = normal.x;
normals[normalIndex++] = normal.y;
normals[normalIndex++] = normal.z;
normals[normalIndex++] = normal.x;
normals[normalIndex++] = normal.y;
normals[normalIndex++] = normal.z;
}
if (vertexFormat.tangent) {
tangents[tangentIndex++] = tangent.x;
tangents[tangentIndex++] = tangent.y;
tangents[tangentIndex++] = tangent.z;
tangents[tangentIndex++] = tangent.x;
tangents[tangentIndex++] = tangent.y;
tangents[tangentIndex++] = tangent.z;
}
if (vertexFormat.bitangent) {
bitangents[bitangentIndex++] = bitangent.x;
bitangents[bitangentIndex++] = bitangent.y;
bitangents[bitangentIndex++] = bitangent.z;
bitangents[bitangentIndex++] = bitangent.x;
bitangents[bitangentIndex++] = bitangent.y;
bitangents[bitangentIndex++] = bitangent.z;
}
}
}
const attributes = new GeometryAttributes();
Eif (vertexFormat.position) {
attributes.position = new GeometryAttribute({
componentDatatype: ComponentDatatype.DOUBLE,
componentsPerAttribute: 3,
values: positions,
});
}
if (vertexFormat.normal) {
attributes.normal = new GeometryAttribute({
componentDatatype: ComponentDatatype.FLOAT,
componentsPerAttribute: 3,
values: normals,
});
}
if (vertexFormat.tangent) {
attributes.tangent = new GeometryAttribute({
componentDatatype: ComponentDatatype.FLOAT,
componentsPerAttribute: 3,
values: tangents,
});
}
if (vertexFormat.bitangent) {
attributes.bitangent = new GeometryAttribute({
componentDatatype: ComponentDatatype.FLOAT,
componentsPerAttribute: 3,
values: bitangents,
});
}
if (vertexFormat.st) {
attributes.st = new GeometryAttribute({
componentDatatype: ComponentDatatype.FLOAT,
componentsPerAttribute: 2,
values: textureCoordinates,
});
}
// prepare the side walls, two triangles for each wall
//
// A (i+1) B (i+3) E
// +--------+-------+
// | / | /| triangles: A C B
// | / | / | B C D
// | / | / |
// | / | / |
// | / | / |
// | / | / |
// +--------+-------+
// C (i) D (i+2) F
//
const numVertices = size / 3;
size -= 6 * (numCorners + 1);
const indices = IndexDatatype.createTypedArray(numVertices, size);
let edgeIndex = 0;
for (i = 0; i < numVertices - 2; i += 2) {
const LL = i;
const LR = i + 2;
const pl = Cartesian3.fromArray(
positions,
LL * 3,
scratchCartesian3Position1,
);
const pr = Cartesian3.fromArray(
positions,
LR * 3,
scratchCartesian3Position2,
);
if (Cartesian3.equalsEpsilon(pl, pr, CesiumMath.EPSILON10)) {
continue;
}
const UL = i + 1;
const UR = i + 3;
indices[edgeIndex++] = UL;
indices[edgeIndex++] = LL;
indices[edgeIndex++] = UR;
indices[edgeIndex++] = UR;
indices[edgeIndex++] = LL;
indices[edgeIndex++] = LR;
}
return new Geometry({
attributes: attributes,
indices: indices,
primitiveType: PrimitiveType.TRIANGLES,
boundingSphere: new BoundingSphere.fromVertices(positions),
});
};
export default WallGeometry;
|