You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
235 lines
6.7 KiB
JavaScript
235 lines
6.7 KiB
JavaScript
/**
|
|
* Cesium - https://github.com/CesiumGS/cesium
|
|
*
|
|
* Copyright 2011-2020 Cesium Contributors
|
|
*
|
|
* Licensed under the Apache License, Version 2.0 (the "License");
|
|
* you may not use this file except in compliance with the License.
|
|
* You may obtain a copy of the License at
|
|
*
|
|
* http://www.apache.org/licenses/LICENSE-2.0
|
|
*
|
|
* Unless required by applicable law or agreed to in writing, software
|
|
* distributed under the License is distributed on an "AS IS" BASIS,
|
|
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
* See the License for the specific language governing permissions and
|
|
* limitations under the License.
|
|
*
|
|
* Columbus View (Pat. Pend.)
|
|
*
|
|
* Portions licensed separately.
|
|
* See https://github.com/CesiumGS/cesium/blob/master/LICENSE.md for full licensing details.
|
|
*/
|
|
|
|
define(['exports', './arrayRemoveDuplicates-28d5a12e', './Cartesian2-716c2715', './when-208fe5b0', './Math-3ba16bed', './PolylinePipeline-13b674b4'], function (exports, arrayRemoveDuplicates, Cartesian2, when, _Math, PolylinePipeline) { 'use strict';
|
|
|
|
/**
|
|
* @private
|
|
*/
|
|
var WallGeometryLibrary = {};
|
|
|
|
function latLonEquals(c0, c1) {
|
|
return (
|
|
_Math.CesiumMath.equalsEpsilon(c0.latitude, c1.latitude, _Math.CesiumMath.EPSILON10) &&
|
|
_Math.CesiumMath.equalsEpsilon(c0.longitude, c1.longitude, _Math.CesiumMath.EPSILON10)
|
|
);
|
|
}
|
|
|
|
var scratchCartographic1 = new Cartesian2.Cartographic();
|
|
var scratchCartographic2 = new Cartesian2.Cartographic();
|
|
function removeDuplicates(ellipsoid, positions, topHeights, bottomHeights) {
|
|
positions = arrayRemoveDuplicates.arrayRemoveDuplicates(positions, Cartesian2.Cartesian3.equalsEpsilon);
|
|
|
|
var length = positions.length;
|
|
if (length < 2) {
|
|
return;
|
|
}
|
|
|
|
var hasBottomHeights = when.defined(bottomHeights);
|
|
var hasTopHeights = when.defined(topHeights);
|
|
|
|
var cleanedPositions = new Array(length);
|
|
var cleanedTopHeights = new Array(length);
|
|
var cleanedBottomHeights = new Array(length);
|
|
|
|
var v0 = positions[0];
|
|
cleanedPositions[0] = v0;
|
|
|
|
var c0 = ellipsoid.cartesianToCartographic(v0, scratchCartographic1);
|
|
if (hasTopHeights) {
|
|
c0.height = topHeights[0];
|
|
}
|
|
|
|
cleanedTopHeights[0] = c0.height;
|
|
|
|
if (hasBottomHeights) {
|
|
cleanedBottomHeights[0] = bottomHeights[0];
|
|
} else {
|
|
cleanedBottomHeights[0] = 0.0;
|
|
}
|
|
|
|
var startTopHeight = cleanedTopHeights[0];
|
|
var startBottomHeight = cleanedBottomHeights[0];
|
|
var hasAllSameHeights = startTopHeight === startBottomHeight;
|
|
|
|
var index = 1;
|
|
for (var i = 1; i < length; ++i) {
|
|
var v1 = positions[i];
|
|
var c1 = ellipsoid.cartesianToCartographic(v1, scratchCartographic2);
|
|
if (hasTopHeights) {
|
|
c1.height = topHeights[i];
|
|
}
|
|
hasAllSameHeights = hasAllSameHeights && c1.height === 0;
|
|
|
|
if (!latLonEquals(c0, c1)) {
|
|
cleanedPositions[index] = v1; // Shallow copy!
|
|
cleanedTopHeights[index] = c1.height;
|
|
|
|
if (hasBottomHeights) {
|
|
cleanedBottomHeights[index] = bottomHeights[i];
|
|
} else {
|
|
cleanedBottomHeights[index] = 0.0;
|
|
}
|
|
hasAllSameHeights =
|
|
hasAllSameHeights &&
|
|
cleanedTopHeights[index] === cleanedBottomHeights[index];
|
|
|
|
Cartesian2.Cartographic.clone(c1, c0);
|
|
++index;
|
|
} else if (c0.height < c1.height) {
|
|
// two adjacent positions are the same, so use whichever has the greater height
|
|
cleanedTopHeights[index - 1] = c1.height;
|
|
}
|
|
}
|
|
|
|
if (hasAllSameHeights || index < 2) {
|
|
return;
|
|
}
|
|
|
|
cleanedPositions.length = index;
|
|
cleanedTopHeights.length = index;
|
|
cleanedBottomHeights.length = index;
|
|
|
|
return {
|
|
positions: cleanedPositions,
|
|
topHeights: cleanedTopHeights,
|
|
bottomHeights: cleanedBottomHeights,
|
|
};
|
|
}
|
|
|
|
var positionsArrayScratch = new Array(2);
|
|
var heightsArrayScratch = new Array(2);
|
|
var generateArcOptionsScratch = {
|
|
positions: undefined,
|
|
height: undefined,
|
|
granularity: undefined,
|
|
ellipsoid: undefined,
|
|
};
|
|
|
|
/**
|
|
* @private
|
|
*/
|
|
WallGeometryLibrary.computePositions = function (
|
|
ellipsoid,
|
|
wallPositions,
|
|
maximumHeights,
|
|
minimumHeights,
|
|
granularity,
|
|
duplicateCorners
|
|
) {
|
|
var o = removeDuplicates(
|
|
ellipsoid,
|
|
wallPositions,
|
|
maximumHeights,
|
|
minimumHeights
|
|
);
|
|
|
|
if (!when.defined(o)) {
|
|
return;
|
|
}
|
|
|
|
wallPositions = o.positions;
|
|
maximumHeights = o.topHeights;
|
|
minimumHeights = o.bottomHeights;
|
|
|
|
var length = wallPositions.length;
|
|
var numCorners = length - 2;
|
|
var topPositions;
|
|
var bottomPositions;
|
|
|
|
var minDistance = _Math.CesiumMath.chordLength(
|
|
granularity,
|
|
ellipsoid.maximumRadius
|
|
);
|
|
|
|
var generateArcOptions = generateArcOptionsScratch;
|
|
generateArcOptions.minDistance = minDistance;
|
|
generateArcOptions.ellipsoid = ellipsoid;
|
|
|
|
if (duplicateCorners) {
|
|
var count = 0;
|
|
var i;
|
|
|
|
for (i = 0; i < length - 1; i++) {
|
|
count +=
|
|
PolylinePipeline.PolylinePipeline.numberOfPoints(
|
|
wallPositions[i],
|
|
wallPositions[i + 1],
|
|
minDistance
|
|
) + 1;
|
|
}
|
|
|
|
topPositions = new Float64Array(count * 3);
|
|
bottomPositions = new Float64Array(count * 3);
|
|
|
|
var generateArcPositions = positionsArrayScratch;
|
|
var generateArcHeights = heightsArrayScratch;
|
|
generateArcOptions.positions = generateArcPositions;
|
|
generateArcOptions.height = generateArcHeights;
|
|
|
|
var offset = 0;
|
|
for (i = 0; i < length - 1; i++) {
|
|
generateArcPositions[0] = wallPositions[i];
|
|
generateArcPositions[1] = wallPositions[i + 1];
|
|
|
|
generateArcHeights[0] = maximumHeights[i];
|
|
generateArcHeights[1] = maximumHeights[i + 1];
|
|
|
|
var pos = PolylinePipeline.PolylinePipeline.generateArc(generateArcOptions);
|
|
topPositions.set(pos, offset);
|
|
|
|
generateArcHeights[0] = minimumHeights[i];
|
|
generateArcHeights[1] = minimumHeights[i + 1];
|
|
|
|
bottomPositions.set(
|
|
PolylinePipeline.PolylinePipeline.generateArc(generateArcOptions),
|
|
offset
|
|
);
|
|
|
|
offset += pos.length;
|
|
}
|
|
} else {
|
|
generateArcOptions.positions = wallPositions;
|
|
generateArcOptions.height = maximumHeights;
|
|
topPositions = new Float64Array(
|
|
PolylinePipeline.PolylinePipeline.generateArc(generateArcOptions)
|
|
);
|
|
|
|
generateArcOptions.height = minimumHeights;
|
|
bottomPositions = new Float64Array(
|
|
PolylinePipeline.PolylinePipeline.generateArc(generateArcOptions)
|
|
);
|
|
}
|
|
|
|
return {
|
|
bottomPositions: bottomPositions,
|
|
topPositions: topPositions,
|
|
numCorners: numCorners,
|
|
};
|
|
};
|
|
|
|
exports.WallGeometryLibrary = WallGeometryLibrary;
|
|
|
|
});
|
|
//# sourceMappingURL=WallGeometryLibrary-70806f1d.js.map
|