@mlightcad/geometry-engine 3.2.38 → 3.2.39

package/lib/util/AcGeSampledCurveOffsetUtil.js

@@ -0,0 +1,302 @@
+var __read = (this && this.__read) || function (o, n) {
+    var m = typeof Symbol === "function" && o[Symbol.iterator];
+    if (!m) return o;
+    var i = m.call(o), r, ar = [], e;
+    try {
+        while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);
+    }
+    catch (error) { e = { error: error }; }
+    finally {
+        try {
+            if (r && !r.done && (m = i["return"])) m.call(i);
+        }
+        finally { if (e) throw e.error; }
+    }
+    return ar;
+};
+var __spreadArray = (this && this.__spreadArray) || function (to, from, pack) {
+    if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {
+        if (ar || !(i in from)) {
+            if (!ar) ar = Array.prototype.slice.call(from, 0, i);
+            ar[i] = from[i];
+        }
+    }
+    return to.concat(ar || Array.prototype.slice.call(from));
+};
+import { AcGePolyline2d } from '../geometry/AcGePolyline2d';
+import { AcGePoint2d } from '../math/AcGePoint2d';
+import { AcGeTol, DEFAULT_TOL } from './AcGeTol';
+/**
+ * Offsets a densely sampled smooth curve path in the XY plane.
+ *
+ * Unlike vertex polyline offset (parallel edges with miter joins), each sample
+ * is shifted along the local left normal. Self-intersecting loops that appear
+ * when the offset distance exceeds the local radius of curvature are trimmed.
+ *
+ * Sign convention: positive `offsetDist` offsets to the left of the travel
+ * direction along the sampled path (consistent with {@link offsetAcGePolyline2d}).
+ *
+ * @param points - Sampled path points in travel order
+ * @param closed - Whether the path is treated as a closed polygon for trimming
+ * @param offsetDist - Signed offset distance in drawing units (left = positive)
+ * @param tangents - Optional unit tangents aligned with `points`; when omitted,
+ * tangents are estimated from neighboring samples via central differences
+ * @returns Offset polyline, or `null` when input is degenerate or offset distance is zero
+ */
+export function offsetSmoothedSampledPath(points, closed, offsetDist, tangents) {
+    if (points.length < 2 || AcGeTol.equalToZero(offsetDist))
+        return null;
+    var _a = dedupeConsecutiveSamples(points, tangents), source = _a.points, sourceTangents = _a.tangents;
+    if (source.length < 2)
+        return null;
+    var resolvedTangents = sourceTangents !== null && sourceTangents !== void 0 ? sourceTangents : computePathSampleTangents(source, closed);
+    var offsetPoints = offsetPointsByNormals(source, resolvedTangents, offsetDist);
+    var trimmed = closed
+        ? trimClosedPolylineSelfIntersections(offsetPoints)
+        : trimOpenPolylineSelfIntersections(offsetPoints);
+    if (trimmed.length < 2)
+        return null;
+    var result = new AcGePolyline2d();
+    trimmed.forEach(function (point, index) {
+        result.addVertexAt(index, { x: point.x, y: point.y });
+    });
+    result.closed = closed;
+    return result;
+}
+/**
+ * Computes unit tangents for a sampled path using central differences.
+ *
+ * Open paths use one-sided differences at endpoints and central differences
+ * at interior samples. Closed paths wrap the predecessor of the first point
+ * and the successor of the last.
+ *
+ * @param points - Sampled path vertices in travel order
+ * @param closed - Whether the path wraps from last point back to first
+ * @returns Unit tangent at each sample; degenerate segments fall back to `(1, 0)`
+ */
+function computePathSampleTangents(points, closed) {
+    var count = points.length;
+    var tangents = new Array(count);
+    for (var i = 0; i < count; i++) {
+        var dx = 0;
+        var dy = 0;
+        if (closed) {
+            var prev = points[(i - 1 + count) % count];
+            var next = points[(i + 1) % count];
+            dx = next.x - prev.x;
+            dy = next.y - prev.y;
+        }
+        else if (i === 0) {
+            dx = points[1].x - points[0].x;
+            dy = points[1].y - points[0].y;
+        }
+        else if (i === count - 1) {
+            dx = points[count - 1].x - points[count - 2].x;
+            dy = points[count - 1].y - points[count - 2].y;
+        }
+        else {
+            dx = points[i + 1].x - points[i - 1].x;
+            dy = points[i + 1].y - points[i - 1].y;
+        }
+        var len = Math.hypot(dx, dy);
+        if (AcGeTol.isNonPositive(len)) {
+            tangents[i] = new AcGePoint2d(1, 0);
+        }
+        else {
+            tangents[i] = new AcGePoint2d(dx / len, dy / len);
+        }
+    }
+    return tangents;
+}
+/**
+ * Offsets each sample along the left normal of its tangent.
+ *
+ * The left normal of a unit tangent `(tx, ty)` is `(-ty, tx)`, scaled by
+ * `offsetDist` and added to the sample position.
+ *
+ * @param points - Source samples in travel order
+ * @param tangents - Unit tangents aligned index-for-index with `points`
+ * @param offsetDist - Signed offset distance in drawing units
+ * @returns Translated samples forming the raw offset polyline before trimming
+ */
+function offsetPointsByNormals(points, tangents, offsetDist) {
+    return points.map(function (point, index) {
+        var tangent = tangents[index];
+        var nx = -tangent.y * offsetDist;
+        var ny = tangent.x * offsetDist;
+        return new AcGePoint2d(point.x + nx, point.y + ny);
+    });
+}
+/**
+ * Removes self-intersecting loops from an open offset polyline.
+ *
+ * Repeatedly finds the earliest non-adjacent segment crossing and replaces the
+ * enclosed vertex chain with the intersection point until no crossings remain.
+ * This produces cusp-style joins when the offset distance exceeds the local
+ * radius of curvature at concave bends.
+ *
+ * @param points - Raw offset samples connected in order
+ * @returns Trimmed open vertex chain with loops removed
+ */
+function trimOpenPolylineSelfIntersections(points) {
+    var current = dedupeConsecutivePoints(points);
+    if (current.length < 3)
+        return current;
+    while (true) {
+        var hit = findFirstSelfIntersection(current, false);
+        if (!hit)
+            break;
+        current = dedupeConsecutivePoints(__spreadArray(__spreadArray(__spreadArray([], __read(current.slice(0, hit.segmentA + 1)), false), [
+            hit.point
+        ], false), __read(current.slice(hit.segmentB + 1)), false));
+        if (current.length < 2)
+            break;
+    }
+    return current;
+}
+/**
+ * Removes self-intersecting loops from a closed offset polyline.
+ *
+ * Uses the same earliest-intersection trimming strategy as
+ * {@link trimOpenPolylineSelfIntersections}, but treats the last-to-first
+ * segment as part of the closed ring.
+ *
+ * @param points - Raw offset samples forming a closed ring
+ * @returns Trimmed closed vertex chain with loops removed
+ */
+function trimClosedPolylineSelfIntersections(points) {
+    var current = dedupeConsecutivePoints(points);
+    if (current.length < 4)
+        return current;
+    while (true) {
+        var hit = findFirstSelfIntersection(current, true);
+        if (!hit)
+            break;
+        current = dedupeConsecutivePoints(__spreadArray(__spreadArray(__spreadArray([], __read(current.slice(0, hit.segmentA + 1)), false), [
+            hit.point
+        ], false), __read(current.slice(hit.segmentB + 1)), false));
+        if (current.length < 3)
+            break;
+    }
+    return current;
+}
+/**
+ * Finds the earliest non-adjacent segment intersection in a polyline.
+ *
+ * Segments are tested in lexicographic order `(segmentA, segmentB)` so trimming
+ * removes the innermost loop encountered first along the path.
+ *
+ * @param points - Polyline vertices in order
+ * @param closed - Whether the polyline wraps from last vertex back to first
+ * @returns Intersection data, or `null` when no crossing exists
+ */
+function findFirstSelfIntersection(points, closed) {
+    var segmentCount = closed ? points.length : points.length - 1;
+    if (segmentCount < 2)
+        return null;
+    for (var i = 0; i < segmentCount; i++) {
+        var a0 = points[i];
+        var a1 = points[(i + 1) % points.length];
+        for (var j = i + 1; j < segmentCount; j++) {
+            if (areAdjacentSegments(i, j, segmentCount, closed))
+                continue;
+            var b0 = points[j];
+            var b1 = points[(j + 1) % points.length];
+            var point = intersectBoundedSegments(a0, a1, b0, b1);
+            if (point) {
+                return { point: point, segmentA: i, segmentB: j };
+            }
+        }
+    }
+    return null;
+}
+/**
+ * Tests whether two segment indices share a vertex and should be skipped
+ * during self-intersection search.
+ *
+ * @param i - Index of the first segment
+ * @param j - Index of the second segment
+ * @param segmentCount - Total number of segments in the polyline
+ * @param closed - Whether the polyline is closed
+ * @returns `true` when the segments are identical or share an endpoint
+ */
+function areAdjacentSegments(i, j, segmentCount, closed) {
+    if (j === i)
+        return true;
+    if (j === i + 1)
+        return true;
+    if (closed && i === 0 && j === segmentCount - 1)
+        return true;
+    return false;
+}
+/**
+ * Computes the intersection point of two bounded line segments, if any.
+ *
+ * Uses parametric line intersection and requires both parameters to lie in
+ * `[0, 1]` within {@link DEFAULT_TOL}. Parallel or collinear segments return
+ * `null`.
+ *
+ * @param a0 - Start of the first segment
+ * @param a1 - End of the first segment
+ * @param b0 - Start of the second segment
+ * @param b1 - End of the second segment
+ * @returns Intersection point, or `null` when segments do not cross
+ */
+function intersectBoundedSegments(a0, a1, b0, b1) {
+    var dx1 = a1.x - a0.x;
+    var dy1 = a1.y - a0.y;
+    var dx2 = b1.x - b0.x;
+    var dy2 = b1.y - b0.y;
+    var det = dx1 * dy2 - dy1 * dx2;
+    if (AcGeTol.equalToZero(det))
+        return null;
+    var qpx = b0.x - a0.x;
+    var qpy = b0.y - a0.y;
+    var t = (qpx * dy2 - qpy * dx2) / det;
+    var u = (qpx * dy1 - qpy * dx1) / det;
+    var tol = DEFAULT_TOL.equalPointTol;
+    if (t < -tol || t > 1 + tol || u < -tol || u > 1 + tol) {
+        return null;
+    }
+    return new AcGePoint2d(a0.x + t * dx1, a0.y + t * dy1);
+}
+/**
+ * Removes consecutive duplicate samples while keeping tangents aligned.
+ *
+ * When `tangents` is provided with the same length as `points`, tangents
+ * corresponding to dropped duplicates are removed as well.
+ *
+ * @param points - Input sample chain, possibly containing consecutive duplicates
+ * @param tangents - Optional unit tangents aligned with `points`
+ * @returns Deduplicated points and, when supplied, matching tangents
+ */
+function dedupeConsecutiveSamples(points, tangents) {
+    var resultPoints = [];
+    var resultTangents = [];
+    var keepTangents = tangents != null && tangents.length === points.length;
+    points.forEach(function (point, index) {
+        var last = resultPoints[resultPoints.length - 1];
+        if (!last ||
+            AcGeTol.isPositive(Math.hypot(last.x - point.x, last.y - point.y))) {
+            resultPoints.push(new AcGePoint2d(point.x, point.y));
+            if (keepTangents) {
+                var tangent = tangents[index];
+                resultTangents.push(new AcGePoint2d(tangent.x, tangent.y));
+            }
+        }
+    });
+    return {
+        points: resultPoints,
+        tangents: keepTangents ? resultTangents : undefined
+    };
+}
+/**
+ * Removes consecutive duplicate vertices from a point chain.
+ *
+ * @param points - Input vertex chain
+ * @returns New array with only distinct consecutive points
+ */
+function dedupeConsecutivePoints(points) {
+    return dedupeConsecutiveSamples(points).points;
+}
+//# sourceMappingURL=AcGeSampledCurveOffsetUtil.js.map

package/lib/util/AcGeSampledCurveOffsetUtil.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"AcGeSampledCurveOffsetUtil.js","sourceRoot":"","sources":["../../src/util/AcGeSampledCurveOffsetUtil.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;AAAA,OAAO,EAAE,cAAc,EAAE,MAAM,4BAA4B,CAAA;AAC3D,OAAO,EAAE,WAAW,EAAE,MAAM,qBAAqB,CAAA;AACjD,OAAO,EAAE,OAAO,EAAE,WAAW,EAAE,MAAM,WAAW,CAAA;AAYhD;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,UAAU,yBAAyB,CACvC,MAAqB,EACrB,MAAe,EACf,UAAkB,EAClB,QAAwB;IAExB,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,IAAI,OAAO,CAAC,WAAW,CAAC,UAAU,CAAC;QAAE,OAAO,IAAI,CAAA;IAE/D,IAAA,KAA+C,wBAAwB,CAC3E,MAAM,EACN,QAAQ,CACT,EAHe,MAAM,YAAA,EAAY,cAAc,cAG/C,CAAA;IACD,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,IAAI,CAAA;IAElC,IAAM,gBAAgB,GACpB,cAAc,aAAd,cAAc,cAAd,cAAc,GAAI,yBAAyB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;IAC7D,IAAM,YAAY,GAAG,qBAAqB,CACxC,MAAM,EACN,gBAAgB,EAChB,UAAU,CACX,CAAA;IACD,IAAM,OAAO,GAAG,MAAM;QACpB,CAAC,CAAC,mCAAmC,CAAC,YAAY,CAAC;QACnD,CAAC,CAAC,iCAAiC,CAAC,YAAY,CAAC,CAAA;IAEnD,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,IAAI,CAAA;IAEnC,IAAM,MAAM,GAAG,IAAI,cAAc,EAAE,CAAA;IACnC,OAAO,CAAC,OAAO,CAAC,UAAC,KAAK,EAAE,KAAK;QAC3B,MAAM,CAAC,WAAW,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,CAAA;IACvD,CAAC,CAAC,CAAA;IACF,MAAM,CAAC,MAAM,GAAG,MAAM,CAAA;IACtB,OAAO,MAAM,CAAA;AACf,CAAC;AAED;;;;;;;;;;GAUG;AACH,SAAS,yBAAyB,CAChC,MAAqB,EACrB,MAAe;IAEf,IAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAA;IAC3B,IAAM,QAAQ,GAAkB,IAAI,KAAK,CAAC,KAAK,CAAC,CAAA;IAEhD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,IAAI,EAAE,GAAG,CAAC,CAAA;QACV,IAAI,EAAE,GAAG,CAAC,CAAA;QAEV,IAAI,MAAM,EAAE,CAAC;YACX,IAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC,CAAA;YAC5C,IAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAA;YACpC,EAAE,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAA;YACpB,EAAE,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAA;QACtB,CAAC;aAAM,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACnB,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;YAC9B,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QAChC,CAAC;aAAM,IAAI,CAAC,KAAK,KAAK,GAAG,CAAC,EAAE,CAAC;YAC3B,EAAE,GAAG,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;YAC9C,EAAE,GAAG,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;QAChD,CAAC;aAAM,CAAC;YACN,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;YACtC,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;QACxC,CAAC;QAED,IAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,EAAE,EAAE,CAAC,CAAA;QAC9B,IAAI,OAAO,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC;YAC/B,QAAQ,CAAC,CAAC,CAAC,GAAG,IAAI,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;QACrC,CAAC;aAAM,CAAC;YACN,QAAQ,CAAC,CAAC,CAAC,GAAG,IAAI,WAAW,CAAC,EAAE,GAAG,GAAG,EAAE,EAAE,GAAG,GAAG,CAAC,CAAA;QACnD,CAAC;IACH,CAAC;IAED,OAAO,QAAQ,CAAA;AACjB,CAAC;AAED;;;;;;;;;;GAUG;AACH,SAAS,qBAAqB,CAC5B,MAAqB,EACrB,QAAuB,EACvB,UAAkB;IAElB,OAAO,MAAM,CAAC,GAAG,CAAC,UAAC,KAAK,EAAE,KAAK;QAC7B,IAAM,OAAO,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAA;QAC/B,IAAM,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC,GAAG,UAAU,CAAA;QAClC,IAAM,EAAE,GAAG,OAAO,CAAC,CAAC,GAAG,UAAU,CAAA;QACjC,OAAO,IAAI,WAAW,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,EAAE,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,CAAA;IACpD,CAAC,CAAC,CAAA;AACJ,CAAC;AAED;;;;;;;;;;GAUG;AACH,SAAS,iCAAiC,CACxC,MAAqB;IAErB,IAAI,OAAO,GAAG,uBAAuB,CAAC,MAAM,CAAC,CAAA;IAC7C,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,OAAO,CAAA;IAEtC,OAAO,IAAI,EAAE,CAAC;QACZ,IAAM,GAAG,GAAG,yBAAyB,CAAC,OAAO,EAAE,KAAK,CAAC,CAAA;QACrD,IAAI,CAAC,GAAG;YAAE,MAAK;QACf,OAAO,GAAG,uBAAuB,sDAC5B,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,QAAQ,GAAG,CAAC,CAAC;YACrC,GAAG,CAAC,KAAK;0BACN,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,GAAG,CAAC,CAAC,UAClC,CAAA;QACF,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;YAAE,MAAK;IAC/B,CAAC;IAED,OAAO,OAAO,CAAA;AAChB,CAAC;AAED;;;;;;;;;GASG;AACH,SAAS,mCAAmC,CAC1C,MAAqB;IAErB,IAAI,OAAO,GAAG,uBAAuB,CAAC,MAAM,CAAC,CAAA;IAC7C,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,OAAO,CAAA;IAEtC,OAAO,IAAI,EAAE,CAAC;QACZ,IAAM,GAAG,GAAG,yBAAyB,CAAC,OAAO,EAAE,IAAI,CAAC,CAAA;QACpD,IAAI,CAAC,GAAG;YAAE,MAAK;QACf,OAAO,GAAG,uBAAuB,sDAC5B,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,QAAQ,GAAG,CAAC,CAAC;YACrC,GAAG,CAAC,KAAK;0BACN,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,GAAG,CAAC,CAAC,UAClC,CAAA;QACF,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;YAAE,MAAK;IAC/B,CAAC;IAED,OAAO,OAAO,CAAA;AAChB,CAAC;AAED;;;;;;;;;GASG;AACH,SAAS,yBAAyB,CAChC,MAAqB,EACrB,MAAe;IAEf,IAAM,YAAY,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAA;IAC/D,IAAI,YAAY,GAAG,CAAC;QAAE,OAAO,IAAI,CAAA;IAEjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,IAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,CAAA;QACpB,IAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAA;QAE1C,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,IAAI,mBAAmB,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,EAAE,MAAM,CAAC;gBAAE,SAAQ;YAE7D,IAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,CAAA;YACpB,IAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAA;YAC1C,IAAM,KAAK,GAAG,wBAAwB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAA;YACtD,IAAI,KAAK,EAAE,CAAC;gBACV,OAAO,EAAE,KAAK,OAAA,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAA;YAC5C,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAA;AACb,CAAC;AAED;;;;;;;;;GASG;AACH,SAAS,mBAAmB,CAC1B,CAAS,EACT,CAAS,EACT,YAAoB,EACpB,MAAe;IAEf,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,IAAI,CAAA;IACxB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC;QAAE,OAAO,IAAI,CAAA;IAC5B,IAAI,MAAM,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,YAAY,GAAG,CAAC;QAAE,OAAO,IAAI,CAAA;IAC5D,OAAO,KAAK,CAAA;AACd,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,SAAS,wBAAwB,CAC/B,EAAe,EACf,EAAe,EACf,EAAe,EACf,EAAe;IAEf,IAAM,GAAG,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;IACvB,IAAM,GAAG,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;IACvB,IAAM,GAAG,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;IACvB,IAAM,GAAG,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;IACvB,IAAM,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAA;IACjC,IAAI,OAAO,CAAC,WAAW,CAAC,GAAG,CAAC;QAAE,OAAO,IAAI,CAAA;IAEzC,IAAM,GAAG,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;IACvB,IAAM,GAAG,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;IACvB,IAAM,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG,CAAA;IACvC,IAAM,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG,CAAA;IAEvC,IAAM,GAAG,GAAG,WAAW,CAAC,aAAa,CAAA;IACrC,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,EAAE,CAAC;QACvD,OAAO,IAAI,CAAA;IACb,CAAC;IAED,OAAO,IAAI,WAAW,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAA;AACxD,CAAC;AAED;;;;;;;;;GASG;AACH,SAAS,wBAAwB,CAC/B,MAAqB,EACrB,QAAwB;IAExB,IAAM,YAAY,GAAkB,EAAE,CAAA;IACtC,IAAM,cAAc,GAAkB,EAAE,CAAA;IACxC,IAAM,YAAY,GAAG,QAAQ,IAAI,IAAI,IAAI,QAAQ,CAAC,MAAM,KAAK,MAAM,CAAC,MAAM,CAAA;IAE1E,MAAM,CAAC,OAAO,CAAC,UAAC,KAAK,EAAE,KAAK;QAC1B,IAAM,IAAI,GAAG,YAAY,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;QAClD,IACE,CAAC,IAAI;YACL,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,EAClE,CAAC;YACD,YAAY,CAAC,IAAI,CAAC,IAAI,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;YACpD,IAAI,YAAY,EAAE,CAAC;gBACjB,IAAM,OAAO,GAAG,QAAS,CAAC,KAAK,CAAC,CAAA;gBAChC,cAAc,CAAC,IAAI,CAAC,IAAI,WAAW,CAAC,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAA;YAC5D,CAAC;QACH,CAAC;IACH,CAAC,CAAC,CAAA;IAEF,OAAO;QACL,MAAM,EAAE,YAAY;QACpB,QAAQ,EAAE,YAAY,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,SAAS;KACpD,CAAA;AACH,CAAC;AAED;;;;;GAKG;AACH,SAAS,uBAAuB,CAAC,MAAqB;IACpD,OAAO,wBAAwB,CAAC,MAAM,CAAC,CAAC,MAAM,CAAA;AAChD,CAAC"}

package/lib/util/AcGeTol.d.ts

@@ -90,6 +90,14 @@ export declare class AcGeTol {
      * tolerance value
      */
     static less(value1: number, value2: number, tol?: number): boolean;
+    /**
+     * Return true if the value is greater than the specified tolerance.
+     */
+    static isPositive(value: number, tol?: number): boolean;
+    /**
+     * Return true if the value is less than or equal to the specified tolerance.
+     */
+    static isNonPositive(value: number, tol?: number): boolean;
 }
 export declare const DEFAULT_TOL: AcGeTol;
 //# sourceMappingURL=AcGeTol.d.ts.map

package/lib/util/AcGeTol.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"AcGeTol.d.ts","sourceRoot":"","sources":["../../src/util/AcGeTol.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,eAAe,EACf,eAAe,EAGhB,MAAM,SAAS,CAAA;AAGhB;;GAEG;AACH,qBAAa,OAAO;IAClB;;;;;OAKG;IACH,aAAa,EAAE,MAAM,CAAA;IACrB;;;;;;;;;;;;;;;;;;;;;OAqBG;IACH,cAAc,EAAE,MAAM,CAAA;IAEtB;;OAEG;;IAMH;;OAEG;IACH,KAAK;IAOL;;;;;OAKG;IACH,YAAY,CAAC,EAAE,EAAE,eAAe,EAAE,EAAE,EAAE,eAAe;IAIrD;;;;;OAKG;IACH,YAAY,CAAC,EAAE,EAAE,eAAe,EAAE,EAAE,EAAE,eAAe;IAIrD;;OAEG;IACH,MAAM,CAAC,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,GAAE,MAAkB;IAIrD;;;;;;;OAOG;IACH,MAAM,CAAC,KAAK,CACV,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,GAAG,GAAE,MAAkB,GACtB,OAAO;IAIV;;;;;;;;;OASG;IACH,MAAM,CAAC,KAAK,CACV,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,GAAG,GAAE,MAAkB,GACtB,OAAO;IAIV;;;;;;;;;OASG;IACH,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,GAAE,MAAkB;CAGpE;AAED,eAAO,MAAM,WAAW,SAAgB,CAAA"}
+{"version":3,"file":"AcGeTol.d.ts","sourceRoot":"","sources":["../../src/util/AcGeTol.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,eAAe,EACf,eAAe,EAGhB,MAAM,SAAS,CAAA;AAGhB;;GAEG;AACH,qBAAa,OAAO;IAClB;;;;;OAKG;IACH,aAAa,EAAE,MAAM,CAAA;IACrB;;;;;;;;;;;;;;;;;;;;;OAqBG;IACH,cAAc,EAAE,MAAM,CAAA;IAEtB;;OAEG;;IAMH;;OAEG;IACH,KAAK;IAOL;;;;;OAKG;IACH,YAAY,CAAC,EAAE,EAAE,eAAe,EAAE,EAAE,EAAE,eAAe;IAIrD;;;;;OAKG;IACH,YAAY,CAAC,EAAE,EAAE,eAAe,EAAE,EAAE,EAAE,eAAe;IAIrD;;OAEG;IACH,MAAM,CAAC,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,GAAE,MAAkB;IAIrD;;;;;;;OAOG;IACH,MAAM,CAAC,KAAK,CACV,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,GAAG,GAAE,MAAkB,GACtB,OAAO;IAIV;;;;;;;;;OASG;IACH,MAAM,CAAC,KAAK,CACV,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,GAAG,GAAE,MAAkB,GACtB,OAAO;IAIV;;;;;;;;;OASG;IACH,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,GAAE,MAAkB;IAInE;;OAEG;IACH,MAAM,CAAC,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,GAAE,MAAkB,GAAG,OAAO;IAIlE;;OAEG;IACH,MAAM,CAAC,aAAa,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,GAAE,MAAkB,GAAG,OAAO;CAGtE;AAED,eAAO,MAAM,WAAW,SAAgB,CAAA"}

package/lib/util/AcGeTol.js

@@ -85,6 +85,20 @@ var AcGeTol = /** @class */ (function () {
         if (tol === void 0) { tol = FLOAT_TOL; }
         return value1 - value2 < tol;
     };
+    /**
+     * Return true if the value is greater than the specified tolerance.
+     */
+    AcGeTol.isPositive = function (value, tol) {
+        if (tol === void 0) { tol = FLOAT_TOL; }
+        return value > tol;
+    };
+    /**
+     * Return true if the value is less than or equal to the specified tolerance.
+     */
+    AcGeTol.isNonPositive = function (value, tol) {
+        if (tol === void 0) { tol = FLOAT_TOL; }
+        return value <= tol;
+    };
     return AcGeTol;
 }());
 export { AcGeTol };

package/lib/util/AcGeTol.js.map

@@ -1 +1 @@
-{"version":3,"file":"AcGeTol.js","sourceRoot":"","sources":["../../src/util/AcGeTol.ts"],"names":[],"mappings":"AAAA,OAAO,EAGL,YAAY,EACZ,YAAY,EACb,MAAM,SAAS,CAAA;AAChB,OAAO,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAA;AAE3C;;GAEG;AACH;IAgCE;;OAEG;IACH;QACE,IAAI,CAAC,aAAa,GAAG,SAAS,CAAA;QAC9B,IAAI,CAAC,cAAc,GAAG,SAAS,CAAA;IACjC,CAAC;IAED;;OAEG;IACH,uBAAK,GAAL;QACE,IAAM,MAAM,GAAG,IAAI,OAAO,EAAE,CAAA;QAC5B,MAAM,CAAC,aAAa,GAAG,IAAI,CAAC,aAAa,CAAA;QACzC,MAAM,CAAC,cAAc,GAAG,IAAI,CAAC,cAAc,CAAA;QAC3C,OAAO,MAAM,CAAA;IACf,CAAC;IAED;;;;;OAKG;IACH,8BAAY,GAAZ,UAAa,EAAmB,EAAE,EAAmB;QACnD,OAAO,IAAI,YAAY,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,MAAM,EAAE,GAAG,IAAI,CAAC,aAAa,CAAA;IACnE,CAAC;IAED;;;;;OAKG;IACH,8BAAY,GAAZ,UAAa,EAAmB,EAAE,EAAmB;QACnD,OAAO,IAAI,YAAY,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,MAAM,EAAE,GAAG,IAAI,CAAC,aAAa,CAAA;IACnE,CAAC;IAED;;OAEG;IACI,mBAAW,GAAlB,UAAmB,CAAS,EAAE,GAAuB;QAAvB,oBAAA,EAAA,eAAuB;QACnD,OAAO,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAA;IAC5B,CAAC;IAED;;;;;;;OAOG;IACI,aAAK,GAAZ,UACE,MAAc,EACd,MAAc,EACd,GAAuB;QAAvB,oBAAA,EAAA,eAAuB;QAEvB,OAAO,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,MAAM,CAAC,GAAG,GAAG,CAAA;IACxC,CAAC;IAED;;;;;;;;;OASG;IACI,aAAK,GAAZ,UACE,MAAc,EACd,MAAc,EACd,GAAuB;QAAvB,oBAAA,EAAA,eAAuB;QAEvB,OAAO,MAAM,GAAG,MAAM,GAAG,GAAG,CAAA;IAC9B,CAAC;IAED;;;;;;;;;OASG;IACI,YAAI,GAAX,UAAY,MAAc,EAAE,MAAc,EAAE,GAAuB;QAAvB,oBAAA,EAAA,eAAuB;QACjE,OAAO,MAAM,GAAG,MAAM,GAAG,GAAG,CAAA;IAC9B,CAAC;IACH,cAAC;AAAD,CAAC,AA5HD,IA4HC;;AAED,MAAM,CAAC,IAAM,WAAW,GAAG,IAAI,OAAO,EAAE,CAAA"}
+{"version":3,"file":"AcGeTol.js","sourceRoot":"","sources":["../../src/util/AcGeTol.ts"],"names":[],"mappings":"AAAA,OAAO,EAGL,YAAY,EACZ,YAAY,EACb,MAAM,SAAS,CAAA;AAChB,OAAO,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAA;AAE3C;;GAEG;AACH;IAgCE;;OAEG;IACH;QACE,IAAI,CAAC,aAAa,GAAG,SAAS,CAAA;QAC9B,IAAI,CAAC,cAAc,GAAG,SAAS,CAAA;IACjC,CAAC;IAED;;OAEG;IACH,uBAAK,GAAL;QACE,IAAM,MAAM,GAAG,IAAI,OAAO,EAAE,CAAA;QAC5B,MAAM,CAAC,aAAa,GAAG,IAAI,CAAC,aAAa,CAAA;QACzC,MAAM,CAAC,cAAc,GAAG,IAAI,CAAC,cAAc,CAAA;QAC3C,OAAO,MAAM,CAAA;IACf,CAAC;IAED;;;;;OAKG;IACH,8BAAY,GAAZ,UAAa,EAAmB,EAAE,EAAmB;QACnD,OAAO,IAAI,YAAY,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,MAAM,EAAE,GAAG,IAAI,CAAC,aAAa,CAAA;IACnE,CAAC;IAED;;;;;OAKG;IACH,8BAAY,GAAZ,UAAa,EAAmB,EAAE,EAAmB;QACnD,OAAO,IAAI,YAAY,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,MAAM,EAAE,GAAG,IAAI,CAAC,aAAa,CAAA;IACnE,CAAC;IAED;;OAEG;IACI,mBAAW,GAAlB,UAAmB,CAAS,EAAE,GAAuB;QAAvB,oBAAA,EAAA,eAAuB;QACnD,OAAO,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAA;IAC5B,CAAC;IAED;;;;;;;OAOG;IACI,aAAK,GAAZ,UACE,MAAc,EACd,MAAc,EACd,GAAuB;QAAvB,oBAAA,EAAA,eAAuB;QAEvB,OAAO,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,MAAM,CAAC,GAAG,GAAG,CAAA;IACxC,CAAC;IAED;;;;;;;;;OASG;IACI,aAAK,GAAZ,UACE,MAAc,EACd,MAAc,EACd,GAAuB;QAAvB,oBAAA,EAAA,eAAuB;QAEvB,OAAO,MAAM,GAAG,MAAM,GAAG,GAAG,CAAA;IAC9B,CAAC;IAED;;;;;;;;;OASG;IACI,YAAI,GAAX,UAAY,MAAc,EAAE,MAAc,EAAE,GAAuB;QAAvB,oBAAA,EAAA,eAAuB;QACjE,OAAO,MAAM,GAAG,MAAM,GAAG,GAAG,CAAA;IAC9B,CAAC;IAED;;OAEG;IACI,kBAAU,GAAjB,UAAkB,KAAa,EAAE,GAAuB;QAAvB,oBAAA,EAAA,eAAuB;QACtD,OAAO,KAAK,GAAG,GAAG,CAAA;IACpB,CAAC;IAED;;OAEG;IACI,qBAAa,GAApB,UAAqB,KAAa,EAAE,GAAuB;QAAvB,oBAAA,EAAA,eAAuB;QACzD,OAAO,KAAK,IAAI,GAAG,CAAA;IACrB,CAAC;IACH,cAAC;AAAD,CAAC,AA1ID,IA0IC;;AAED,MAAM,CAAC,IAAM,WAAW,GAAG,IAAI,OAAO,EAAE,CAAA"}

package/lib/util/index.d.ts

@@ -1,7 +1,9 @@
 export { FLOAT_TOL, ORIGIN_POINT_2D, ORIGIN_POINT_3D, TAU } from './AcGeConstants';
 export { AcGeGeometryUtil, isPointInPolygon, isPolygonIntersect } from './AcGeGeometryUtil';
 export { AcGeMathUtil, DEG2RAD, RAD2DEG, ceilPowerOfTwo, clamp, damp, degToRad, euclideanModulo, floorPowerOfTwo, generateUUID, intPartLength, inverseLerp, isBetween, isBetweenAngle, isPowerOfTwo, lerp, mapLinear, normalizeAngle, pingpong, radToDeg, randFloat, randFloatSpread, randInt, relativeEps, seededRandom, smootherstep, smoothstep } from './AcGeMathUtil';
-export { basisFunction, calculateCurveLength, computeParameterValues, evaluateNurbsPoint, generateAveragedKnots, generateChordKnots, generateSqrtChordKnots, generateUniformKnots, interpolateControlPoints, interpolateNurbsCurve } from './AcGeNurbsUtil';
+export { basisFunction, calculateCurveLength, computeParameterValues, evaluateNurbsPoint, evaluateNurbsDerivatives, signedPlanarCurvature, generateAveragedKnots, generateChordKnots, generateSqrtChordKnots, generateUniformKnots, interpolateControlPoints, interpolateNurbsCurve } from './AcGeNurbsUtil';
 export { getOcsAngle, getOcsReferenceVector, transformOcsPointToWcs, transformWcsPointToOcs } from './AcGeOcsUtil';
 export { AcGeTol, DEFAULT_TOL } from './AcGeTol';
+export { offsetPointByDirectionInXY, offsetVertexPath } from './AcGeCurveOffsetUtil';
+export { offsetSmoothedSampledPath } from './AcGeSampledCurveOffsetUtil';
 //# sourceMappingURL=index.d.ts.map

package/lib/util/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/util/index.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,SAAS,EACT,eAAe,EACf,eAAe,EACf,GAAG,EACJ,MAAM,iBAAiB,CAAA;AACxB,OAAO,EACL,gBAAgB,EAChB,gBAAgB,EAChB,kBAAkB,EACnB,MAAM,oBAAoB,CAAA;AAC3B,OAAO,EACL,YAAY,EACZ,OAAO,EACP,OAAO,EACP,cAAc,EACd,KAAK,EACL,IAAI,EACJ,QAAQ,EACR,eAAe,EACf,eAAe,EACf,YAAY,EACZ,aAAa,EACb,WAAW,EACX,SAAS,EACT,cAAc,EACd,YAAY,EACZ,IAAI,EACJ,SAAS,EACT,cAAc,EACd,QAAQ,EACR,QAAQ,EACR,SAAS,EACT,eAAe,EACf,OAAO,EACP,WAAW,EACX,YAAY,EACZ,YAAY,EACZ,UAAU,EACX,MAAM,gBAAgB,CAAA;AACvB,OAAO,EACL,aAAa,EACb,oBAAoB,EACpB,sBAAsB,EACtB,kBAAkB,EAClB,qBAAqB,EACrB,kBAAkB,EAClB,sBAAsB,EACtB,oBAAoB,EACpB,wBAAwB,EACxB,qBAAqB,EACtB,MAAM,iBAAiB,CAAA;AACxB,OAAO,EACL,WAAW,EACX,qBAAqB,EACrB,sBAAsB,EACtB,sBAAsB,EACvB,MAAM,eAAe,CAAA;AACtB,OAAO,EAAE,OAAO,EAAE,WAAW,EAAE,MAAM,WAAW,CAAA"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/util/index.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,SAAS,EACT,eAAe,EACf,eAAe,EACf,GAAG,EACJ,MAAM,iBAAiB,CAAA;AACxB,OAAO,EACL,gBAAgB,EAChB,gBAAgB,EAChB,kBAAkB,EACnB,MAAM,oBAAoB,CAAA;AAC3B,OAAO,EACL,YAAY,EACZ,OAAO,EACP,OAAO,EACP,cAAc,EACd,KAAK,EACL,IAAI,EACJ,QAAQ,EACR,eAAe,EACf,eAAe,EACf,YAAY,EACZ,aAAa,EACb,WAAW,EACX,SAAS,EACT,cAAc,EACd,YAAY,EACZ,IAAI,EACJ,SAAS,EACT,cAAc,EACd,QAAQ,EACR,QAAQ,EACR,SAAS,EACT,eAAe,EACf,OAAO,EACP,WAAW,EACX,YAAY,EACZ,YAAY,EACZ,UAAU,EACX,MAAM,gBAAgB,CAAA;AACvB,OAAO,EACL,aAAa,EACb,oBAAoB,EACpB,sBAAsB,EACtB,kBAAkB,EAClB,wBAAwB,EACxB,qBAAqB,EACrB,qBAAqB,EACrB,kBAAkB,EAClB,sBAAsB,EACtB,oBAAoB,EACpB,wBAAwB,EACxB,qBAAqB,EACtB,MAAM,iBAAiB,CAAA;AACxB,OAAO,EACL,WAAW,EACX,qBAAqB,EACrB,sBAAsB,EACtB,sBAAsB,EACvB,MAAM,eAAe,CAAA;AACtB,OAAO,EAAE,OAAO,EAAE,WAAW,EAAE,MAAM,WAAW,CAAA;AAChD,OAAO,EACL,0BAA0B,EAC1B,gBAAgB,EACjB,MAAM,uBAAuB,CAAA;AAC9B,OAAO,EAAE,yBAAyB,EAAE,MAAM,8BAA8B,CAAA"}

package/lib/util/index.js

@@ -1,7 +1,9 @@
 export { FLOAT_TOL, ORIGIN_POINT_2D, ORIGIN_POINT_3D, TAU } from './AcGeConstants';
 export { AcGeGeometryUtil, isPointInPolygon, isPolygonIntersect } from './AcGeGeometryUtil';
 export { AcGeMathUtil, DEG2RAD, RAD2DEG, ceilPowerOfTwo, clamp, damp, degToRad, euclideanModulo, floorPowerOfTwo, generateUUID, intPartLength, inverseLerp, isBetween, isBetweenAngle, isPowerOfTwo, lerp, mapLinear, normalizeAngle, pingpong, radToDeg, randFloat, randFloatSpread, randInt, relativeEps, seededRandom, smootherstep, smoothstep } from './AcGeMathUtil';
-export { basisFunction, calculateCurveLength, computeParameterValues, evaluateNurbsPoint, generateAveragedKnots, generateChordKnots, generateSqrtChordKnots, generateUniformKnots, interpolateControlPoints, interpolateNurbsCurve } from './AcGeNurbsUtil';
+export { basisFunction, calculateCurveLength, computeParameterValues, evaluateNurbsPoint, evaluateNurbsDerivatives, signedPlanarCurvature, generateAveragedKnots, generateChordKnots, generateSqrtChordKnots, generateUniformKnots, interpolateControlPoints, interpolateNurbsCurve } from './AcGeNurbsUtil';
 export { getOcsAngle, getOcsReferenceVector, transformOcsPointToWcs, transformWcsPointToOcs } from './AcGeOcsUtil';
 export { AcGeTol, DEFAULT_TOL } from './AcGeTol';
+export { offsetPointByDirectionInXY, offsetVertexPath } from './AcGeCurveOffsetUtil';
+export { offsetSmoothedSampledPath } from './AcGeSampledCurveOffsetUtil';
 //# sourceMappingURL=index.js.map

package/lib/util/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/util/index.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,SAAS,EACT,eAAe,EACf,eAAe,EACf,GAAG,EACJ,MAAM,iBAAiB,CAAA;AACxB,OAAO,EACL,gBAAgB,EAChB,gBAAgB,EAChB,kBAAkB,EACnB,MAAM,oBAAoB,CAAA;AAC3B,OAAO,EACL,YAAY,EACZ,OAAO,EACP,OAAO,EACP,cAAc,EACd,KAAK,EACL,IAAI,EACJ,QAAQ,EACR,eAAe,EACf,eAAe,EACf,YAAY,EACZ,aAAa,EACb,WAAW,EACX,SAAS,EACT,cAAc,EACd,YAAY,EACZ,IAAI,EACJ,SAAS,EACT,cAAc,EACd,QAAQ,EACR,QAAQ,EACR,SAAS,EACT,eAAe,EACf,OAAO,EACP,WAAW,EACX,YAAY,EACZ,YAAY,EACZ,UAAU,EACX,MAAM,gBAAgB,CAAA;AACvB,OAAO,EACL,aAAa,EACb,oBAAoB,EACpB,sBAAsB,EACtB,kBAAkB,EAClB,qBAAqB,EACrB,kBAAkB,EAClB,sBAAsB,EACtB,oBAAoB,EACpB,wBAAwB,EACxB,qBAAqB,EACtB,MAAM,iBAAiB,CAAA;AACxB,OAAO,EACL,WAAW,EACX,qBAAqB,EACrB,sBAAsB,EACtB,sBAAsB,EACvB,MAAM,eAAe,CAAA;AACtB,OAAO,EAAE,OAAO,EAAE,WAAW,EAAE,MAAM,WAAW,CAAA"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/util/index.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,SAAS,EACT,eAAe,EACf,eAAe,EACf,GAAG,EACJ,MAAM,iBAAiB,CAAA;AACxB,OAAO,EACL,gBAAgB,EAChB,gBAAgB,EAChB,kBAAkB,EACnB,MAAM,oBAAoB,CAAA;AAC3B,OAAO,EACL,YAAY,EACZ,OAAO,EACP,OAAO,EACP,cAAc,EACd,KAAK,EACL,IAAI,EACJ,QAAQ,EACR,eAAe,EACf,eAAe,EACf,YAAY,EACZ,aAAa,EACb,WAAW,EACX,SAAS,EACT,cAAc,EACd,YAAY,EACZ,IAAI,EACJ,SAAS,EACT,cAAc,EACd,QAAQ,EACR,QAAQ,EACR,SAAS,EACT,eAAe,EACf,OAAO,EACP,WAAW,EACX,YAAY,EACZ,YAAY,EACZ,UAAU,EACX,MAAM,gBAAgB,CAAA;AACvB,OAAO,EACL,aAAa,EACb,oBAAoB,EACpB,sBAAsB,EACtB,kBAAkB,EAClB,wBAAwB,EACxB,qBAAqB,EACrB,qBAAqB,EACrB,kBAAkB,EAClB,sBAAsB,EACtB,oBAAoB,EACpB,wBAAwB,EACxB,qBAAqB,EACtB,MAAM,iBAAiB,CAAA;AACxB,OAAO,EACL,WAAW,EACX,qBAAqB,EACrB,sBAAsB,EACtB,sBAAsB,EACvB,MAAM,eAAe,CAAA;AACtB,OAAO,EAAE,OAAO,EAAE,WAAW,EAAE,MAAM,WAAW,CAAA;AAChD,OAAO,EACL,0BAA0B,EAC1B,gBAAgB,EACjB,MAAM,uBAAuB,CAAA;AAC9B,OAAO,EAAE,yBAAyB,EAAE,MAAM,8BAA8B,CAAA"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@mlightcad/geometry-engine",
-  "version": "3.2.38",
+  "version": "3.2.39",
   "license": "MIT",
   "type": "module",
   "repository": {
@@ -33,7 +33,7 @@
     "require": "./dist/geometry-engine.umd.cjs"
   },
   "peerDependencies": {
-    "@mlightcad/common": "1.4.38"
+    "@mlightcad/common": "1.4.39"
   },
   "scripts": {
     "clean": "rimraf dist lib tsconfig.tsbuildinfo",