@tscircuit/rectdiff 0.0.21 → 0.0.22

package/dist/index.js

@@ -749,11 +749,31 @@ function isPointInPolygon(p, polygon) {
 }
 
 // lib/solvers/RectDiffSeedingSolver/computeInverseRects.ts
+function simplifyPolygon(polygon, precision) {
+  const round = (v) => Math.round(v / precision) * precision;
+  const seen = /* @__PURE__ */ new Set();
+  const result = [];
+  for (const p of polygon) {
+    const rx = round(p.x);
+    const ry = round(p.y);
+    const key = `${rx},${ry}`;
+    if (!seen.has(key)) {
+      seen.add(key);
+      result.push({ x: rx, y: ry });
+    }
+  }
+  return result;
+}
 function computeInverseRects(bounds, polygon) {
   if (!polygon || polygon.length < 3) return [];
+  const MAX_POLYGON_POINTS = 100;
+  const workingPolygon = polygon.length > MAX_POLYGON_POINTS ? simplifyPolygon(
+    polygon,
+    Math.max(bounds.width, bounds.height) / MAX_POLYGON_POINTS
+  ) : polygon;
   const xs = /* @__PURE__ */ new Set([bounds.x, bounds.x + bounds.width]);
   const ys = /* @__PURE__ */ new Set([bounds.y, bounds.y + bounds.height]);
-  for (const p of polygon) {
+  for (const p of workingPolygon) {
     xs.add(p.x);
     ys.add(p.y);
   }
@@ -1113,34 +1133,38 @@ function expandRectFromSeed(params) {
       continue;
     }
     for (const b of blockers) if (overlaps(r, b)) continue STRATS;
+    const MIN_EXPANSION = 1e-6;
+    const MAX_ITERATIONS = 1e3;
     let improved = true;
-    while (improved) {
+    let iterations = 0;
+    while (improved && iterations < MAX_ITERATIONS) {
+      iterations++;
       improved = false;
       const commonParams = { bounds, blockers, maxAspect: maxAspectRatio };
       collectBlockers(searchStripRight({ rect: r, bounds }));
       const eR = maxExpandRight({ ...commonParams, r });
-      if (eR > 0) {
+      if (eR > MIN_EXPANSION) {
         r = { ...r, width: r.width + eR };
         collectBlockers(r);
         improved = true;
       }
       collectBlockers(searchStripDown({ rect: r, bounds }));
       const eD = maxExpandDown({ ...commonParams, r });
-      if (eD > 0) {
+      if (eD > MIN_EXPANSION) {
         r = { ...r, height: r.height + eD };
         collectBlockers(r);
         improved = true;
       }
       collectBlockers(searchStripLeft({ rect: r, bounds }));
       const eL = maxExpandLeft({ ...commonParams, r });
-      if (eL > 0) {
+      if (eL > MIN_EXPANSION) {
         r = { x: r.x - eL, y: r.y, width: r.width + eL, height: r.height };
         collectBlockers(r);
         improved = true;
       }
       collectBlockers(searchStripUp({ rect: r, bounds }));
       const eU = maxExpandUp({ ...commonParams, r });
-      if (eU > 0) {
+      if (eU > MIN_EXPANSION) {
         r = { x: r.x, y: r.y - eU, width: r.width, height: r.height + eU };
         collectBlockers(r);
         improved = true;

package/lib/solvers/RectDiffSeedingSolver/computeInverseRects.ts

@@ -6,6 +6,31 @@ import {
 } from "../../utils/rectdiff-geometry"
 import { isPointInPolygon } from "./isPointInPolygon"
 
+/**
+ * Simplify a polygon by reducing coordinate precision to avoid excessive grid cells.
+ * This rounds coordinates to a grid and removes duplicates.
+ */
+function simplifyPolygon(
+  polygon: Array<{ x: number; y: number }>,
+  precision: number,
+): Array<{ x: number; y: number }> {
+  const round = (v: number) => Math.round(v / precision) * precision
+  const seen = new Set<string>()
+  const result: Array<{ x: number; y: number }> = []
+
+  for (const p of polygon) {
+    const rx = round(p.x)
+    const ry = round(p.y)
+    const key = `${rx},${ry}`
+    if (!seen.has(key)) {
+      seen.add(key)
+      result.push({ x: rx, y: ry })
+    }
+  }
+
+  return result
+}
+
 /**
  * Decompose the empty space inside 'bounds' but outside 'polygon' into rectangles.
  * This uses a coordinate grid approach, ideal for rectilinear polygons.
@@ -16,10 +41,21 @@ export function computeInverseRects(
 ): XYRect[] {
   if (!polygon || polygon.length < 3) return []
 
+  // Simplify polygon if it has too many points to avoid O(n^2) performance issues
+  // A polygon with 350+ points (like rounded corners) creates too many grid cells
+  const MAX_POLYGON_POINTS = 100
+  const workingPolygon =
+    polygon.length > MAX_POLYGON_POINTS
+      ? simplifyPolygon(
+          polygon,
+          Math.max(bounds.width, bounds.height) / MAX_POLYGON_POINTS,
+        )
+      : polygon
+
   // 1. Collect unique sorted X and Y coordinates
   const xs = new Set<number>([bounds.x, bounds.x + bounds.width])
   const ys = new Set<number>([bounds.y, bounds.y + bounds.height])
-  for (const p of polygon) {
+  for (const p of workingPolygon) {
     xs.add(p.x)
     ys.add(p.y)
   }

package/lib/utils/expandRectFromSeed.ts

@@ -286,14 +286,20 @@ export function expandRectFromSeed(params: {
     for (const b of blockers) if (overlaps(r, b)) continue STRATS
 
     // greedy expansions in 4 directions
+    // Use a minimum expansion threshold to avoid infinitesimal improvements
+    // that can occur with mixed-precision floating point coordinates
+    const MIN_EXPANSION = 1e-6
+    const MAX_ITERATIONS = 1000
     let improved = true
-    while (improved) {
+    let iterations = 0
+    while (improved && iterations < MAX_ITERATIONS) {
+      iterations++
       improved = false
       const commonParams = { bounds, blockers, maxAspect: maxAspectRatio }
 
       collectBlockers(searchStripRight({ rect: r, bounds }))
       const eR = maxExpandRight({ ...commonParams, r })
-      if (eR > 0) {
+      if (eR > MIN_EXPANSION) {
         r = { ...r, width: r.width + eR }
         collectBlockers(r)
         improved = true
@@ -301,7 +307,7 @@ export function expandRectFromSeed(params: {
 
       collectBlockers(searchStripDown({ rect: r, bounds }))
       const eD = maxExpandDown({ ...commonParams, r })
-      if (eD > 0) {
+      if (eD > MIN_EXPANSION) {
         r = { ...r, height: r.height + eD }
         collectBlockers(r)
         improved = true
@@ -309,7 +315,7 @@ export function expandRectFromSeed(params: {
 
       collectBlockers(searchStripLeft({ rect: r, bounds }))
       const eL = maxExpandLeft({ ...commonParams, r })
-      if (eL > 0) {
+      if (eL > MIN_EXPANSION) {
         r = { x: r.x - eL, y: r.y, width: r.width + eL, height: r.height }
         collectBlockers(r)
         improved = true
@@ -317,7 +323,7 @@ export function expandRectFromSeed(params: {
 
       collectBlockers(searchStripUp({ rect: r, bounds }))
       const eU = maxExpandUp({ ...commonParams, r })
-      if (eU > 0) {
+      if (eU > MIN_EXPANSION) {
         r = { x: r.x, y: r.y - eU, width: r.width, height: r.height + eU }
         collectBlockers(r)
         improved = true

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@tscircuit/rectdiff",
-  "version": "0.0.21",
+  "version": "0.0.22",
   "type": "module",
   "main": "dist/index.js",
   "scripts": {