@pascal-app/ifc-converter 1.0.0-beta.5 → 1.0.0

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026 Pascal Group Inc.
+
+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/dist/cleanup.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"cleanup.d.ts","sourceRoot":"","sources":["../src/cleanup.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,KAAK,OAAO,EAMb,MAAM,kBAAkB,CAAA;AAEzB,KAAK,UAAU,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;AAGzC,MAAM,MAAM,kCAAkC,GAAG;IAC/C,OAAO,CAAC,EAAE,OAAO,CAAA;IACjB,cAAc,CAAC,EAAE,MAAM,CAAA;CACxB,CAAA;AAED,MAAM,MAAM,gCAAgC,GAAG;IAC7C,KAAK,EAAE;QACL,KAAK,EAAE,MAAM,CAAA;QACb,KAAK,EAAE,MAAM,CAAA;QACb,OAAO,EAAE,MAAM,CAAA;KAChB,CAAA;IACD,MAAM,EAAE;QACN,KAAK,EAAE,MAAM,CAAA;QACb,KAAK,EAAE,MAAM,CAAA;QACb,OAAO,EAAE,MAAM,CAAA;KAChB,CAAA;IACD,gBAAgB,EAAE,MAAM,CAAA;IACxB,gBAAgB,EAAE,MAAM,CAAA;IACxB,kBAAkB,EAAE,MAAM,CAAA;IAC1B,wBAAwB,EAAE,MAAM,CAAA;CACjC,CAAA;AA6cD,wBAAgB,2BAA2B,CACzC,KAAK,EAAE,UAAU,EACjB,OAAO,GAAE,kCAAuC,GAC/C,gCAAgC,CAoBlC"}
+{"version":3,"file":"cleanup.d.ts","sourceRoot":"","sources":["../src/cleanup.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,KAAK,OAAO,EAMb,MAAM,kBAAkB,CAAA;AAEzB,KAAK,UAAU,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;AAGzC,MAAM,MAAM,kCAAkC,GAAG;IAC/C,OAAO,CAAC,EAAE,OAAO,CAAA;IACjB,cAAc,CAAC,EAAE,MAAM,CAAA;CACxB,CAAA;AAED,MAAM,MAAM,gCAAgC,GAAG;IAC7C,KAAK,EAAE;QACL,KAAK,EAAE,MAAM,CAAA;QACb,KAAK,EAAE,MAAM,CAAA;QACb,OAAO,EAAE,MAAM,CAAA;KAChB,CAAA;IACD,MAAM,EAAE;QACN,KAAK,EAAE,MAAM,CAAA;QACb,KAAK,EAAE,MAAM,CAAA;QACb,OAAO,EAAE,MAAM,CAAA;KAChB,CAAA;IACD,gBAAgB,EAAE,MAAM,CAAA;IACxB,gBAAgB,EAAE,MAAM,CAAA;IACxB,kBAAkB,EAAE,MAAM,CAAA;IAC1B,wBAAwB,EAAE,MAAM,CAAA;CACjC,CAAA;AAseD,wBAAgB,2BAA2B,CACzC,KAAK,EAAE,UAAU,EACjB,OAAO,GAAE,kCAAuC,GAC/C,gCAAgC,CAoBlC"}

package/dist/cleanup.js

@@ -142,11 +142,32 @@ function toWallSegment(wall) {
     };
 }
 function wallLineTolerance(a, b) {
-    return Math.max(0.06, Math.min(0.14, Math.max(a.thickness, b.thickness) * 0.5));
+    // Fragments must share essentially the same centerline. A tolerance based on
+    // half the wall thickness can collapse adjacent walls whose faces merely meet.
+    return Math.max(0.005, Math.min(0.025, Math.max(a.thickness, b.thickness) * 0.1));
 }
 function wallHeightCompatible(a, b) {
     return Math.abs(a.height - b.height) <= WALL_HEIGHT_TOLERANCE;
 }
+function wallMaterialSignature(segment) {
+    const metadata = segment.wall.metadata;
+    const material = typeof metadata?.material === 'string' ? metadata.material : null;
+    const layers = Array.isArray(metadata?.materialLayers)
+        ? metadata.materialLayers.map((layer) => {
+            const value = layer;
+            return [
+                typeof value.name === 'string' ? value.name : null,
+                typeof value.thickness === 'number' ? value.thickness : null,
+            ];
+        })
+        : [];
+    if (material === null && layers.length === 0)
+        return null;
+    return JSON.stringify({ material, layers });
+}
+function wallMaterialCompatible(a, b) {
+    return wallMaterialSignature(a) === wallMaterialSignature(b);
+}
 function wallIntervalsCompatible(a, b, maxJoinGap) {
     const gap = Math.max(a.t0, b.t0) - Math.min(a.t1, b.t1);
     if (gap <= maxJoinGap)
@@ -165,6 +186,8 @@ function wallsCanMerge(a, b, maxJoinGap) {
         return false;
     if (!wallHeightCompatible(a, b))
         return false;
+    if (!wallMaterialCompatible(a, b))
+        return false;
     return wallIntervalsCompatible(a, b, maxJoinGap);
 }
 function find(parent, index) {

package/dist/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,KAAK,OAAO,EACZ,KAAK,SAAS,EAaf,MAAM,kBAAkB,CAAA;AAGzB,OAAO,EAAE,KAAK,kCAAkC,EAA+B,MAAM,WAAW,CAAA;AAEhG,YAAY,EACV,kCAAkC,EAClC,gCAAgC,GACjC,MAAM,WAAW,CAAA;AAElB,MAAM,MAAM,UAAU,GAAG,OAAO,CAAA;AAEhC,MAAM,WAAW,gBAAgB;IAC/B,KAAK,EAAE,MAAM,CAAC,SAAS,EAAE,OAAO,CAAC,CAAA;IACjC,WAAW,EAAE,SAAS,EAAE,CAAA;IACxB,WAAW,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;CACtC;AAimBD,MAAM,WAAW,iBAAiB;IAChC,MAAM,CAAC,EAAE,OAAO,CAAA;IAChB,sBAAsB,CAAC,EAAE,OAAO,CAAA;IAChC,qBAAqB,CAAC,EAAE,OAAO,CAAA;IAC/B,QAAQ,CAAC,EAAE,OAAO,GAAG,kCAAkC,CAAA;IACvD,KAAK,CAAC,EAAE,MAAM,CAAA;CACf;AAED,eAAO,MAAM,eAAe,EAAE,MAAM,CAAC,MAAM,EAAE,iBAAiB,CAa7D,CAAA;AAED,wBAAsB,kBAAkB,CACtC,OAAO,EAAE,UAAU,EACnB,UAAU,CAAC,EAAE,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,KAAK,IAAI,EACvD,OAAO,CAAC,EAAE,iBAAiB,GAC1B,OAAO,CAAC,gBAAgB,CAAC,CA05C3B"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,KAAK,OAAO,EACZ,KAAK,SAAS,EAaf,MAAM,kBAAkB,CAAA;AAGzB,OAAO,EAAE,KAAK,kCAAkC,EAA+B,MAAM,WAAW,CAAA;AAEhG,YAAY,EACV,kCAAkC,EAClC,gCAAgC,GACjC,MAAM,WAAW,CAAA;AAElB,MAAM,MAAM,UAAU,GAAG,OAAO,CAAA;AAEhC,MAAM,WAAW,gBAAgB;IAC/B,KAAK,EAAE,MAAM,CAAC,SAAS,EAAE,OAAO,CAAC,CAAA;IACjC,WAAW,EAAE,SAAS,EAAE,CAAA;IACxB,WAAW,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;CACtC;AAimBD,MAAM,WAAW,iBAAiB;IAChC,MAAM,CAAC,EAAE,OAAO,CAAA;IAChB,sBAAsB,CAAC,EAAE,OAAO,CAAA;IAChC,qBAAqB,CAAC,EAAE,OAAO,CAAA;IAC/B,QAAQ,CAAC,EAAE,OAAO,GAAG,kCAAkC,CAAA;IACvD,KAAK,CAAC,EAAE,MAAM,CAAA;CACf;AAED,eAAO,MAAM,eAAe,EAAE,MAAM,CAAC,MAAM,EAAE,iBAAiB,CAa7D,CAAA;AAED,wBAAsB,kBAAkB,CACtC,OAAO,EAAE,UAAU,EACnB,UAAU,CAAC,EAAE,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,KAAK,IAAI,EACvD,OAAO,CAAC,EAAE,iBAAiB,GAC1B,OAAO,CAAC,gBAAgB,CAAC,CA65C3B"}

package/dist/index.js

@@ -5,11 +5,10 @@ import { simplifyConvertedSceneGraph } from './cleanup';
 function meta(node) {
     return (node?.metadata ?? {});
 }
-// Pascal's `BaseNode.metadata` is `z.json()` — a recursive JSON value
-// type that doesn't accept `undefined` (JSON has `null`, not undefined).
-// The converter pulls many fields from optional IFC properties that
-// often return `undefined`; stripping them at the boundary keeps the
-// schemas happy without spraying `?? null` through every assignment.
+// The converter pulls many metadata fields from optional IFC properties
+// that often return `undefined`. Those keys vanish the moment the graph is
+// serialized, so stripping them here keeps the in-memory scene identical to
+// the persisted one instead of spraying `?? null` through every assignment.
 function buildMetadata(input) {
     const out = {};
     for (const [key, value] of Object.entries(input)) {
@@ -621,9 +620,10 @@ export async function convertIfcToPascal(ifcData, onProgress, options) {
                 parentMap.set(childID, parentExpressID);
             });
             if (!childrenMap.has(parentExpressID)) {
-                childrenMap.set(parentExpressID, []);
+                childrenMap.set(parentExpressID, new Set());
             }
-            childrenMap.get(parentExpressID)?.push(...children);
+            for (const childID of children)
+                childrenMap.get(parentExpressID).add(childID);
         }
     }
     // Second pass: collect spatial containment
@@ -638,9 +638,10 @@ export async function convertIfcToPascal(ifcData, onProgress, options) {
                 parentMap.set(childID, parentExpressID);
             });
             if (!childrenMap.has(parentExpressID)) {
-                childrenMap.set(parentExpressID, []);
+                childrenMap.set(parentExpressID, new Set());
             }
-            childrenMap.get(parentExpressID)?.push(...children);
+            for (const childID of children)
+                childrenMap.get(parentExpressID).add(childID);
         }
     }
     // Resolve containing storey for an element by walking the parent chain
@@ -973,6 +974,10 @@ export async function convertIfcToPascal(ifcData, onProgress, options) {
             const fillId = openingToFill.get(openingId);
             if (!fillId)
                 continue;
+            // IFC fills belong to at most one opening, which voids one host element.
+            // Repeated or conflicting relationships must not emit another node.
+            if (expressIdToNodeId.has(fillId))
+                continue;
             const isDoor = doorExpressIds.has(fillId);
             const isWindow = windowExpressIds.has(fillId);
             if (!isDoor && !isWindow)
@@ -1035,7 +1040,6 @@ export async function convertIfcToPascal(ifcData, onProgress, options) {
                 }
                 if (isDoor) {
                     const nodeId = generateId('door');
-                    expressIdToNodeId.set(fillId, nodeId);
                     // Vertical centering is now handled: door center Y = height/2 so the
                     // opening sits at the correct position. Remaining caveat: door bottom
                     // is assumed at floor y=0 (i.e. the door starts at the wall's base).
@@ -1059,11 +1063,11 @@ export async function convertIfcToPascal(ifcData, onProgress, options) {
                         }),
                     });
                     nodes[nodeId] = doorNode;
+                    expressIdToNodeId.set(fillId, nodeId);
                     wallNode.children.push(nodeId);
                 }
                 else {
                     const nodeId = generateId('window');
-                    expressIdToNodeId.set(fillId, nodeId);
                     // TODO(ifc-fix): same scalar-vs-tuple position issue as door above.
                     // sillHeight stays read-only metadata until we resolve the window
                     // schema (Pascal's WindowNode doesn't have sillHeight today —
@@ -1092,6 +1096,7 @@ export async function convertIfcToPascal(ifcData, onProgress, options) {
                         }),
                     });
                     nodes[nodeId] = windowNode;
+                    expressIdToNodeId.set(fillId, nodeId);
                     wallNode.children.push(nodeId);
                 }
             }
@@ -1209,7 +1214,6 @@ export async function convertIfcToPascal(ifcData, onProgress, options) {
             if (isDoor) {
                 const h = height ?? 2.1;
                 const nodeId = generateId('door');
-                expressIdToNodeId.set(fillId, nodeId);
                 const doorNode = tryParse(DoorNode, 'door', {
                     object: 'node',
                     id: nodeId,
@@ -1230,6 +1234,7 @@ export async function convertIfcToPascal(ifcData, onProgress, options) {
                     }),
                 });
                 nodes[nodeId] = doorNode;
+                expressIdToNodeId.set(fillId, nodeId);
                 if (parentNodeId && nodes[parentNodeId]) {
                     ;
                     nodes[parentNodeId].children?.push(nodeId);
@@ -1239,7 +1244,6 @@ export async function convertIfcToPascal(ifcData, onProgress, options) {
                 const h = height ?? 1.2;
                 const sill = hosted && scene ? Math.max(0, scene[2] - hosted.info.baseY) : 0;
                 const nodeId = generateId('window');
-                expressIdToNodeId.set(fillId, nodeId);
                 const windowNode = tryParse(WindowNode, 'window', {
                     object: 'node',
                     id: nodeId,
@@ -1259,6 +1263,7 @@ export async function convertIfcToPascal(ifcData, onProgress, options) {
                     }),
                 });
                 nodes[nodeId] = windowNode;
+                expressIdToNodeId.set(fillId, nodeId);
                 if (parentNodeId && nodes[parentNodeId]) {
                     ;
                     nodes[parentNodeId].children?.push(nodeId);

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "@pascal-app/ifc-converter",
-  "version": "1.0.0-beta.5",
-  "description": "IFC → Pascal scene-graph conversion. Pure logic — no DOM, no React.",
+  "version": "1.0.0",
+  "description": "IFC \u2192 Pascal scene-graph conversion. Pure logic \u2014 no DOM, no React.",
   "type": "module",
   "main": "./dist/index.js",
   "types": "./dist/index.d.ts",
@@ -23,7 +23,7 @@
     "prepublishOnly": "npm run build"
   },
   "dependencies": {
-    "@pascal-app/core": "*",
+    "@pascal-app/core": "^1.0.0",
     "nanoid": "^5.1.6",
     "web-ifc": "^0.0.77"
   },