AutoMovie API
    Preparing search index...

    Function RecoveryChartReachableBox

    • Bound one declared affine row over a common independent-coefficient box. Duplicate original IDs first combine in input order using binary64 addition. The resulting floating-point coefficients, constants, bounds and target are then interpreted as exact dyadic numbers. Endpoint arithmetic and the strict squared-distance comparison against tolerance are exact for that row.

      Returned endpoints round outward. minimumDistanceMm is an approximate number view; only infeasibleAtTolerance uses the exact comparison. A false decision does not establish that several observations can be fitted simultaneously. Row identities do not identify source vertices, and this box is not generated geometry, continuous source support or a closest-surface distance certificate. Nonfinite input, conflicting bounds, invalid IDs, exhausted raw term budgets, nonfinite duplicate sums or nonrepresentable number views throw atomically.

      Parameters

      • input: {
            constantMm: readonly [number, number, number];
            lowerMm: readonly [number, number, number];
            maxTerms: number;
            targetMm: readonly [number, number, number];
            terms: readonly { id: number; weight: number }[];
            toleranceMm: number;
            upperMm: readonly [number, number, number];
        }
        • constantMm: readonly [number, number, number]

          Constant part of the substituted position row, millimetres.

        • lowerMm: readonly [number, number, number]

          Common independent-control lower bounds, millimetres.

        • maxTerms: number

          Positive safe cap on supplied terms, including repeated and canceled addresses.

        • targetMm: readonly [number, number, number]

          One private positional observation, millimetres; it need not be inside the box.

        • terms: readonly { id: number; weight: number }[]

          Original independent IDs and dimensionless weights; repeated IDs combine in input order.

        • toleranceMm: number

          Positive millimetre tolerance; exact equality is not infeasible.

        • upperMm: readonly [number, number, number]

          Common independent-control upper bounds, millimetres.

      Returns {
          absoluteWeightSum: number;
          diagnostic: string;
          infeasibleAtTolerance: boolean;
          lowerMm: [number, number, number];
          minimumDistanceMm: number;
          terms: number;
          upperMm: [number, number, number];
          weightSum: number;
      }

      • absoluteWeightSum: number

        Binary64 sum of absolute combined weights, in first-address order.

      • diagnostic: string

        Predicate scope and diagnostic precision qualification.

      • infeasibleAtTolerance: boolean

        Exact strict distance-squared comparison for the combined binary64 row.

      • lowerMm: [number, number, number]

        Outward-rounded lower endpoints, millimetres.

      • minimumDistanceMm: number

        Approximate distance to the exact row image, millimetres.

      • terms: number

        Unique original addresses, including exact-zero cancellations.

      • upperMm: [number, number, number]

        Outward-rounded upper endpoints, millimetres.

      • weightSum: number

        Binary64 sum of combined weights, in first-address order.