@woosh/meep-engine 2.79.0 → 2.80.1

package/src/core/geom/LineSegment.js

@@ -1,207 +0,0 @@
-/**
- * Created by Alex on 18/03/14.
- */
-import Vector3 from "./Vector3.js";
-import { clamp01 } from "../math/clamp01.js";
-
-
-const SMALL_NUM = 1e-9;
-/**
- * @param {Vector3} first
- * @param {Vector3} second
- * @constructor
- */
-const LineSegment = function (first, second) {
-    this.p0 = first || null;
-    this.p1 = second || null;
-
-};
-
-LineSegment.prototype.closestPointToPointParameter = function (point, clampToLine) {
-
-
-    const startP = point.clone().sub(this.p0);
-    const startEnd = this.p1.clone().sub(this.p0);
-
-    const startEnd2 = startEnd.dot(startEnd);
-    const startEnd_startP = startEnd.dot(startP);
-
-    let t = startEnd_startP / startEnd2;
-
-    if (clampToLine) {
-
-        t = clamp01(t);
-
-    }
-
-    return t;
-
-};
-
-LineSegment.prototype.closestPointToPoint = function (point) {
-
-    const t = this.closestPointToPointParameter(point, true);
-
-    const result = this.p1.clone().sub(this.p0);
-    return result.scale(t).add(this.p0);
-
-};
-/**
- * @param {Vector3} p
- * @returns {number}
- */
-LineSegment.prototype.distanceToPoint = function (p) {
-    const closestPointToPoint = this.closestPointToPoint(p);
-    return closestPointToPoint.sub(p).length();
-};
-/**
- * @param {LineSegment} other
- * @returns {number}
- */
-LineSegment.prototype.distanceToSegment = function (other) {
-    const u = this.p1.clone().sub(this.p0);
-    const v = other.p1.clone().sub(other.p0);
-    const w = this.p0.clone().sub(other.p0);
-    const a = u.dot(u);         // always >= 0
-    const b = u.dot(v);
-    const c = v.dot(v);         // always >= 0
-    let d = u.dot(w);
-    const e = v.dot(w);
-    const D = a * c - b * b;        // always >= 0
-    let sc, sN, sD = D;       // sc = sN / sD, default sD = D >= 0
-    let tc, tN, tD = D;       // tc = tN / tD, default tD = D >= 0
-
-    // compute the line parameters of the two closest points
-    if (D < SMALL_NUM) { // the lines are almost parallel
-        sN = 0.0;         // force using point P0 on segment S1
-        sD = 1.0;         // to prevent possible division by 0.0 later
-        tN = e;
-        tD = c;
-    } else {                 // get the closest points on the infinite lines
-        sN = (b * e - c * d);
-        tN = (a * e - b * d);
-        if (sN < 0.0) {        // sc < 0 => the s=0 edge is visible
-            sN = 0.0;
-            tN = e;
-            tD = c;
-        } else if (sN > sD) {  // sc > 1  => the s=1 edge is visible
-            sN = sD;
-            tN = e + b;
-            tD = c;
-        }
-    }
-
-    if (tN < 0.0) {            // tc < 0 => the t=0 edge is visible
-        tN = 0.0;
-        // recompute sc for this edge
-        if (-d < 0.0)
-            sN = 0.0;
-        else if (-d > a)
-            sN = sD;
-        else {
-            sN = -d;
-            sD = a;
-        }
-    } else if (tN > tD) {      // tc > 1  => the t=1 edge is visible
-        tN = tD;
-        // recompute sc for this edge
-        if ((-d + b) < 0.0)
-            sN = 0;
-        else if ((-d + b) > a)
-            sN = sD;
-        else {
-            sN = (-d + b);
-            sD = a;
-        }
-    }
-    // finally do the division to get sc and tc
-    sc = (Math.abs(sN) < SMALL_NUM ? 0.0 : sN / sD);
-    tc = (Math.abs(tN) < SMALL_NUM ? 0.0 : tN / tD);
-
-    // get the difference of the two closest points
-    const dP = w.clone().add(
-        u.clone().scale(sc).sub(
-            v.clone().scale(tc)
-        )
-    );  // =  S1(sc) - S2(tc)
-
-    return dP.length();   // return the closest distance
-};
-LineSegment.prototype.clone = function () {
-    return new LineSegment(this.p0, this.p1);
-};
-LineSegment.prototype.midPoint = function () {
-    return this.p1.lerp(this.p0, 0.5);
-};
-LineSegment.prototype.shrinkByScalar = function (scalar) {
-    const length = this.length();
-    const newScale = (length - scalar) / length;
-    const halfScaleDelta = (1 - newScale) / 2;
-    //find mid point
-    let midPoint = this.midPoint();
-    //pull edges towards the midpoint
-    const newP0 = this.p0.clone().lerp(this.p1, halfScaleDelta);
-    const newP1 = this.p1.clone().lerp(this.p0, halfScaleDelta);
-    this.p0 = newP0;
-    this.p1 = newP1;
-    //new length should now be equal to oldLength - scalar;
-    return this;
-};
-LineSegment.prototype.length = function () {
-    return this.p0.distanceTo(this.p1);
-};
-LineSegment.prototype.translate = function (vector) {
-    this.p0.add(vector);
-    this.p1.add(vector);
-};
-
-
-/**
- *
- * @param {Vector3} a0
- * @param {Vector3} a1
- * @param {Vector3} b0
- * @param {Vector3} b1
- * @param {Vector3} result
- * @returns {boolean}
- */
-LineSegment.intersectionPoint = (function () {
-    const cross_da_db = new Vector3();
-    const cross_dc_db = new Vector3();
-    const dc = new Vector3();
-    const da = new Vector3();
-    const db = new Vector3();
-
-    /**
-     *
-     * @param {Vector3} a0
-     * @param {Vector3} a1
-     * @param {Vector3} b0
-     * @param {Vector3} b1
-     * @param {Vector3} result
-     * @returns {boolean}
-     */
-    function intersectionPoint(a0, a1, b0, b1, result) {
-        da.copy(a1).sub(a0);
-        db.copy(b1).sub(b0);
-        dc.copy(b0).sub(a0);
-
-        cross_da_db.copy(da).cross(db);
-        if (dc.dot(cross_da_db) !== 0.0) {
-            // lines are not coplanar
-            return false;
-        }
-
-        cross_dc_db.copy(dc).cross(db);
-        const s = cross_dc_db.dot(cross_da_db) / cross_da_db.lengthSqr();
-        result.copy(da).multiplyScalar(s).add(a0);
-        if (s >= 0.0 && s <= 1.0) {
-            return true;
-        }
-
-        return false;
-    }
-
-    return intersectionPoint;
-})();
-export default LineSegment;