@thi.ng/geom-voronoi 2.2.57 → 2.3.0

package/CHANGELOG.md

@@ -1,6 +1,6 @@
 # Change Log
 
-- **Last updated**: 2023-04-08T11:09:50Z
+- **Last updated**: 2023-04-25T15:38:18Z
 - **Generator**: [thi.ng/monopub](https://thi.ng/monopub)
 
 All notable changes to this project will be documented in this file.
@@ -9,6 +9,12 @@ See [Conventional Commits](https://conventionalcommits.org/) for commit guidelin
 **Note:** Unlisted _patch_ versions only involve non-code or otherwise excluded changes
 and/or version bumps of transitive dependencies.
 
+## [2.3.0](https://github.com/thi-ng/umbrella/tree/@thi.ng/geom-voronoi@2.3.0) (2023-04-25)
+
+#### 🚀 Features
+
+- add delaunayQE/voronoiQE() methods ([c709053](https://github.com/thi-ng/umbrella/commit/c709053))
+
 ### [2.2.55](https://github.com/thi-ng/umbrella/tree/@thi.ng/geom-voronoi@2.2.55) (2023-03-27)
 
 #### ♻️ Refactoring

package/index.d.ts

@@ -44,7 +44,29 @@ export declare class DVMesh<T> {
      */
     computeDual(): void;
     delaunay(bounds?: ReadonlyVec[]): Vec[][];
+    /**
+     * Advanced use only. Returns Delaunay triangles as arrays of raw
+     * [thi.ng/quad-edge
+     * Edges](https://docs.thi.ng/umbrella/quad-edge/classes/Edge.html).
+     *
+     * @remarks
+     * The actual vertex position associated with each edge can be obtained via
+     * `e.origin.pos`. Each edge (and each associated {@link Vertex}) also has a
+     * unique ID, accessible via `e.id` and `e.origin.id`.
+     */
+    delaunayQE(): Edge<Vertex<T>>[][];
     voronoi(bounds?: ReadonlyVec[]): Vec[][];
+    /**
+     * Advanced use only. Returns Voronoi cells as arrays of raw
+     * [thi.ng/quad-edge
+     * Edges](https://docs.thi.ng/umbrella/quad-edge/classes/Edge.html).
+     *
+     * @remarks
+     * The actual vertex position associated with each edge can be obtained via
+     * `e.origin.pos`. Each edge (and each associated {@link Vertex}) also has a
+     * unique ID, accessible via `e.id` and `e.origin.id`.
+     */
+    voronoiQE(): Edge<Vertex<T>>[][];
     edges(voronoi?: boolean, boundsMinMax?: VecPair): VecPair[];
     traverse(proc: Visitor<T>, edges?: boolean, e?: Edge<Vertex<T>>): void;
 }

package/index.js

@@ -190,6 +190,31 @@ export class DVMesh {
         });
         return cells;
     }
+    /**
+     * Advanced use only. Returns Delaunay triangles as arrays of raw
+     * [thi.ng/quad-edge
+     * Edges](https://docs.thi.ng/umbrella/quad-edge/classes/Edge.html).
+     *
+     * @remarks
+     * The actual vertex position associated with each edge can be obtained via
+     * `e.origin.pos`. Each edge (and each associated {@link Vertex}) also has a
+     * unique ID, accessible via `e.id` and `e.origin.id`.
+     */
+    delaunayQE() {
+        const cells = [];
+        const usedEdges = defBitField(this.nextEID);
+        this.traverse((eab) => {
+            if (!usedEdges.at(eab.id)) {
+                const ebc = eab.lnext;
+                const eca = ebc.lnext;
+                cells.push([eab, ebc, eca]);
+                usedEdges.setAt(eab.id);
+                usedEdges.setAt(ebc.id);
+                usedEdges.setAt(eca.id);
+            }
+        });
+        return cells;
+    }
     voronoi(bounds) {
         const cells = [];
         const bc = bounds && centroid(bounds);
@@ -222,6 +247,28 @@ export class DVMesh {
             }, false);
         return cells;
     }
+    /**
+     * Advanced use only. Returns Voronoi cells as arrays of raw
+     * [thi.ng/quad-edge
+     * Edges](https://docs.thi.ng/umbrella/quad-edge/classes/Edge.html).
+     *
+     * @remarks
+     * The actual vertex position associated with each edge can be obtained via
+     * `e.origin.pos`. Each edge (and each associated {@link Vertex}) also has a
+     * unique ID, accessible via `e.id` and `e.origin.id`.
+     */
+    voronoiQE() {
+        const cells = [];
+        this.traverse((e) => {
+            const first = (e = e.rot);
+            const cell = [];
+            do {
+                cell.push(e);
+            } while ((e = e.lnext) !== first);
+            cells.push(cell);
+        }, false);
+        return cells;
+    }
     edges(voronoi = false, boundsMinMax) {
         const edges = [];
         this.traverse((e, visitedEdges) => {

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@thi.ng/geom-voronoi",
-  "version": "2.2.57",
+  "version": "2.3.0",
   "description": "Fast, incremental 2D Delaunay & Voronoi mesh implementation",
   "type": "module",
   "module": "./index.js",
@@ -37,13 +37,13 @@
     "@thi.ng/api": "^8.8.0",
     "@thi.ng/bitfield": "^2.2.27",
     "@thi.ng/checks": "^3.3.12",
-    "@thi.ng/geom-clip-line": "^2.3.14",
-    "@thi.ng/geom-clip-poly": "^2.1.56",
-    "@thi.ng/geom-isec": "^2.1.56",
-    "@thi.ng/geom-poly-utils": "^2.3.40",
-    "@thi.ng/math": "^5.4.8",
+    "@thi.ng/geom-clip-line": "^2.3.15",
+    "@thi.ng/geom-clip-poly": "^2.1.57",
+    "@thi.ng/geom-isec": "^2.1.57",
+    "@thi.ng/geom-poly-utils": "^2.3.41",
+    "@thi.ng/math": "^5.4.9",
     "@thi.ng/quad-edge": "^3.1.27",
-    "@thi.ng/vectors": "^7.6.12"
+    "@thi.ng/vectors": "^7.6.13"
   },
   "devDependencies": {
     "@microsoft/api-extractor": "^7.34.4",
@@ -91,5 +91,5 @@
     ],
     "year": 2016
   },
-  "gitHead": "3a56bc490f1e68754762a503d06327b5b34ff7eb\n"
+  "gitHead": "ca22f02a137c0a4e3a38ef81e82e2bc7e3c43849\n"
 }