@immugio/three-math-extensions 0.2.33 → 0.2.34

package/CHANGELOG.md

@@ -7,7 +7,18 @@ and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0
 
 Generated by [`auto-changelog`](https://github.com/CookPete/auto-changelog).
 
-## [0.2.33](https://github.com/Immugio/three-math-extensions/compare/0.2.32...0.2.33)
+## [0.2.34](https://github.com/Immugio/three-math-extensions/compare/0.2.33...0.2.34)
+
+### Commits
+
+- Add containsPoint [`8e15aa2`](https://github.com/Immugio/three-math-extensions/commit/8e15aa275efa2b8c939bb3c85e456a269c360054)
+- Add isPolygonClockwise [`9fb7f1c`](https://github.com/Immugio/three-math-extensions/commit/9fb7f1c6f9f185ffacdf933158618588a12e4b33)
+- Add getPolygonArea [`f2f2c32`](https://github.com/Immugio/three-math-extensions/commit/f2f2c32ca19790972520c1d8827d76f20052a1fe)
+- Improve Polygon.containsPoint [`805822d`](https://github.com/Immugio/three-math-extensions/commit/805822df97009d4f4004227e642562760607bc9f)
+- Add Polygon.ensureOpen [`12d96bc`](https://github.com/Immugio/three-math-extensions/commit/12d96bcef0e06da62927b2fd336f821040a6c6c5)
+- Add ensurePolygonClockwise [`a8b1f03`](https://github.com/Immugio/three-math-extensions/commit/a8b1f03e85d86d56b341c2636e4e92eeb652af77)
+
+## [0.2.33](https://github.com/Immugio/three-math-extensions/compare/0.2.32...0.2.33) - 2024-10-21
 
 ### Commits
 

package/cjs/Polygon.js

@@ -5,8 +5,11 @@ const Vec2_1 = require("./Vec2");
 const Rectangle_1 = require("./Rectangle");
 const BoundingBox_1 = require("./BoundingBox");
 const polygonPerimeter_1 = require("./polygonPerimeter");
-const isPointInPolygon_1 = require("./isPointInPolygon");
 const Line2D_1 = require("./Line2D");
+const isPolygonClockwise_1 = require("./isPolygonClockwise");
+const ensurePolygonClockwise_1 = require("./ensurePolygonClockwise");
+const containsPoint_1 = require("./containsPoint");
+const getPolygonArea_1 = require("./getPolygonArea");
 class Polygon {
     contour;
     holes;
@@ -61,6 +64,21 @@ class Polygon {
         }
         return this;
     }
+    ensureOpen() {
+        function ensure(points) {
+            if (points.length > 2 && points[0].equals(points.at(-1))) {
+                points.pop();
+            }
+        }
+        ensure(this.contour);
+        for (const hole of this.holes || []) {
+            ensure(hole);
+        }
+        return this;
+    }
+    get area() {
+        return (0, getPolygonArea_1.getPolygonArea)(this.contour);
+    }
     boundingBox() {
         let minX = Infinity, maxX = -Infinity, minY = Infinity, maxY = -Infinity;
         for (const p of this.contour) {
@@ -93,8 +111,16 @@ class Polygon {
     perimeter() {
         return (0, polygonPerimeter_1.polygonPerimeter)(this.contour);
     }
-    containsPoint(point) {
-        return (0, isPointInPolygon_1.isPointInPolygon)(this.contour, point) && (this.holes || []).every(hole => !(0, isPointInPolygon_1.isPointInPolygon)(hole, point));
+    get isClockwise() {
+        return (0, isPolygonClockwise_1.isPolygonClockwise)(this.contour);
+    }
+    ensureClockwise() {
+        (0, ensurePolygonClockwise_1.ensurePolygonClockwise)(this.contour);
+        return this;
+    }
+    containsPoint(...points) {
+        return points.every(point => (0, containsPoint_1.containsPoint)(this.contour, point)) &&
+            (this.holes || []).every(hole => !points.some(point => (0, containsPoint_1.containsPoint)(hole, point)));
     }
     flipSingle(centerX, poly) {
         for (const point of poly) {

package/cjs/containsPoint.js

@@ -0,0 +1,70 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.containsPoints = exports.containsPoint = void 0;
+/**
+ * Return if polygon contains @point or when the point is on the polygon boundary.
+ * Works consistently with points on the boundary.
+ * Works with simple polygons only.
+ * The code is copied from PolyK library.
+ * @returns {boolean} depth
+ * @param polygon
+ * @param point
+ */
+function containsPoint(polygon, point) {
+    const p = [];
+    for (let i = 0; i < polygon.length; i++) {
+        p.push(polygon[i].x);
+        p.push(polygon[i].y);
+    }
+    const px = point.x;
+    const py = point.y;
+    const n = p.length >> 1;
+    let ax;
+    let ay = p[2 * n - 3] - py;
+    let bx = p[2 * n - 2] - px;
+    let by = p[2 * n - 1] - py;
+    let lup;
+    // var lup = by > ay;
+    for (let i = 0; i < n; i++) {
+        ax = bx;
+        ay = by;
+        bx = p[2 * i] - px;
+        by = p[2 * i + 1] - py;
+        if (ay === by)
+            continue;
+        lup = by > ay;
+    }
+    let depth = 0;
+    for (let i = 0; i < n; i++) {
+        ax = bx;
+        ay = by;
+        bx = p[2 * i] - px;
+        by = p[2 * i + 1] - py;
+        if (ay < 0 && by < 0)
+            continue; // both "up" or both "down"
+        if (ay > 0 && by > 0)
+            continue; // both "up" or both "down"
+        if (ax < 0 && bx < 0)
+            continue; // both points on the left
+        if (ay === by && Math.min(ax, bx) <= 0)
+            return true;
+        if (ay === by)
+            continue;
+        const lx = ax + (bx - ax) * (-ay) / (by - ay);
+        if (lx === 0)
+            return true; // point on edge
+        if (lx > 0)
+            depth++;
+        if (ay === 0 && lup && by > ay)
+            depth--; // hit vertex, both up
+        if (ay === 0 && !lup && by < ay)
+            depth--; // hit vertex, both down(x < (p[j].x - p[i].x) * (y - p[i].y) / (p[j].y - p[i].y) + p[i].x)) {
+        lup = by > ay;
+    }
+    return (depth & 1) === 1;
+}
+exports.containsPoint = containsPoint;
+function containsPoints(polygon, points) {
+    return points.every(p => containsPoint(polygon, p));
+}
+exports.containsPoints = containsPoints;

package/cjs/ensurePolygonClockwise.js

@@ -0,0 +1,11 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.ensurePolygonClockwise = void 0;
+const isPolygonClockwise_1 = require("./isPolygonClockwise");
+function ensurePolygonClockwise(poly) {
+    if (!(0, isPolygonClockwise_1.isPolygonClockwise)(poly)) {
+        return poly.reverse();
+    }
+    return poly;
+}
+exports.ensurePolygonClockwise = ensurePolygonClockwise;

package/cjs/getPolygonArea.js

@@ -0,0 +1,24 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getPolygonArea = void 0;
+/**
+ * Returns the area of polygon.
+ * @returns {number}
+ * @param polygon {Point2[]}
+ */
+function getPolygonArea(polygon) {
+    const p = [];
+    for (const point of polygon) {
+        p.push(point.x, point.y);
+    }
+    if (p.length < 6)
+        return 0;
+    const l = p.length - 2;
+    let sum = 0;
+    for (let i = 0; i < l; i += 2) {
+        sum += (p[i + 2] - p[i]) * (p[i + 1] + p[i + 3]);
+    }
+    sum += (p[0] - p[l]) * (p[l + 1] + p[1]);
+    return Math.abs(-sum * 0.5); // Handles -0
+}
+exports.getPolygonArea = getPolygonArea;

package/cjs/index.js

@@ -1,6 +1,6 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.sortLinesByConnections = exports.extendOrTrimPolylinesAtIntersections = exports.offsetPolyline = exports.polygonPerimeter = exports.isContinuousClosedShape = exports.directions2d = exports.directions = exports.isPointInPolygon = exports.HalfPI = exports.TwoPI = exports.normalizeAngleRadians = exports.normalizeAngleDegrees = exports.Rectangle = exports.BoundingBox = exports.Polygon = exports.Size2 = exports.Line3D = exports.Line2D = exports.Vec3 = exports.Vec2 = void 0;
+exports.getPolygonArea = exports.containsPoint = exports.ensurePolygonClockwise = exports.isPolygonClockwise = exports.sortLinesByConnections = exports.extendOrTrimPolylinesAtIntersections = exports.offsetPolyline = exports.polygonPerimeter = exports.isContinuousClosedShape = exports.directions2d = exports.directions = exports.isPointInPolygon = exports.HalfPI = exports.TwoPI = exports.normalizeAngleRadians = exports.normalizeAngleDegrees = exports.Rectangle = exports.BoundingBox = exports.Polygon = exports.Size2 = exports.Line3D = exports.Line2D = exports.Vec3 = exports.Vec2 = void 0;
 var Vec2_1 = require("./Vec2");
 Object.defineProperty(exports, "Vec2", { enumerable: true, get: function () { return Vec2_1.Vec2; } });
 var Vec3_1 = require("./Vec3");
@@ -40,3 +40,11 @@ var extendOrTrimPolylinesAtIntersections_1 = require("./extendOrTrimPolylinesAtI
 Object.defineProperty(exports, "extendOrTrimPolylinesAtIntersections", { enumerable: true, get: function () { return extendOrTrimPolylinesAtIntersections_1.extendOrTrimPolylinesAtIntersections; } });
 var sortLinesByConnections_1 = require("./sortLinesByConnections");
 Object.defineProperty(exports, "sortLinesByConnections", { enumerable: true, get: function () { return sortLinesByConnections_1.sortLinesByConnections; } });
+var isPolygonClockwise_1 = require("./isPolygonClockwise");
+Object.defineProperty(exports, "isPolygonClockwise", { enumerable: true, get: function () { return isPolygonClockwise_1.isPolygonClockwise; } });
+var ensurePolygonClockwise_1 = require("./ensurePolygonClockwise");
+Object.defineProperty(exports, "ensurePolygonClockwise", { enumerable: true, get: function () { return ensurePolygonClockwise_1.ensurePolygonClockwise; } });
+var containsPoint_1 = require("./containsPoint");
+Object.defineProperty(exports, "containsPoint", { enumerable: true, get: function () { return containsPoint_1.containsPoint; } });
+var getPolygonArea_1 = require("./getPolygonArea");
+Object.defineProperty(exports, "getPolygonArea", { enumerable: true, get: function () { return getPolygonArea_1.getPolygonArea; } });

package/cjs/isPointInPolygon.js

@@ -1,6 +1,13 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.isPointInPolygon = void 0;
+/**
+ * Check if a point is inside a polygon
+ * Warning: The function returns unreliable results for points on the polygon boundary.
+ * Obsolete, use containsPoint instead.
+ * @param p
+ * @param point
+ */
 function isPointInPolygon(p, point) {
     const x = point.x, y = point.y;
     let i, j, c = false;

package/cjs/isPolygonClockwise.js

@@ -0,0 +1,18 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.isPolygonClockwise = void 0;
+/*
+* Determines if a polygon is clockwise or counter-clockwise.
+* X increases to the right, Y increases downwards.
+* Based on this answer https://stackoverflow.com/a/18472899/1837173 - the result is inverted, they assume the inverse y-axis
+*/
+function isPolygonClockwise(vertices) {
+    let sum = 0.0;
+    for (let i = 0; i < vertices.length; i++) {
+        const v1 = vertices[i];
+        const v2 = vertices[(i + 1) % vertices.length];
+        sum += (v2.x - v1.x) * (v2.y + v1.y);
+    }
+    return sum < 0.0;
+}
+exports.isPolygonClockwise = isPolygonClockwise;

package/esm/Polygon.js

@@ -2,8 +2,11 @@ import { Vec2 } from "./Vec2";
 import { Rectangle } from "./Rectangle";
 import { BoundingBox } from "./BoundingBox";
 import { polygonPerimeter } from "./polygonPerimeter";
-import { isPointInPolygon } from "./isPointInPolygon";
 import { Line2D } from "./Line2D";
+import { isPolygonClockwise } from "./isPolygonClockwise";
+import { ensurePolygonClockwise } from "./ensurePolygonClockwise";
+import { containsPoint } from "./containsPoint";
+import { getPolygonArea } from "./getPolygonArea";
 export class Polygon {
     contour;
     holes;
@@ -58,6 +61,21 @@ export class Polygon {
         }
         return this;
     }
+    ensureOpen() {
+        function ensure(points) {
+            if (points.length > 2 && points[0].equals(points.at(-1))) {
+                points.pop();
+            }
+        }
+        ensure(this.contour);
+        for (const hole of this.holes || []) {
+            ensure(hole);
+        }
+        return this;
+    }
+    get area() {
+        return getPolygonArea(this.contour);
+    }
     boundingBox() {
         let minX = Infinity, maxX = -Infinity, minY = Infinity, maxY = -Infinity;
         for (const p of this.contour) {
@@ -90,8 +108,16 @@ export class Polygon {
     perimeter() {
         return polygonPerimeter(this.contour);
     }
-    containsPoint(point) {
-        return isPointInPolygon(this.contour, point) && (this.holes || []).every(hole => !isPointInPolygon(hole, point));
+    get isClockwise() {
+        return isPolygonClockwise(this.contour);
+    }
+    ensureClockwise() {
+        ensurePolygonClockwise(this.contour);
+        return this;
+    }
+    containsPoint(...points) {
+        return points.every(point => containsPoint(this.contour, point)) &&
+            (this.holes || []).every(hole => !points.some(point => containsPoint(hole, point)));
     }
     flipSingle(centerX, poly) {
         for (const point of poly) {

package/esm/containsPoint.js

@@ -0,0 +1,65 @@
+/**
+ * Return if polygon contains @point or when the point is on the polygon boundary.
+ * Works consistently with points on the boundary.
+ * Works with simple polygons only.
+ * The code is copied from PolyK library.
+ * @returns {boolean} depth
+ * @param polygon
+ * @param point
+ */
+export function containsPoint(polygon, point) {
+    const p = [];
+    for (let i = 0; i < polygon.length; i++) {
+        p.push(polygon[i].x);
+        p.push(polygon[i].y);
+    }
+    const px = point.x;
+    const py = point.y;
+    const n = p.length >> 1;
+    let ax;
+    let ay = p[2 * n - 3] - py;
+    let bx = p[2 * n - 2] - px;
+    let by = p[2 * n - 1] - py;
+    let lup;
+    // var lup = by > ay;
+    for (let i = 0; i < n; i++) {
+        ax = bx;
+        ay = by;
+        bx = p[2 * i] - px;
+        by = p[2 * i + 1] - py;
+        if (ay === by)
+            continue;
+        lup = by > ay;
+    }
+    let depth = 0;
+    for (let i = 0; i < n; i++) {
+        ax = bx;
+        ay = by;
+        bx = p[2 * i] - px;
+        by = p[2 * i + 1] - py;
+        if (ay < 0 && by < 0)
+            continue; // both "up" or both "down"
+        if (ay > 0 && by > 0)
+            continue; // both "up" or both "down"
+        if (ax < 0 && bx < 0)
+            continue; // both points on the left
+        if (ay === by && Math.min(ax, bx) <= 0)
+            return true;
+        if (ay === by)
+            continue;
+        const lx = ax + (bx - ax) * (-ay) / (by - ay);
+        if (lx === 0)
+            return true; // point on edge
+        if (lx > 0)
+            depth++;
+        if (ay === 0 && lup && by > ay)
+            depth--; // hit vertex, both up
+        if (ay === 0 && !lup && by < ay)
+            depth--; // hit vertex, both down(x < (p[j].x - p[i].x) * (y - p[i].y) / (p[j].y - p[i].y) + p[i].x)) {
+        lup = by > ay;
+    }
+    return (depth & 1) === 1;
+}
+export function containsPoints(polygon, points) {
+    return points.every(p => containsPoint(polygon, p));
+}

package/esm/ensurePolygonClockwise.js

@@ -0,0 +1,7 @@
+import { isPolygonClockwise } from "./isPolygonClockwise";
+export function ensurePolygonClockwise(poly) {
+    if (!isPolygonClockwise(poly)) {
+        return poly.reverse();
+    }
+    return poly;
+}

package/esm/getPolygonArea.js

@@ -0,0 +1,20 @@
+/**
+ * Returns the area of polygon.
+ * @returns {number}
+ * @param polygon {Point2[]}
+ */
+export function getPolygonArea(polygon) {
+    const p = [];
+    for (const point of polygon) {
+        p.push(point.x, point.y);
+    }
+    if (p.length < 6)
+        return 0;
+    const l = p.length - 2;
+    let sum = 0;
+    for (let i = 0; i < l; i += 2) {
+        sum += (p[i + 2] - p[i]) * (p[i + 1] + p[i + 3]);
+    }
+    sum += (p[0] - p[l]) * (p[l + 1] + p[1]);
+    return Math.abs(-sum * 0.5); // Handles -0
+}

package/esm/index.js

@@ -17,3 +17,7 @@ export { polygonPerimeter } from "./polygonPerimeter";
 export { offsetPolyline } from "./offsetPolyline";
 export { extendOrTrimPolylinesAtIntersections } from "./extendOrTrimPolylinesAtIntersections";
 export { sortLinesByConnections } from "./sortLinesByConnections";
+export { isPolygonClockwise } from "./isPolygonClockwise";
+export { ensurePolygonClockwise } from "./ensurePolygonClockwise";
+export { containsPoint } from "./containsPoint";
+export { getPolygonArea } from "./getPolygonArea";

package/esm/isPointInPolygon.js

@@ -1,3 +1,10 @@
+/**
+ * Check if a point is inside a polygon
+ * Warning: The function returns unreliable results for points on the polygon boundary.
+ * Obsolete, use containsPoint instead.
+ * @param p
+ * @param point
+ */
 export function isPointInPolygon(p, point) {
     const x = point.x, y = point.y;
     let i, j, c = false;

package/esm/isPolygonClockwise.js

@@ -0,0 +1,14 @@
+/*
+* Determines if a polygon is clockwise or counter-clockwise.
+* X increases to the right, Y increases downwards.
+* Based on this answer https://stackoverflow.com/a/18472899/1837173 - the result is inverted, they assume the inverse y-axis
+*/
+export function isPolygonClockwise(vertices) {
+    let sum = 0.0;
+    for (let i = 0; i < vertices.length; i++) {
+        const v1 = vertices[i];
+        const v2 = vertices[(i + 1) % vertices.length];
+        sum += (v2.x - v1.x) * (v2.y + v1.y);
+    }
+    return sum < 0.0;
+}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@immugio/three-math-extensions",
-  "version": "0.2.33",
+  "version": "0.2.34",
   "description": "Set of utilities for 2d and 3d line math built on top of three.js",
   "author": "Jan Mikeska <janmikeska@gmail.com>",
   "license": "ISC",

package/src/Polygon.ts

@@ -3,8 +3,11 @@ import { Vec2 } from "./Vec2";
 import { Rectangle } from "./Rectangle";
 import { BoundingBox } from "./BoundingBox";
 import { polygonPerimeter } from "./polygonPerimeter";
-import { isPointInPolygon } from "./isPointInPolygon";
 import { Line2D } from "./Line2D";
+import { isPolygonClockwise } from "./isPolygonClockwise";
+import { ensurePolygonClockwise } from "./ensurePolygonClockwise";
+import { containsPoint } from "./containsPoint";
+import { getPolygonArea } from "./getPolygonArea";
 
 export class Polygon {
 
@@ -73,6 +76,26 @@ export class Polygon {
         return this;
     }
 
+    public ensureOpen(): this {
+        function ensure(points: Vec2[]): void {
+            if (points.length > 2 && points[0].equals(points.at(-1))) {
+                points.pop();
+            }
+        }
+
+        ensure(this.contour);
+
+        for (const hole of this.holes || []) {
+            ensure(hole);
+        }
+
+        return this;
+    }
+
+    public get area(): number {
+        return getPolygonArea(this.contour);
+    }
+
     public boundingBox(): BoundingBox {
         let minX = Infinity, maxX = -Infinity, minY = Infinity, maxY = -Infinity;
 
@@ -107,8 +130,18 @@ export class Polygon {
         return polygonPerimeter(this.contour);
     }
 
-    public containsPoint(point: Vec2): boolean {
-        return isPointInPolygon(this.contour, point) && (this.holes || []).every(hole => !isPointInPolygon(hole, point));
+    public get isClockwise(): boolean {
+        return isPolygonClockwise(this.contour);
+    }
+
+    public ensureClockwise(): this {
+        ensurePolygonClockwise(this.contour);
+        return this;
+    }
+
+    public containsPoint(...points: Vec2[]): boolean {
+        return points.every(point => containsPoint(this.contour, point)) &&
+            (this.holes || []).every(hole => !points.some(point => containsPoint(hole, point)));
     }
 
     private flipSingle(centerX: number, poly: Vec2[]): void {

package/src/containsPoint.ts

@@ -0,0 +1,66 @@
+import { Point2 } from "./Point2";
+
+/**
+ * Return if polygon contains @point or when the point is on the polygon boundary.
+ * Works consistently with points on the boundary.
+ * Works with simple polygons only.
+ * The code is copied from PolyK library.
+ * @returns {boolean} depth
+ * @param polygon
+ * @param point
+ */
+export function containsPoint(polygon: Point2[], point: Point2): boolean {
+    const p: number[] = [];
+    for (let i = 0; i < polygon.length; i++) {
+        p.push(polygon[i].x);
+        p.push(polygon[i].y);
+    }
+
+    const px = point.x;
+    const py = point.y;
+    const n = p.length >> 1;
+
+    let ax: number;
+
+    let ay = p[2 * n - 3] - py;
+    let bx = p[2 * n - 2] - px;
+    let by = p[2 * n - 1] - py;
+    let lup: boolean;
+
+    // var lup = by > ay;
+    for (let i = 0; i < n; i++) {
+        ax = bx;
+        ay = by;
+        bx = p[2 * i] - px;
+        by = p[2 * i + 1] - py;
+        if (ay === by) continue;
+        lup = by > ay;
+    }
+
+    let depth = 0;
+    for (let i = 0; i < n; i++) {
+        ax = bx;
+        ay = by;
+        bx = p[2 * i] - px;
+        by = p[2 * i + 1] - py;
+        if (ay < 0 && by < 0) continue;  // both "up" or both "down"
+        if (ay > 0 && by > 0) continue;  // both "up" or both "down"
+        if (ax < 0 && bx < 0) continue;   // both points on the left
+
+        if (ay === by && Math.min(ax, bx) <= 0) return true;
+        if (ay === by) continue;
+
+        const lx = ax + (bx - ax) * (-ay) / (by - ay);
+        if (lx === 0) return true;      // point on edge
+        if (lx > 0) depth++;
+        if (ay === 0 && lup && by > ay) depth--;  // hit vertex, both up
+        if (ay === 0 && !lup && by < ay) depth--; // hit vertex, both down(x < (p[j].x - p[i].x) * (y - p[i].y) / (p[j].y - p[i].y) + p[i].x)) {
+        lup = by > ay;
+    }
+
+    return (depth & 1) === 1;
+}
+
+export function containsPoints(polygon: Point2[], points: Point2[]): boolean {
+    return points.every(p => containsPoint(polygon, p));
+}

package/src/ensurePolygonClockwise.ts

@@ -0,0 +1,10 @@
+import { Point2 } from "./Point2";
+import { isPolygonClockwise } from "./isPolygonClockwise";
+
+export function ensurePolygonClockwise<T extends Point2>(poly: T[]): T[] {
+    if (!isPolygonClockwise(poly)) {
+        return poly.reverse();
+    }
+
+    return poly;
+}

package/src/getPolygonArea.ts

@@ -0,0 +1,22 @@
+import { Point2 } from "./Point2";
+
+/**
+ * Returns the area of polygon.
+ * @returns {number}
+ * @param polygon {Point2[]}
+ */
+export function getPolygonArea(polygon: Point2[]): number {
+    const p: number[] = [];
+    for (const point of polygon) {
+        p.push(point.x, point.y);
+    }
+
+    if (p.length < 6) return 0;
+    const l = p.length - 2;
+    let sum = 0;
+    for (let i = 0; i < l; i += 2) {
+        sum += (p[i + 2] - p[i]) * (p[i + 1] + p[i + 3]);
+    }
+    sum += (p[0] - p[l]) * (p[l + 1] + p[1]);
+    return Math.abs(-sum * 0.5); // Handles -0
+}

package/src/index.ts

@@ -18,4 +18,8 @@ export { isContinuousClosedShape } from "./isContinuousClosedShape";
 export { polygonPerimeter } from "./polygonPerimeter";
 export { offsetPolyline } from "./offsetPolyline";
 export { extendOrTrimPolylinesAtIntersections } from "./extendOrTrimPolylinesAtIntersections";
-export { sortLinesByConnections } from "./sortLinesByConnections";
+export { sortLinesByConnections } from "./sortLinesByConnections";
+export { isPolygonClockwise } from "./isPolygonClockwise";
+export { ensurePolygonClockwise } from "./ensurePolygonClockwise";
+export { containsPoint } from "./containsPoint";
+export { getPolygonArea } from "./getPolygonArea";

package/src/isPointInPolygon.ts

@@ -1,13 +1,18 @@
 import { Point2 } from "./Point2";
 
+/**
+ * Check if a point is inside a polygon
+ * Warning: The function returns unreliable results for points on the polygon boundary.
+ * Obsolete, use containsPoint instead.
+ * @param p
+ * @param point
+ */
 export function isPointInPolygon(p: Point2[], point: Point2): boolean {
-
     const x = point.x, y = point.y;
 
     let i: number, j: number, c = false;
 
     for (i = 0, j = p.length - 1; i < p.length; j = i++) {
-
         if ((((p[i].y <= y) && (y < p[j].y)) ||
                 ((p[j].y <= y) && (y < p[i].y))) &&
             (x < (p[j].x - p[i].x) * (y - p[i].y) / (p[j].y - p[i].y) + p[i].x)) {

package/src/isPolygonClockwise.ts

@@ -0,0 +1,16 @@
+import { Point2 } from "./Point2";
+
+/*
+* Determines if a polygon is clockwise or counter-clockwise.
+* X increases to the right, Y increases downwards.
+* Based on this answer https://stackoverflow.com/a/18472899/1837173 - the result is inverted, they assume the inverse y-axis
+*/
+export function isPolygonClockwise(vertices: Point2[]): boolean {
+    let sum = 0.0;
+    for (let i = 0; i < vertices.length; i++) {
+        const v1 = vertices[i];
+        const v2 = vertices[(i + 1) % vertices.length];
+        sum += (v2.x - v1.x) * (v2.y + v1.y);
+    }
+    return sum < 0.0;
+}

package/types/Polygon.d.ts

@@ -12,11 +12,15 @@ export declare class Polygon {
     centerOnOrigin(): this;
     center(): Vec2;
     ensureLastPoint(): this;
+    ensureOpen(): this;
+    get area(): number;
     boundingBox(): BoundingBox;
     toBoundingPolygon(): Polygon;
     flip(): this;
     perimeter(): number;
-    containsPoint(point: Vec2): boolean;
+    get isClockwise(): boolean;
+    ensureClockwise(): this;
+    containsPoint(...points: Vec2[]): boolean;
     private flipSingle;
     translate(translate: Vec2): this;
     /**

package/types/containsPoint.d.ts

@@ -0,0 +1,12 @@
+import { Point2 } from "./Point2";
+/**
+ * Return if polygon contains @point or when the point is on the polygon boundary.
+ * Works consistently with points on the boundary.
+ * Works with simple polygons only.
+ * The code is copied from PolyK library.
+ * @returns {boolean} depth
+ * @param polygon
+ * @param point
+ */
+export declare function containsPoint(polygon: Point2[], point: Point2): boolean;
+export declare function containsPoints(polygon: Point2[], points: Point2[]): boolean;

package/types/ensurePolygonClockwise.d.ts

@@ -0,0 +1,2 @@
+import { Point2 } from "./Point2";
+export declare function ensurePolygonClockwise<T extends Point2>(poly: T[]): T[];

package/types/getPolygonArea.d.ts

@@ -0,0 +1,7 @@
+import { Point2 } from "./Point2";
+/**
+ * Returns the area of polygon.
+ * @returns {number}
+ * @param polygon {Point2[]}
+ */
+export declare function getPolygonArea(polygon: Point2[]): number;

package/types/index.d.ts

@@ -19,3 +19,7 @@ export { polygonPerimeter } from "./polygonPerimeter";
 export { offsetPolyline } from "./offsetPolyline";
 export { extendOrTrimPolylinesAtIntersections } from "./extendOrTrimPolylinesAtIntersections";
 export { sortLinesByConnections } from "./sortLinesByConnections";
+export { isPolygonClockwise } from "./isPolygonClockwise";
+export { ensurePolygonClockwise } from "./ensurePolygonClockwise";
+export { containsPoint } from "./containsPoint";
+export { getPolygonArea } from "./getPolygonArea";

package/types/isPointInPolygon.d.ts

@@ -1,2 +1,9 @@
 import { Point2 } from "./Point2";
+/**
+ * Check if a point is inside a polygon
+ * Warning: The function returns unreliable results for points on the polygon boundary.
+ * Obsolete, use containsPoint instead.
+ * @param p
+ * @param point
+ */
 export declare function isPointInPolygon(p: Point2[], point: Point2): boolean;

package/types/isPolygonClockwise.d.ts

@@ -0,0 +1,2 @@
+import { Point2 } from "./Point2";
+export declare function isPolygonClockwise(vertices: Point2[]): boolean;