Abstract: It is proposed a method for factory operation. The method includes providing manufacturing tasks each represented by a law describing a manufacturing of a product by one or more manageable machines. The method includes obtaining one or more manufacturing constraints and one or more manufacturing events. The method includes determining an operating mode of the factory based on the one or more manufacturing constraints and on one or more product constraints. The determining includes one or more iterations. Each iteration computes a respective propensity of each manufacturing task representing a frequency with which the task is chosen for manufacturing the product given the constraints and/or a previous event(s) occurrence. The iteration ranks the tasks according to a propensity descending order. The iteration visits the tasks according to the ranking and affecting to each task one or more manageable machines and resources. The iteration executes the tasks until an event(s).

Abstract: It is proposed a method for factory operation. The method includes providing manufacturing tasks each represented by a law describing a manufacturing of a product by one or more manageable machines. The method includes obtaining one or more manufacturing constraints and one or more manufacturing events. The method includes determining an operating mode of the factory based on the one or more manufacturing constraints and on one or more product constraints. The determining includes one or more iterations. Each iteration computes a respective propensity of each manufacturing task representing a frequency with which the task is chosen for manufacturing the product given the constraints and/or a previous event(s) occurrence. The iteration ranks the tasks according to a propensity descending order. The iteration visits the tasks according to the ranking and affecting to each task one or more manageable machines and resources. The iteration executes the tasks until an event(s).

Abstract: A computer-implemented method for simulating an assembly of fabric pieces can include providing a plurality of parallel solvers, a first solver simulating at least one first fabric piece and a second solver simulating at least one second fabric piece. The computer-implemented method can further include maintaining the first and the second fabric pieces tight by computing a common frontier by the first and second solvers.

Abstract: Embodiments of the present invention provide functionality simulating the physical behavior of at least one object in a three dimensional (3D) scene that is divided into a plurality of zones. One such example embodiment comprises: providing at least a first zone and a second zone topologically adjacent, each zone having its own computing resource, providing an object located in one or both zones, and simulating the physical behavior of the object, the simulation being performed by the computing resource of each one of said first and second zones.

Abstract: The invention is directed to a computer-implemented method for partitioning a three-dimensional scene into a plurality of zones, each zone being processed by a computing resource. The method comprises providing a three-dimensional scene comprising one or more objects, each object generating a computing resource cost; determining a set of locations in the three-dimensional scene; filling each location with its maximum occupancy of objects that reaches the most expensive computing cost; computing, for each location of the three-dimensional scene, the maximum computing cost density; and grouping adjacent locations into one or more zones, each zone having a resulting computing cost density guarantying a real-time performance of the zone.

Abstract: It is proposed a computer-implemented method for simulating an assembly of fabric pieces. The method comprises providing a plurality of parallel solvers, a first solver simulating at least one first fabric piece and a second solver simulating at least one second fabric piece, and maintaining the first and the second fabric pieces tight by computing a common frontier by the first and second solvers.

Abstract: The invention is directed to a computer-implemented method for simulating the physical behavior of at least one object in a 3D scene divided into a plurality of zones. The method comprises: providing at least a first zone and a second zone topologically adjacent, each zone having its own computing resource; providing an object located in one or both zones; and simulating the physical behavior of the object, the simulation being performed by the computing resource of each one of said first and second zones.

Abstract: The invention is directed to a computer-implemented method for partitioning a three-dimensional scene into a plurality of zones, each zone being processed by a computing resource. The method comprises providing a three-dimensional scene comprising one or more objects, each object generating a computing resource cost; determining a set of locations in the three-dimensional scene; filling each location with its maximum occupancy of objects that reaches the most expensive computing cost; computing, for each location of the three-dimensional scene, the maximum computing cost density; and grouping adjacent locations into one or more zones, each zone having a resulting computing cost density guarantying a real-time performance of the zone.