Function solveLayerOrders3D

  • solveLayerOrders3D(graph, epsilon?): {
        branches?: LayerBranch[];
        faces_winding: boolean[];
        orders: {
            [key: string]: number;
        };
    }

  • Parameters

    • graph: FOLD

      a FOLD object

    • Optional epsilon: number

      an optional epsilon

    Returns {
        branches?: LayerBranch[];
        faces_winding: boolean[];
        orders: {
            [key: string]: number;
        };
    }

    an object that describes all layer orderings, where the "root" orders are true for all solutions, and each object in "branches" can be appended to the root object to create a complete solution.

    • Optional branches?: LayerBranch[]
    • faces_winding: boolean[]
    • orders: {
          [key: string]: number;
      }
      • [key: string]: number

    Description

    Find all possible layer orderings of the faces in a 3D folded origami. The result contains all possible solutions, use the prototype methods available on this return object to choose one solution, among other available options. This layer solver extends the taco/tortilla method into 3D by sorting faces into groups of coplanar-overlapping faces and adding a few new types of constraints which join faces between groups. This algorithm still requires faces be convex, and faces must be planar.

Settings

Member Visibility

Theme