@pascal-app/core 0.9.1 → 1.0.0-beta.1

package/dist/systems/slab/slab-support.js

@@ -0,0 +1,557 @@
+import { getRenderableSlabPolygon } from '../../lib/slab-polygon';
+import { getWallCurveFrameAt, isCurvedWall } from '../wall/wall-curve';
+import { DEFAULT_WALL_THICKNESS } from '../wall/wall-footprint';
+import { MIN_WALL_HEIGHT } from '../wall/wall-top';
+/**
+ * Clamp-never-ask upper bound for a slab's elevation. A plane-bound wall
+ * (no stored `height`) keeps its top at the storey plane, so a slab that
+ * rises past `storeyHeight - MIN_WALL_HEIGHT` while electing as that
+ * wall's base would squeeze the wall body below its minimum (and at the
+ * plane, to nothing). Walls with explicit heights don't constrain — their
+ * top rides the elected base, not the plane. Negative proposals (the
+ * drag-through-zero path that commits the `recessed` intent) pass
+ * through untouched: this is a purely numeric upper bound.
+ *
+ * The election runs against `levelSlabs` with `proposedElevation`
+ * substituted into `slab`, so a slab that would only WIN the election at
+ * the proposed elevation still clamps, and a slab out-elected by a
+ * sibling doesn't. Pure.
+ */
+export function clampSlabElevationForWalls(proposedElevation, slab, levelWalls, levelSlabs, storeyHeight) {
+    const bound = storeyHeight - MIN_WALL_HEIGHT;
+    if (proposedElevation <= bound)
+        return { elevation: proposedElevation, clamped: false };
+    if (slab.polygon.length < 3)
+        return { elevation: proposedElevation, clamped: false };
+    const substituted = levelSlabs.some((candidate) => candidate.id === slab.id)
+        ? levelSlabs.map((candidate) => candidate.id === slab.id ? { ...candidate, elevation: proposedElevation } : candidate)
+        : [...levelSlabs, { ...slab, elevation: proposedElevation }];
+    for (const wall of levelWalls) {
+        if (wall.height != null)
+            continue;
+        const wallLike = {
+            start: wall.start,
+            end: wall.end,
+            curveOffset: wall.curveOffset,
+            thickness: wall.thickness,
+        };
+        // Cheap pre-filter: a wall that never reaches the slab's footprint
+        // can't elect it, whatever the election says about sibling slabs.
+        if (!wallOverlapsPolygon(wallLike, slab.polygon))
+            continue;
+        const support = computeWallSlabSupport(wallLike, substituted, levelWalls);
+        if (Math.abs(support.elevation - proposedElevation) <= WALL_SLAB_ELEVATION_POOL_EPSILON) {
+            return { elevation: bound, clamped: true };
+        }
+    }
+    return { elevation: proposedElevation, clamped: false };
+}
+/**
+ * Static upper bound for a slab-elevation drag: probe the election with
+ * the slab raised above every sibling and the storey plane. If any
+ * plane-bound wall would elect it there, the drag may not pass
+ * `storeyHeight - MIN_WALL_HEIGHT`; otherwise it is unbounded above.
+ */
+export function getSlabElevationUpperBound(slab, levelWalls, levelSlabs, storeyHeight) {
+    const probe = Math.max(storeyHeight, ...levelSlabs.map((candidate) => candidate.elevation ?? 0.05)) + 1;
+    return clampSlabElevationForWalls(probe, slab, levelWalls, levelSlabs, storeyHeight).clamped
+        ? storeyHeight - MIN_WALL_HEIGHT
+        : Number.POSITIVE_INFINITY;
+}
+/**
+ * Point-in-polygon test using ray casting algorithm.
+ */
+export function pointInPolygon(px, pz, polygon) {
+    let inside = false;
+    const n = polygon.length;
+    for (let i = 0, j = n - 1; i < n; j = i++) {
+        const xi = polygon[i][0], zi = polygon[i][1];
+        const xj = polygon[j][0], zj = polygon[j][1];
+        if (zi > pz !== zj > pz && px < ((xj - xi) * (pz - zi)) / (zj - zi) + xi) {
+            inside = !inside;
+        }
+    }
+    return inside;
+}
+function pointSegmentDistance(px, pz, ax, az, bx, bz) {
+    const dx = bx - ax;
+    const dz = bz - az;
+    const lengthSquared = dx * dx + dz * dz;
+    if (lengthSquared < 1e-18)
+        return Math.hypot(px - ax, pz - az);
+    const t = Math.max(0, Math.min(1, ((px - ax) * dx + (pz - az) * dz) / lengthSquared));
+    return Math.hypot(px - (ax + dx * t), pz - (az + dz * t));
+}
+// Ray-cast pointInPolygon is unreliable for points exactly on the polygon
+// boundary: the answer flips depending on which side of the polygon the edge
+// is on. Interval classification below therefore treats "within this distance
+// of the boundary" as inside explicitly, so walls sitting exactly on a slab
+// edge (the common case — auto-slab polygons derive from wall centerlines)
+// classify identically on every side of the slab.
+const ON_BOUNDARY_EPSILON = 1e-4;
+export function pointOnPolygonBoundary(px, pz, polygon) {
+    const n = polygon.length;
+    for (let i = 0; i < n; i++) {
+        const [ax, az] = polygon[i];
+        const [bx, bz] = polygon[(i + 1) % n];
+        if (pointSegmentDistance(px, pz, ax, az, bx, bz) <= ON_BOUNDARY_EPSILON)
+            return true;
+    }
+    return false;
+}
+function mergeIntervals(intervals) {
+    if (intervals.length <= 1)
+        return intervals;
+    const sorted = [...intervals].sort((a, b) => a[0] - b[0]);
+    const merged = [[sorted[0][0], sorted[0][1]]];
+    for (let i = 1; i < sorted.length; i++) {
+        const [intervalStart, intervalEnd] = sorted[i];
+        const last = merged[merged.length - 1];
+        if (intervalStart <= last[1] + 1e-9) {
+            last[1] = Math.max(last[1], intervalEnd);
+        }
+        else {
+            merged.push([intervalStart, intervalEnd]);
+        }
+    }
+    return merged;
+}
+/** Total length of a merged (sorted, disjoint) interval list. */
+function intervalsLength(intervals) {
+    let total = 0;
+    for (const [intervalStart, intervalEnd] of intervals)
+        total += intervalEnd - intervalStart;
+    return total;
+}
+/** `base` minus `cut`. Both inputs may be unsorted; the result is merged. */
+function subtractIntervals(base, cut) {
+    if (base.length === 0 || cut.length === 0)
+        return mergeIntervals(base);
+    const cuts = mergeIntervals(cut);
+    const result = [];
+    for (const [baseStart, baseEnd] of mergeIntervals(base)) {
+        let cursor = baseStart;
+        for (const [cutStart, cutEnd] of cuts) {
+            if (cutEnd <= cursor)
+                continue;
+            if (cutStart >= baseEnd)
+                break;
+            if (cutStart > cursor)
+                result.push([cursor, cutStart]);
+            cursor = cutEnd;
+            if (cursor >= baseEnd)
+                break;
+        }
+        if (cursor < baseEnd)
+            result.push([cursor, baseEnd]);
+    }
+    return result;
+}
+/**
+ * Sub-intervals of segment (ax,az)→(bx,bz) that lie inside the polygon (and,
+ * when `includeBoundary`, on its boundary), as [t0, t1] fractions of the
+ * segment. The segment is split at every crossing with a polygon edge and
+ * each sub-interval is classified by its midpoint, so no test point ever
+ * sits on a crossing.
+ */
+function segmentInsideIntervals(ax, az, bx, bz, polygon, includeBoundary) {
+    const dx = bx - ax;
+    const dz = bz - az;
+    const length = Math.hypot(dx, dz);
+    if (length < 1e-9)
+        return [];
+    const ts = [0, 1];
+    const n = polygon.length;
+    for (let i = 0; i < n; i++) {
+        const [px, pz] = polygon[i];
+        const [qx, qz] = polygon[(i + 1) % n];
+        const ex = qx - px;
+        const ez = qz - pz;
+        const denom = dx * ez - dz * ex;
+        if (Math.abs(denom) < 1e-12)
+            continue; // parallel/collinear — nothing to split at
+        const t = ((px - ax) * ez - (pz - az) * ex) / denom;
+        const s = ((px - ax) * dz - (pz - az) * dx) / denom;
+        if (t > 0 && t < 1 && s >= -1e-9 && s <= 1 + 1e-9)
+            ts.push(t);
+    }
+    ts.sort((a, b) => a - b);
+    const inside = [];
+    for (let i = 1; i < ts.length; i++) {
+        const t0 = ts[i - 1];
+        const t1 = ts[i];
+        if (t1 - t0 < 1e-9)
+            continue;
+        const tm = (t0 + t1) / 2;
+        const mx = ax + dx * tm;
+        const mz = az + dz * tm;
+        const midpointInside = pointOnPolygonBoundary(mx, mz, polygon)
+            ? includeBoundary
+            : pointInPolygon(mx, mz, polygon);
+        if (midpointInside)
+            inside.push([t0, t1]);
+    }
+    return inside;
+}
+function polylineLength(points) {
+    let total = 0;
+    for (let i = 1; i < points.length; i++) {
+        total += Math.hypot(points[i].x - points[i - 1].x, points[i].y - points[i - 1].y);
+    }
+    return total;
+}
+/**
+ * Inside sub-intervals of a polyline against a polygon, in cumulative
+ * arc-length units from the polyline start (merged, disjoint). Boundary
+ * contact counts as inside for slab support (walls sit exactly on slab
+ * edges — see ON_BOUNDARY_EPSILON above); hole callers pass
+ * `includeBoundary: false` so a wall running along a stairwell hole's
+ * rim keeps the rim's support.
+ */
+function polylineInsideIntervals(points, polygon, includeBoundary = true) {
+    const intervals = [];
+    let offset = 0;
+    for (let i = 1; i < points.length; i++) {
+        const a = points[i - 1];
+        const b = points[i];
+        const segmentLength = Math.hypot(b.x - a.x, b.y - a.y);
+        if (segmentLength < 1e-9)
+            continue;
+        for (const [t0, t1] of segmentInsideIntervals(a.x, a.y, b.x, b.y, polygon, includeBoundary)) {
+            intervals.push([offset + t0 * segmentLength, offset + t1 * segmentLength]);
+        }
+        offset += segmentLength;
+    }
+    return mergeIntervals(intervals);
+}
+// Minimum length of wall that must lie on/inside a slab polygon before the
+// wall counts as overlapping it. Point contact (a perpendicular wall butting
+// into a room's edge) clips to ~zero length and never reaches this, so such
+// walls don't follow the slab's elevation.
+const WALL_SLAB_MIN_OVERLAP = 0.05;
+/**
+ * Centerline of the wall plus its two face lines (centerline offset by
+ * ±halfThickness). The face lines catch walls whose centerline sits on or
+ * just outside the slab boundary but whose body reaches onto the slab —
+ * e.g. slab polygons drawn to the room's interior faces.
+ */
+function wallTestPolylines(start, end, curveOffset, halfThickness) {
+    const wallLike = { start, end, curveOffset };
+    if (curveOffset !== 0 && isCurvedWall(wallLike)) {
+        const count = 16;
+        const center = [];
+        const left = [];
+        const right = [];
+        for (let i = 0; i <= count; i++) {
+            const frame = getWallCurveFrameAt(wallLike, i / count);
+            center.push(frame.point);
+            left.push({
+                x: frame.point.x + frame.normal.x * halfThickness,
+                y: frame.point.y + frame.normal.y * halfThickness,
+            });
+            right.push({
+                x: frame.point.x - frame.normal.x * halfThickness,
+                y: frame.point.y - frame.normal.y * halfThickness,
+            });
+        }
+        return halfThickness > 0 ? [center, left, right] : [center];
+    }
+    const center = [
+        { x: start[0], y: start[1] },
+        { x: end[0], y: end[1] },
+    ];
+    const dx = end[0] - start[0];
+    const dz = end[1] - start[1];
+    const len = Math.hypot(dx, dz);
+    if (len < 1e-10 || halfThickness <= 0)
+        return [center];
+    const nx = (-dz / len) * halfThickness;
+    const nz = (dx / len) * halfThickness;
+    return [
+        center,
+        [
+            { x: start[0] + nx, y: start[1] + nz },
+            { x: end[0] + nx, y: end[1] + nz },
+        ],
+        [
+            { x: start[0] - nx, y: start[1] - nz },
+            { x: end[0] - nx, y: end[1] - nz },
+        ],
+    ];
+}
+/**
+ * Test whether a wall overlaps a slab polygon along a segment of its length.
+ *
+ * The wall's centerline and both face lines are clipped against the polygon;
+ * the wall overlaps when the longest clipped inside-or-on-boundary length
+ * exceeds a threshold (5cm, halved for very short walls). Because interval
+ * midpoints classify "on the boundary" as inside explicitly (never by
+ * ray-cast tie-breaking), a wall sitting exactly on a slab edge resolves
+ * identically on every side of the slab.
+ *
+ * A wall that only touches the polygon at a point — a perpendicular wall
+ * butting into a room's edge, or a corner-to-corner touch — clips to ~zero
+ * length and does NOT overlap.
+ */
+export function wallOverlapsPolygon(startOrWall, endOrPolygon, polygonArg) {
+    // Two call shapes:
+    //   wallOverlapsPolygon(wallLike, polygon) — preferred; curve-aware
+    //   wallOverlapsPolygon(start, end, polygon) — legacy chord-only
+    let start;
+    let end;
+    let polygon;
+    let curveOffset = 0;
+    let thickness = DEFAULT_WALL_THICKNESS;
+    if (Array.isArray(startOrWall)) {
+        start = startOrWall;
+        end = endOrPolygon;
+        polygon = polygonArg;
+    }
+    else {
+        start = startOrWall.start;
+        end = startOrWall.end;
+        curveOffset = startOrWall.curveOffset ?? 0;
+        thickness = startOrWall.thickness ?? DEFAULT_WALL_THICKNESS;
+        polygon = endOrPolygon;
+    }
+    return wallOverlapsSlabFootprint({ start, end, curveOffset, thickness }, polygon);
+}
+/**
+ * {@link wallOverlapsPolygon} with the slab's stored holes subtracted from
+ * the covered length: a wall whose band only reaches the polygon inside a
+ * hole does not overlap. Hole boundaries keep coverage (rim convention —
+ * see {@link computeWallSlabSupport}). Polygon boundary contact counts as
+ * covered, so a wall sitting exactly on a slab edge resolves identically
+ * on every side of the slab. Pure.
+ */
+export function wallOverlapsSlabFootprint(wallLike, polygon, holes) {
+    const { start, end, curveOffset = 0, thickness = DEFAULT_WALL_THICKNESS } = wallLike;
+    const halfThickness = Math.max(thickness / 2, 0);
+    const polylines = wallTestPolylines(start, end, curveOffset, halfThickness);
+    const centerLength = polylineLength(polylines[0]);
+    if (centerLength < 1e-9)
+        return false;
+    let overlap = 0;
+    for (const line of polylines) {
+        let intervals = polylineInsideIntervals(line, polygon);
+        for (const hole of holes ?? []) {
+            if (intervals.length === 0)
+                break;
+            if (hole.length < 3)
+                continue;
+            intervals = subtractIntervals(intervals, polylineInsideIntervals(line, hole, false));
+        }
+        overlap = Math.max(overlap, intervalsLength(intervals));
+    }
+    const threshold = Math.max(1e-3, Math.min(WALL_SLAB_MIN_OVERLAP, centerLength * 0.5));
+    return overlap >= threshold;
+}
+/**
+ * Tolerance for the pointer-decided support cap: a slab still counts as
+ * "the surface you're pointing at (or below)" when its walking surface is
+ * within this many meters ABOVE the pointed elevation. Absorbs elevation
+ * noise between the ray hit and slab tops without letting a deck hanging
+ * clearly above the hit point capture the election. Defined here (rather
+ * than in the spatial-grid manager, which re-exports it) so the wall
+ * election below can honour the same cap without an import cycle.
+ */
+export const SUPPORT_ELEVATION_EPSILON = 0.05;
+// A slab elevation must support at least this fraction of the wall's
+// length before it can dictate the wall's base. Below majority, a raised
+// slab reaching one endpoint would hoist the whole wall off the floor
+// that actually carries it.
+const WALL_SLAB_SUPPORT_MAJORITY = 0.5;
+// Slabs whose elevations differ by less than this pool their support:
+// a wall shared between two rooms' slabs is covered roughly half by
+// each, and must still follow their common elevation.
+const WALL_SLAB_ELEVATION_POOL_EPSILON = 1e-4;
+/**
+ * `preferredSlabId` is a persisted support host (`wall.supportSlabId`):
+ * while that slab is still in the candidate set (still overlaps the wall
+ * band with enough covered length), the elected `elevation` is pinned to
+ * it instead of the majority/best-coverage election. `baseSegments` /
+ * `baseElevation` (fill-down) still derive from ALL supporting slabs
+ * unchanged. A preferred slab that no longer qualifies is silently
+ * ignored — deliberately never cleared here, so the host resumes if the
+ * slab's polygon returns (only slab deletion strips the stored field).
+ *
+ * `maxElevation` is the pointer-decided support cap (level-local Y, same
+ * semantics as the item election): when set, elevation groups whose
+ * walking surface sits above `maxElevation + SUPPORT_ELEVATION_EPSILON`
+ * are excluded from the majority/best election — a deck hanging above the
+ * surface the cursor ray actually hit never captures the elected base.
+ * `baseSegments` / `baseElevation` stay uncapped (geometry fill-down), and
+ * an explicit `preferredSlabId` still wins over the cap.
+ */
+export function computeWallSlabSupport(wallLike, slabs, levelWalls, preferredSlabId, maxElevation) {
+    const { start, end, curveOffset = 0, thickness = DEFAULT_WALL_THICKNESS } = wallLike;
+    const halfThickness = Math.max(thickness / 2, 0);
+    const polylines = wallTestPolylines(start, end, curveOffset, halfThickness);
+    const polylineLengths = polylines.map(polylineLength);
+    const wallLength = polylineLengths[0];
+    if (wallLength < 1e-9) {
+        return { elevation: 0, electedSlabId: null, baseElevation: 0, baseSegments: [] };
+    }
+    const minSupport = Math.max(1e-3, Math.min(WALL_SLAB_MIN_OVERLAP, wallLength * 0.5));
+    const groups = [];
+    let preferredElevation = null;
+    let preferredElectedSlabId = null;
+    for (const slab of slabs) {
+        if (slab.polygon.length < 3)
+            continue;
+        const renderedPolygon = getRenderableSlabPolygon(slab, {
+            walls: levelWalls,
+            siblingSlabs: slabs.filter((other) => other.id !== slab.id),
+        });
+        let supported = 0;
+        const perPolyline = polylines.map((line) => {
+            let intervals = polylineInsideIntervals(line, renderedPolygon);
+            for (const hole of slab.holes || []) {
+                if (intervals.length === 0)
+                    break;
+                if (hole.length < 3)
+                    continue;
+                intervals = subtractIntervals(intervals, polylineInsideIntervals(line, hole, false));
+            }
+            supported = Math.max(supported, intervalsLength(intervals));
+            return intervals;
+        });
+        if (supported < minSupport)
+            continue;
+        const elevation = slab.elevation ?? 0.05;
+        if (preferredSlabId != null && slab.id === preferredSlabId) {
+            preferredElevation = elevation;
+            preferredElectedSlabId = slab.id;
+        }
+        let group = groups.find((candidate) => Math.abs(candidate.elevation - elevation) <= WALL_SLAB_ELEVATION_POOL_EPSILON);
+        if (!group) {
+            group = { elevation, slabIds: [], perPolyline: polylines.map(() => []) };
+            groups.push(group);
+        }
+        group.slabIds.push(slab.id);
+        for (let i = 0; i < perPolyline.length; i++) {
+            group.perPolyline[i].push(...perPolyline[i]);
+        }
+    }
+    const evaluatedGroups = groups.map((group) => ({
+        ...group,
+        mergedPerPolyline: group.perPolyline.map(mergeIntervals),
+    }));
+    const normalizedIntervals = (group, polylineIndex) => {
+        const lineLength = polylineLengths[polylineIndex];
+        if (lineLength < 1e-9)
+            return [];
+        return group.mergedPerPolyline[polylineIndex].map(([intervalStart, intervalEnd]) => [intervalStart / lineLength, intervalEnd / lineLength]);
+    };
+    const normalizedByGroup = evaluatedGroups.map((group) => ({
+        elevation: group.elevation,
+        perPolyline: group.mergedPerPolyline.map((_, index) => normalizedIntervals(group, index)),
+    }));
+    const breakpoints = [0, 1];
+    for (const group of normalizedByGroup) {
+        for (const intervals of group.perPolyline) {
+            for (const [intervalStart, intervalEnd] of intervals) {
+                breakpoints.push(intervalStart, intervalEnd);
+            }
+        }
+    }
+    breakpoints.sort((left, right) => left - right);
+    const uniqueBreakpoints = breakpoints.filter((value, index) => index === 0 || value - breakpoints[index - 1] > 1e-7);
+    const highestAt = (groupList, polylineIndex, t) => {
+        let highest = Number.NEGATIVE_INFINITY;
+        for (const group of groupList) {
+            if (group.perPolyline[polylineIndex]?.some(([intervalStart, intervalEnd]) => t >= intervalStart - 1e-7 && t <= intervalEnd + 1e-7)) {
+                highest = Math.max(highest, group.elevation);
+            }
+        }
+        return highest;
+    };
+    // The pointer cap filters the ELECTION's carrying profile, not the base
+    // profile: with a deck capped away, the floor that also carries the wall
+    // must still win (geometry fill-down stays uncapped).
+    const electableNormalizedGroups = maxElevation == null
+        ? normalizedByGroup
+        : normalizedByGroup.filter((group) => group.elevation <= maxElevation + SUPPORT_ELEVATION_EPSILON);
+    const baseSegments = [];
+    const carryCandidates = [];
+    const accumulateCarry = (elevation, length) => {
+        let candidate = carryCandidates.find((existing) => Math.abs(existing.elevation - elevation) <= WALL_SLAB_ELEVATION_POOL_EPSILON);
+        if (!candidate) {
+            candidate = { elevation, length: 0 };
+            carryCandidates.push(candidate);
+        }
+        candidate.length += length;
+    };
+    for (let index = 1; index < uniqueBreakpoints.length; index++) {
+        const start = uniqueBreakpoints[index - 1];
+        const end = uniqueBreakpoints[index];
+        if (end - start < 1e-7)
+            continue;
+        const midpoint = (start + end) / 2;
+        const centerElevation = highestAt(normalizedByGroup, 0, midpoint);
+        const leftElevation = polylines.length >= 3 ? highestAt(normalizedByGroup, 1, midpoint) : Number.NEGATIVE_INFINITY;
+        const rightElevation = polylines.length >= 3 ? highestAt(normalizedByGroup, 2, midpoint) : Number.NEGATIVE_INFINITY;
+        const faceElevations = [leftElevation, rightElevation].filter(Number.isFinite);
+        const segmentElevation = faceElevations.length > 0 ? Math.min(...faceElevations) : Math.max(centerElevation, 0);
+        if (electableNormalizedGroups === normalizedByGroup) {
+            if (faceElevations.length > 0 || Number.isFinite(centerElevation)) {
+                accumulateCarry(segmentElevation, end - start);
+            }
+        }
+        else {
+            const electCenter = highestAt(electableNormalizedGroups, 0, midpoint);
+            const electLeft = polylines.length >= 3
+                ? highestAt(electableNormalizedGroups, 1, midpoint)
+                : Number.NEGATIVE_INFINITY;
+            const electRight = polylines.length >= 3
+                ? highestAt(electableNormalizedGroups, 2, midpoint)
+                : Number.NEGATIVE_INFINITY;
+            const electFaces = [electLeft, electRight].filter(Number.isFinite);
+            if (electFaces.length > 0 || Number.isFinite(electCenter)) {
+                accumulateCarry(electFaces.length > 0 ? Math.min(...electFaces) : Math.max(electCenter, 0), end - start);
+            }
+        }
+        const previous = baseSegments[baseSegments.length - 1];
+        if (previous &&
+            Math.abs(previous.elevation - segmentElevation) <= WALL_SLAB_ELEVATION_POOL_EPSILON) {
+            previous.end = end;
+        }
+        else {
+            baseSegments.push({ start, end, elevation: segmentElevation });
+        }
+    }
+    let majorityElevation = Number.NEGATIVE_INFINITY;
+    let bestElevation = Number.NEGATIVE_INFINITY;
+    let bestCoverage = -1;
+    for (const candidate of carryCandidates) {
+        if (candidate.length >= WALL_SLAB_SUPPORT_MAJORITY - 1e-6) {
+            majorityElevation = Math.max(majorityElevation, candidate.elevation);
+        }
+        if (candidate.length > bestCoverage + 1e-6 ||
+            (Math.abs(candidate.length - bestCoverage) <= 1e-6 && candidate.elevation > bestElevation)) {
+            bestCoverage = candidate.length;
+            bestElevation = candidate.elevation;
+        }
+    }
+    const elevation = preferredElevation !== null
+        ? preferredElevation
+        : majorityElevation !== Number.NEGATIVE_INFINITY
+            ? majorityElevation
+            : bestElevation === Number.NEGATIVE_INFINITY
+                ? 0
+                : bestElevation;
+    const electedSlabId = preferredElectedSlabId ??
+        evaluatedGroups
+            .filter((group) => maxElevation == null || group.elevation <= maxElevation + SUPPORT_ELEVATION_EPSILON)
+            .find((group) => Math.abs(group.elevation - elevation) <= WALL_SLAB_ELEVATION_POOL_EPSILON)
+            ?.slabIds.slice()
+            .sort()[0] ??
+        null;
+    if (baseSegments.length === 0)
+        baseSegments.push({ start: 0, end: 1, elevation });
+    const baseElevation = Math.min(...baseSegments.map((segment) => segment.elevation));
+    return { elevation, electedSlabId, baseElevation, baseSegments };
+}
+export function computeWallSlabElevation(wallLike, slabs, levelWalls) {
+    return computeWallSlabSupport(wallLike, slabs, levelWalls).elevation;
+}

package/dist/systems/stair/stair-footprint.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"stair-footprint.d.ts","sourceRoot":"","sources":["../../../src/systems/stair/stair-footprint.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,OAAO,EAAa,SAAS,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAA;AAEnF;;;;;;;;;GASG;AAEH,MAAM,MAAM,kBAAkB,GAAG;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,CAAA;AAE3F,KAAK,gBAAgB,GAAG;IACtB,QAAQ,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAA;IAClC,QAAQ,EAAE,MAAM,CAAA;CACjB,CAAA;AAED;;;;;GAKG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAI9E;AAED;;;;;GAKG;AACH,wBAAgB,wBAAwB,CAAC,QAAQ,EAAE,gBAAgB,EAAE,GAAG,gBAAgB,EAAE,CAkDzF;AA0GD;;;;;GAKG;AACH,wBAAgB,kBAAkB,CAChC,KAAK,EAAE,SAAS,EAChB,KAAK,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,GACxC,kBAAkB,GAAG,IAAI,CAK3B"}
+{"version":3,"file":"stair-footprint.d.ts","sourceRoot":"","sources":["../../../src/systems/stair/stair-footprint.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,OAAO,EAAa,SAAS,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAA;AAEnF;;;;;;;;;GASG;AAEH,MAAM,MAAM,kBAAkB,GAAG;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,CAAA;AAE3F,KAAK,gBAAgB,GAAG;IACtB,QAAQ,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAA;IAClC,QAAQ,EAAE,MAAM,CAAA;CACjB,CAAA;AAED;;;;;GAKG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAI9E;AAED;;;;;GAKG;AACH,wBAAgB,wBAAwB,CAAC,QAAQ,EAAE,gBAAgB,EAAE,GAAG,gBAAgB,EAAE,CAkDzF;AAwHD;;;;;GAKG;AACH,wBAAgB,kBAAkB,CAChC,KAAK,EAAE,SAAS,EAChB,KAAK,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,GACxC,kBAAkB,GAAG,IAAI,CAK3B"}

package/dist/systems/stair/stair-footprint.js

@@ -115,6 +115,15 @@ function straightStairAABB(stair, nodes) {
     return finiteBox(box);
 }
 const ARC_SAMPLES = 48;
+function getSpiralLandingSweep(stair, sweepAngle) {
+    if ((stair.topLandingMode ?? 'none') !== 'integrated')
+        return 0;
+    const innerRadius = Math.max(0.05, stair.innerRadius ?? 0.9);
+    const width = Math.max(stair.width ?? 1, 0.4);
+    const landingDepth = Math.max(0.3, stair.topLandingDepth ?? Math.max(width * 0.9, 0.8));
+    return (Math.min(Math.PI * 0.75, landingDepth / Math.max(innerRadius + width / 2, 0.1)) *
+        Math.sign(sweepAngle || 1));
+}
 /** Bounding box of a curved / spiral stair's annular sector (plus the
  *  integrated spiral top landing when present). */
 function arcStairAABB(stair) {
@@ -123,7 +132,8 @@ function arcStairAABB(stair) {
     const innerRadius = Math.max(minInnerRadius, stair.innerRadius ?? (isSpiral ? 0.2 : 0.9));
     const width = Math.max(stair.width ?? 1, 0.4);
     const outerRadius = innerRadius + width;
-    let sweep = stair.sweepAngle ?? (isSpiral ? Math.PI * 2 : Math.PI / 2);
+    const rawSweep = stair.sweepAngle ?? (isSpiral ? Math.PI * 2 : Math.PI / 2);
+    let sweep = rawSweep;
     // A full revolution would make the arc degenerate; clamp just under 2π the
     // same way the floor-plan emitter does so the sampled box stays correct.
     if (Math.abs(sweep) >= Math.PI * 2)
@@ -139,17 +149,17 @@ function arcStairAABB(stair) {
         extendByLocal(box, stair, cos * innerRadius, sin * innerRadius);
         extendByLocal(box, stair, cos * outerRadius, sin * outerRadius);
     }
-    // Integrated spiral top landing — a rectangle hung off the outer rim.
+    // Integrated spiral top landing renders as an angular extension of the
+    // annular stair body, not as a rectangular box outside the outer rim.
     if (isSpiral && stair.topLandingMode === 'integrated') {
-        const depth = Math.max(stair.topLandingDepth ?? 0.9, 0.1);
-        const halfWidth = width / 2;
-        for (const [cornerX, cornerZ] of [
-            [outerRadius, -halfWidth],
-            [outerRadius + depth, -halfWidth],
-            [outerRadius + depth, halfWidth],
-            [outerRadius, halfWidth],
-        ]) {
-            extendByLocal(box, stair, cornerX, cornerZ);
+        const landingSweep = getSpiralLandingSweep(stair, rawSweep);
+        const landingSteps = Math.max(1, Math.ceil(Math.abs(landingSweep) / (Math.PI / 24)));
+        for (let step = 0; step <= landingSteps; step += 1) {
+            const angle = rawSweep / 2 + (landingSweep * step) / landingSteps;
+            const cos = Math.cos(angle);
+            const sin = Math.sin(angle);
+            extendByLocal(box, stair, cos * innerRadius, sin * innerRadius);
+            extendByLocal(box, stair, cos * outerRadius, sin * outerRadius);
         }
     }
     return finiteBox(box);