xtorcga
Version:
Xtor Compute Geometry Algorithm Libary 计算几何算法库
52 lines (51 loc) • 1.93 kB
JavaScript
;
Object.defineProperty(exports, "__esModule", { value: true });
exports.EllipsoidGeodesic = void 0;
var Cartographic_1 = require("./Cartographic");
/**
* 椭圆测地线 计算测地距离
*/
var EllipsoidGeodesic = /** @class */ (function () {
function EllipsoidGeodesic(_ellipsoid) {
this.start = new Cartographic_1.Cartographic();
this.end = new Cartographic_1.Cartographic();
}
EllipsoidGeodesic.prototype.computeProperties = function (ellipsoid) {
// var firstCartesian = Cartesian3.normalize(
// ellipsoid.cartographicToCartesian(start, scratchCart2),
// scratchCart1
// );
// var lastCartesian = Cartesian3.normalize(
// ellipsoid.cartographicToCartesian(end, scratchCart2),
// scratchCart2
// );
// //>>includeStart('debug', pragmas.debug);
// Check.typeOf.number.greaterThanOrEquals(
// "value",
// Math.abs(
// Math.abs(Cartesian3.angleBetween(firstCartesian, lastCartesian)) - Math.PI
// ),
// 0.0125
// );
// //>>includeEnd('debug');
// vincentyInverseFormula(
// this,
// ellipsoid.maximumRadius,
// ellipsoid.minimumRadius,
// start.longitude,
// start.latitude,
// end.longitude,
// end.latitude
// );
// ellipsoidGeodesic._start = Cartographic.clone(
// start,
// ellipsoidGeodesic._start
// );
// ellipsoidGeodesic._end = Cartographic.clone(end, ellipsoidGeodesic._end);
// ellipsoidGeodesic._start.height = 0;
// ellipsoidGeodesic._end.height = 0;
// setConstants(ellipsoidGeodesic);
};
return EllipsoidGeodesic;
}());
exports.EllipsoidGeodesic = EllipsoidGeodesic;