@iyulab/u-geometry 0.1.0

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026 iyulab
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -0,0 +1,91 @@
+# u-geometry
+
+**Domain-agnostic computational geometry library**
+
+[![Crates.io](https://img.shields.io/crates/v/u-geometry.svg)](https://crates.io/crates/u-geometry)
+[![docs.rs](https://docs.rs/u-geometry/badge.svg)](https://docs.rs/u-geometry)
+[![CI](https://github.com/iyulab/u-geometry/actions/workflows/ci.yml/badge.svg)](https://github.com/iyulab/u-geometry/actions/workflows/ci.yml)
+[![License](https://img.shields.io/badge/license-MIT-blue.svg)](LICENSE)
+
+## Overview
+
+u-geometry provides fundamental geometric primitives, transformations, polygon operations, collision detection, and spatial indexing. It contains no domain-specific concepts — nesting, packing, routing, etc. are defined by consumers.
+
+## Modules
+
+| Module | Description |
+|--------|-------------|
+| `primitives` | Core types: `Point2`, `Vector2`, `Segment2`, `AABB2`, `Point3`, `Vector3`, `AABB3` |
+| `polygon` | Polygon operations: area, centroid, convex hull, winding order, containment |
+| `transform` | Rigid transformations: `Transform2D`, `Transform3D` |
+| `robust` | Numerically robust geometric predicates (Shewchuk adaptive precision) |
+| `collision` | SAT-based collision detection (2D convex polygons), AABB overlap (2D and 3D) |
+| `minkowski` | Minkowski sum and No-Fit Polygon (NFP) for convex polygons |
+| `spatial_index` | Linear-scan spatial indices for 2D and 3D AABB queries |
+| `nalgebra_types` | Re-exports of commonly used `nalgebra` types for version consistency |
+
+## Features
+
+- **`serde`** — Enable serde serialization for geometric types (includes `nalgebra/serde-serialize`)
+
+## Quick Start
+
+```toml
+[dependencies]
+u-geometry = { git = "https://github.com/iyulab/u-geometry" }
+
+# with serde support
+u-geometry = { git = "https://github.com/iyulab/u-geometry", features = ["serde"] }
+```
+
+```rust
+use u_geometry::primitives::{Point2, AABB2};
+use u_geometry::polygon::Polygon2D;
+use u_geometry::collision::sat_overlap;
+
+// Points and AABBs
+let p = Point2::new(1.0, 2.0);
+let aabb = AABB2::new(Point2::new(0.0, 0.0), Point2::new(10.0, 10.0));
+assert!(aabb.contains(&p));
+
+// Polygon operations
+let polygon = Polygon2D::new(vec![
+    Point2::new(0.0, 0.0),
+    Point2::new(4.0, 0.0),
+    Point2::new(4.0, 3.0),
+    Point2::new(0.0, 3.0),
+]);
+assert!((polygon.area() - 12.0).abs() < 1e-10);
+```
+
+## Build & Test
+
+```bash
+cargo build
+cargo test
+cargo bench  # criterion benchmarks
+```
+
+## Academic References
+
+- de Berg, Cheong, van Kreveld, Overmars (2008), *Computational Geometry*
+- Shewchuk (1997), *Adaptive Precision Floating-Point Arithmetic*
+- O'Rourke (1998), *Computational Geometry in C*
+- Ericson (2005), *Real-Time Collision Detection*
+
+## Dependencies
+
+- `nalgebra` 0.33 — Linear algebra
+- `robust` 1.1 — Robust geometric predicates
+- `serde` 1.0 — Serialization (optional)
+
+## License
+
+MIT License — see [LICENSE](LICENSE).
+
+## Related
+
+- [u-numflow](https://github.com/iyulab/u-numflow) — Mathematical primitives
+- [u-metaheur](https://github.com/iyulab/u-metaheur) — Metaheuristic optimization (GA, SA, ALNS, CP)
+- [u-schedule](https://github.com/iyulab/u-schedule) — Scheduling framework
+- [u-nesting](https://github.com/iyulab/U-Nesting) — 2D/3D nesting and bin packing

package/package.json

@@ -0,0 +1,32 @@
+{
+  "name": "@iyulab/u-geometry",
+  "type": "module",
+  "collaborators": [
+    "iyulab"
+  ],
+  "description": "Domain-agnostic computational geometry: primitives, polygons, NFP, collision detection, spatial indexing.",
+  "version": "0.1.0",
+  "license": "MIT",
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/iyulab/u-geometry"
+  },
+  "files": [
+    "u_geometry_bg.wasm",
+    "u_geometry.js",
+    "u_geometry_bg.js",
+    "u_geometry.d.ts"
+  ],
+  "main": "u_geometry.js",
+  "types": "u_geometry.d.ts",
+  "sideEffects": [
+    "./u_geometry.js",
+    "./snippets/*"
+  ],
+  "keywords": [
+    "geometry",
+    "polygon",
+    "computational-geometry",
+    "nfp"
+  ]
+}

package/u_geometry.d.ts

@@ -0,0 +1,38 @@
+/* tslint:disable */
+/* eslint-disable */
+
+/**
+ * Computes the convex hull of a set of points (Graham scan, CCW order).
+ *
+ * # Arguments
+ * - `points_json`: JSON array of `{"x": f64, "y": f64}` objects
+ *
+ * # Returns
+ * JSON array of hull points in CCW order, same `{"x", "y"}` format.
+ */
+export function convex_hull(points_json: any): any;
+
+/**
+ * Tests whether a point lies inside (or on the boundary of) a simple polygon.
+ *
+ * Uses the ray-casting (winding-number) test.
+ *
+ * # Arguments
+ * - `point_json`: `{"x": f64, "y": f64}`
+ * - `polygon_json`: JSON array of `{"x": f64, "y": f64}` objects
+ *
+ * # Returns
+ * `true` if the point is inside or on the boundary.
+ */
+export function point_in_polygon(point_json: any, polygon_json: any): boolean;
+
+/**
+ * Computes the unsigned area of a simple polygon.
+ *
+ * # Arguments
+ * - `points_json`: JSON array of `{"x": f64, "y": f64}` objects
+ *
+ * # Returns
+ * Area as a non-negative `f64`.
+ */
+export function polygon_area(points_json: any): number;

package/u_geometry.js

@@ -0,0 +1,9 @@
+/* @ts-self-types="./u_geometry.d.ts" */
+
+import * as wasm from "./u_geometry_bg.wasm";
+import { __wbg_set_wasm } from "./u_geometry_bg.js";
+__wbg_set_wasm(wasm);
+wasm.__wbindgen_start();
+export {
+    convex_hull, point_in_polygon, polygon_area
+} from "./u_geometry_bg.js";

package/u_geometry_bg.js

@@ -0,0 +1,416 @@
+/**
+ * Computes the convex hull of a set of points (Graham scan, CCW order).
+ *
+ * # Arguments
+ * - `points_json`: JSON array of `{"x": f64, "y": f64}` objects
+ *
+ * # Returns
+ * JSON array of hull points in CCW order, same `{"x", "y"}` format.
+ * @param {any} points_json
+ * @returns {any}
+ */
+export function convex_hull(points_json) {
+    const ret = wasm.convex_hull(points_json);
+    if (ret[2]) {
+        throw takeFromExternrefTable0(ret[1]);
+    }
+    return takeFromExternrefTable0(ret[0]);
+}
+
+/**
+ * Tests whether a point lies inside (or on the boundary of) a simple polygon.
+ *
+ * Uses the ray-casting (winding-number) test.
+ *
+ * # Arguments
+ * - `point_json`: `{"x": f64, "y": f64}`
+ * - `polygon_json`: JSON array of `{"x": f64, "y": f64}` objects
+ *
+ * # Returns
+ * `true` if the point is inside or on the boundary.
+ * @param {any} point_json
+ * @param {any} polygon_json
+ * @returns {boolean}
+ */
+export function point_in_polygon(point_json, polygon_json) {
+    const ret = wasm.point_in_polygon(point_json, polygon_json);
+    if (ret[2]) {
+        throw takeFromExternrefTable0(ret[1]);
+    }
+    return ret[0] !== 0;
+}
+
+/**
+ * Computes the unsigned area of a simple polygon.
+ *
+ * # Arguments
+ * - `points_json`: JSON array of `{"x": f64, "y": f64}` objects
+ *
+ * # Returns
+ * Area as a non-negative `f64`.
+ * @param {any} points_json
+ * @returns {number}
+ */
+export function polygon_area(points_json) {
+    const ret = wasm.polygon_area(points_json);
+    if (ret[2]) {
+        throw takeFromExternrefTable0(ret[1]);
+    }
+    return ret[0];
+}
+export function __wbg_Error_8c4e43fe74559d73(arg0, arg1) {
+    const ret = Error(getStringFromWasm0(arg0, arg1));
+    return ret;
+}
+export function __wbg_String_8f0eb39a4a4c2f66(arg0, arg1) {
+    const ret = String(arg1);
+    const ptr1 = passStringToWasm0(ret, wasm.__wbindgen_malloc, wasm.__wbindgen_realloc);
+    const len1 = WASM_VECTOR_LEN;
+    getDataViewMemory0().setInt32(arg0 + 4 * 1, len1, true);
+    getDataViewMemory0().setInt32(arg0 + 4 * 0, ptr1, true);
+}
+export function __wbg___wbindgen_boolean_get_bbbb1c18aa2f5e25(arg0) {
+    const v = arg0;
+    const ret = typeof(v) === 'boolean' ? v : undefined;
+    return isLikeNone(ret) ? 0xFFFFFF : ret ? 1 : 0;
+}
+export function __wbg___wbindgen_debug_string_0bc8482c6e3508ae(arg0, arg1) {
+    const ret = debugString(arg1);
+    const ptr1 = passStringToWasm0(ret, wasm.__wbindgen_malloc, wasm.__wbindgen_realloc);
+    const len1 = WASM_VECTOR_LEN;
+    getDataViewMemory0().setInt32(arg0 + 4 * 1, len1, true);
+    getDataViewMemory0().setInt32(arg0 + 4 * 0, ptr1, true);
+}
+export function __wbg___wbindgen_in_47fa6863be6f2f25(arg0, arg1) {
+    const ret = arg0 in arg1;
+    return ret;
+}
+export function __wbg___wbindgen_is_function_0095a73b8b156f76(arg0) {
+    const ret = typeof(arg0) === 'function';
+    return ret;
+}
+export function __wbg___wbindgen_is_object_5ae8e5880f2c1fbd(arg0) {
+    const val = arg0;
+    const ret = typeof(val) === 'object' && val !== null;
+    return ret;
+}
+export function __wbg___wbindgen_is_undefined_9e4d92534c42d778(arg0) {
+    const ret = arg0 === undefined;
+    return ret;
+}
+export function __wbg___wbindgen_jsval_loose_eq_9dd77d8cd6671811(arg0, arg1) {
+    const ret = arg0 == arg1;
+    return ret;
+}
+export function __wbg___wbindgen_number_get_8ff4255516ccad3e(arg0, arg1) {
+    const obj = arg1;
+    const ret = typeof(obj) === 'number' ? obj : undefined;
+    getDataViewMemory0().setFloat64(arg0 + 8 * 1, isLikeNone(ret) ? 0 : ret, true);
+    getDataViewMemory0().setInt32(arg0 + 4 * 0, !isLikeNone(ret), true);
+}
+export function __wbg___wbindgen_string_get_72fb696202c56729(arg0, arg1) {
+    const obj = arg1;
+    const ret = typeof(obj) === 'string' ? obj : undefined;
+    var ptr1 = isLikeNone(ret) ? 0 : passStringToWasm0(ret, wasm.__wbindgen_malloc, wasm.__wbindgen_realloc);
+    var len1 = WASM_VECTOR_LEN;
+    getDataViewMemory0().setInt32(arg0 + 4 * 1, len1, true);
+    getDataViewMemory0().setInt32(arg0 + 4 * 0, ptr1, true);
+}
+export function __wbg___wbindgen_throw_be289d5034ed271b(arg0, arg1) {
+    throw new Error(getStringFromWasm0(arg0, arg1));
+}
+export function __wbg_call_389efe28435a9388() { return handleError(function (arg0, arg1) {
+    const ret = arg0.call(arg1);
+    return ret;
+}, arguments); }
+export function __wbg_done_57b39ecd9addfe81(arg0) {
+    const ret = arg0.done;
+    return ret;
+}
+export function __wbg_get_9b94d73e6221f75c(arg0, arg1) {
+    const ret = arg0[arg1 >>> 0];
+    return ret;
+}
+export function __wbg_get_b3ed3ad4be2bc8ac() { return handleError(function (arg0, arg1) {
+    const ret = Reflect.get(arg0, arg1);
+    return ret;
+}, arguments); }
+export function __wbg_get_with_ref_key_1dc361bd10053bfe(arg0, arg1) {
+    const ret = arg0[arg1];
+    return ret;
+}
+export function __wbg_instanceof_ArrayBuffer_c367199e2fa2aa04(arg0) {
+    let result;
+    try {
+        result = arg0 instanceof ArrayBuffer;
+    } catch (_) {
+        result = false;
+    }
+    const ret = result;
+    return ret;
+}
+export function __wbg_instanceof_Uint8Array_9b9075935c74707c(arg0) {
+    let result;
+    try {
+        result = arg0 instanceof Uint8Array;
+    } catch (_) {
+        result = false;
+    }
+    const ret = result;
+    return ret;
+}
+export function __wbg_isArray_d314bb98fcf08331(arg0) {
+    const ret = Array.isArray(arg0);
+    return ret;
+}
+export function __wbg_iterator_6ff6560ca1568e55() {
+    const ret = Symbol.iterator;
+    return ret;
+}
+export function __wbg_length_32ed9a279acd054c(arg0) {
+    const ret = arg0.length;
+    return ret;
+}
+export function __wbg_length_35a7bace40f36eac(arg0) {
+    const ret = arg0.length;
+    return ret;
+}
+export function __wbg_new_361308b2356cecd0() {
+    const ret = new Object();
+    return ret;
+}
+export function __wbg_new_3eb36ae241fe6f44() {
+    const ret = new Array();
+    return ret;
+}
+export function __wbg_new_dd2b680c8bf6ae29(arg0) {
+    const ret = new Uint8Array(arg0);
+    return ret;
+}
+export function __wbg_next_3482f54c49e8af19() { return handleError(function (arg0) {
+    const ret = arg0.next();
+    return ret;
+}, arguments); }
+export function __wbg_next_418f80d8f5303233(arg0) {
+    const ret = arg0.next;
+    return ret;
+}
+export function __wbg_prototypesetcall_bdcdcc5842e4d77d(arg0, arg1, arg2) {
+    Uint8Array.prototype.set.call(getArrayU8FromWasm0(arg0, arg1), arg2);
+}
+export function __wbg_set_3f1d0b984ed272ed(arg0, arg1, arg2) {
+    arg0[arg1] = arg2;
+}
+export function __wbg_set_f43e577aea94465b(arg0, arg1, arg2) {
+    arg0[arg1 >>> 0] = arg2;
+}
+export function __wbg_value_0546255b415e96c1(arg0) {
+    const ret = arg0.value;
+    return ret;
+}
+export function __wbindgen_cast_0000000000000001(arg0) {
+    // Cast intrinsic for `F64 -> Externref`.
+    const ret = arg0;
+    return ret;
+}
+export function __wbindgen_cast_0000000000000002(arg0, arg1) {
+    // Cast intrinsic for `Ref(String) -> Externref`.
+    const ret = getStringFromWasm0(arg0, arg1);
+    return ret;
+}
+export function __wbindgen_init_externref_table() {
+    const table = wasm.__wbindgen_externrefs;
+    const offset = table.grow(4);
+    table.set(0, undefined);
+    table.set(offset + 0, undefined);
+    table.set(offset + 1, null);
+    table.set(offset + 2, true);
+    table.set(offset + 3, false);
+}
+function addToExternrefTable0(obj) {
+    const idx = wasm.__externref_table_alloc();
+    wasm.__wbindgen_externrefs.set(idx, obj);
+    return idx;
+}
+
+function debugString(val) {
+    // primitive types
+    const type = typeof val;
+    if (type == 'number' || type == 'boolean' || val == null) {
+        return  `${val}`;
+    }
+    if (type == 'string') {
+        return `"${val}"`;
+    }
+    if (type == 'symbol') {
+        const description = val.description;
+        if (description == null) {
+            return 'Symbol';
+        } else {
+            return `Symbol(${description})`;
+        }
+    }
+    if (type == 'function') {
+        const name = val.name;
+        if (typeof name == 'string' && name.length > 0) {
+            return `Function(${name})`;
+        } else {
+            return 'Function';
+        }
+    }
+    // objects
+    if (Array.isArray(val)) {
+        const length = val.length;
+        let debug = '[';
+        if (length > 0) {
+            debug += debugString(val[0]);
+        }
+        for(let i = 1; i < length; i++) {
+            debug += ', ' + debugString(val[i]);
+        }
+        debug += ']';
+        return debug;
+    }
+    // Test for built-in
+    const builtInMatches = /\[object ([^\]]+)\]/.exec(toString.call(val));
+    let className;
+    if (builtInMatches && builtInMatches.length > 1) {
+        className = builtInMatches[1];
+    } else {
+        // Failed to match the standard '[object ClassName]'
+        return toString.call(val);
+    }
+    if (className == 'Object') {
+        // we're a user defined class or Object
+        // JSON.stringify avoids problems with cycles, and is generally much
+        // easier than looping through ownProperties of `val`.
+        try {
+            return 'Object(' + JSON.stringify(val) + ')';
+        } catch (_) {
+            return 'Object';
+        }
+    }
+    // errors
+    if (val instanceof Error) {
+        return `${val.name}: ${val.message}\n${val.stack}`;
+    }
+    // TODO we could test for more things here, like `Set`s and `Map`s.
+    return className;
+}
+
+function getArrayU8FromWasm0(ptr, len) {
+    ptr = ptr >>> 0;
+    return getUint8ArrayMemory0().subarray(ptr / 1, ptr / 1 + len);
+}
+
+let cachedDataViewMemory0 = null;
+function getDataViewMemory0() {
+    if (cachedDataViewMemory0 === null || cachedDataViewMemory0.buffer.detached === true || (cachedDataViewMemory0.buffer.detached === undefined && cachedDataViewMemory0.buffer !== wasm.memory.buffer)) {
+        cachedDataViewMemory0 = new DataView(wasm.memory.buffer);
+    }
+    return cachedDataViewMemory0;
+}
+
+function getStringFromWasm0(ptr, len) {
+    ptr = ptr >>> 0;
+    return decodeText(ptr, len);
+}
+
+let cachedUint8ArrayMemory0 = null;
+function getUint8ArrayMemory0() {
+    if (cachedUint8ArrayMemory0 === null || cachedUint8ArrayMemory0.byteLength === 0) {
+        cachedUint8ArrayMemory0 = new Uint8Array(wasm.memory.buffer);
+    }
+    return cachedUint8ArrayMemory0;
+}
+
+function handleError(f, args) {
+    try {
+        return f.apply(this, args);
+    } catch (e) {
+        const idx = addToExternrefTable0(e);
+        wasm.__wbindgen_exn_store(idx);
+    }
+}
+
+function isLikeNone(x) {
+    return x === undefined || x === null;
+}
+
+function passStringToWasm0(arg, malloc, realloc) {
+    if (realloc === undefined) {
+        const buf = cachedTextEncoder.encode(arg);
+        const ptr = malloc(buf.length, 1) >>> 0;
+        getUint8ArrayMemory0().subarray(ptr, ptr + buf.length).set(buf);
+        WASM_VECTOR_LEN = buf.length;
+        return ptr;
+    }
+
+    let len = arg.length;
+    let ptr = malloc(len, 1) >>> 0;
+
+    const mem = getUint8ArrayMemory0();
+
+    let offset = 0;
+
+    for (; offset < len; offset++) {
+        const code = arg.charCodeAt(offset);
+        if (code > 0x7F) break;
+        mem[ptr + offset] = code;
+    }
+    if (offset !== len) {
+        if (offset !== 0) {
+            arg = arg.slice(offset);
+        }
+        ptr = realloc(ptr, len, len = offset + arg.length * 3, 1) >>> 0;
+        const view = getUint8ArrayMemory0().subarray(ptr + offset, ptr + len);
+        const ret = cachedTextEncoder.encodeInto(arg, view);
+
+        offset += ret.written;
+        ptr = realloc(ptr, len, offset, 1) >>> 0;
+    }
+
+    WASM_VECTOR_LEN = offset;
+    return ptr;
+}
+
+function takeFromExternrefTable0(idx) {
+    const value = wasm.__wbindgen_externrefs.get(idx);
+    wasm.__externref_table_dealloc(idx);
+    return value;
+}
+
+let cachedTextDecoder = new TextDecoder('utf-8', { ignoreBOM: true, fatal: true });
+cachedTextDecoder.decode();
+const MAX_SAFARI_DECODE_BYTES = 2146435072;
+let numBytesDecoded = 0;
+function decodeText(ptr, len) {
+    numBytesDecoded += len;
+    if (numBytesDecoded >= MAX_SAFARI_DECODE_BYTES) {
+        cachedTextDecoder = new TextDecoder('utf-8', { ignoreBOM: true, fatal: true });
+        cachedTextDecoder.decode();
+        numBytesDecoded = len;
+    }
+    return cachedTextDecoder.decode(getUint8ArrayMemory0().subarray(ptr, ptr + len));
+}
+
+const cachedTextEncoder = new TextEncoder();
+
+if (!('encodeInto' in cachedTextEncoder)) {
+    cachedTextEncoder.encodeInto = function (arg, view) {
+        const buf = cachedTextEncoder.encode(arg);
+        view.set(buf);
+        return {
+            read: arg.length,
+            written: buf.length
+        };
+    };
+}
+
+let WASM_VECTOR_LEN = 0;
+
+
+let wasm;
+export function __wbg_set_wasm(val) {
+    wasm = val;
+}