AutoMovie API
    Preparing search index...

    Interface IAutoMovieSoftBodyBudget

    The bounded cost a soft-body domain adds to a shot, for the builder report.

    Every field is derived from the domain record alone, so a production can be refused for an unaffordable panel before a single step is integrated.

    interface IAutoMovieSoftBodyBudget {
        bend: number;
        colliders: number;
        domain: string;
        maxSteps: number;
        particles: number;
        shear: number;
        stateBytes: number;
        structural: number;
        travel: number;
        triangles: number;
        worstCaseGathers: number;
        worstCaseSelfContactPairs?: number;
    }
    Index
    bend: number

    Second-neighbour distance constraints.

    colliders: number

    Declared colliders.

    domain: string

    Identity of the measured domain.

    maxSteps: number

    Highest absolute step a sample may integrate to.

    particles: number

    Lattice particles, columns * rows.

    The derived surface carries one vertex per particle, so this is also the drawn vertex count a render budget attributes device memory to.

    shear: number

    Diagonal distance constraints.

    stateBytes: number

    Raw position and velocity bytes as 64-bit reals: 8 * 6 * particles; excludes allocation overhead and working buffers.

    structural: number

    Row and column distance constraints.

    travel: number

    Authored travel estimate dt · referenceSpeed / shortestStructuralRestLength, required to be at most 1 by domain admission. The shortest-edge Infinity sentinel yields 0, including no-edge lattices and direct-square distance overflow. It uses declared speed and lattice spacing rather than observed motion or collider thickness, so an admitted ratio does not certify continuous collision avoidance.

    triangles: number

    Triangles the derived surface draws: two per lattice quad.

    It happens to equal shear, because a quad carries two diagonals and two triangles alike. They are separate statements about separate costs; one is what the solver projects, the other is what the GPU rasterizes; and a consumer reading the constraint count as a triangle count would be right by coincidence and wrong the moment either side changes.

    worstCaseGathers: number

    Constraint gathers a worst-case seek costs.

    worstCaseSelfContactPairs?: number

    Segment pairs a worst-case seek checks for a cord's contact with itself: every pair of segments that share no particle, once per sweep and step; zero for a body that does not declare it. The grid usually checks far fewer, but no lower bound holds for a cord coiled on itself.