Abstract: Described is a computer-implemented method for partitioning a 3D scene into a plurality of zones, each zone representing an area or a volume of the 3D scene and being processed by a computing resource. The method comprises obtaining a 3D scene comprising one or more objects, each object generating a computing resource cost, computing a first map that represents a density of computing costs of the provided 3D scene, defining a second map that represents constraints on the shapes of zones that will be obtained as a result of a partitioning of the 3D scene, discretizing the obtained 3D scene into cells by computing a space quantization of the 3D scene free of dynamic objects, computing, for each cell, a computing cost from the first map of the 3D scene, aggregating the cells into one or more zones in accordance with the second map.

Abstract: Described is a computer-implemented method for partitioning a 3D scene into a plurality of zones, each zone representing an area or a volume of the 3D scene and being processed by a computing resource. The method comprises obtaining a 3D scene comprising one or more objects, each object generating a computing resource cost, computing a first map that represents a density of computing costs of the provided 3D scene, defining a second map that represents constraints on the shapes of zones that will be obtained as a result of a partitioning of the 3D scene, discretizing the obtained 3D scene into cells by computing a space quantization of the 3D scene free of dynamic objects, computing, for each cell, a computing cost from the first map of the 3D scene, aggregating the cells into one or more zones in accordance with the second map.

Abstract: Described is a computer-implemented method for partitioning a 3D scene into a plurality of zones, each zone representing an area or a volume of the 3D scene and being processed by a computing resource. The method comprises obtaining a 3D scene comprising one or more objects, each object generating a computing resource cost, computing a first map that represents a density of computing costs of the provided 3D scene, defining a second map that represents constraints on the shapes of zones that will be obtained as a result of a partitioning of the 3D scene, discretizing the obtained 3D scene into cells by computing a space quantization of the 3D scene free of dynamic objects, computing, for each cell, a computing cost from the first map of the 3D scene, aggregating the cells into one or more zones in accordance with the second map.

Abstract: The invention notably relates to a computer-implemented method for simulating a 3D scene. The simulation is carried out with a set of computing resources running in parallel. The method comprises partitioning a 3D scene into a plurality of zones. Each zone is sized to satisfy real-time computing constraint by one computing resource of the set. The method comprises assigning each zone of the plurality to a computing resource, computing an estimation of a load of each computing resource and determining whether one or more computing resources are over-loaded or under-loaded, computing, for each zone, a contribution of the zone to the load of the computing resource to which the zone is assigned, reassigning one or more zones of a computing resource that is over-loaded or under-loaded to another computing resource, the reassignment resulting from the computed contributions of the zones with a combinatorial optimization algorithm.

Abstract: Described is a computer-implemented method for partitioning a 3D scene into a plurality of zones, each zone representing an area or a volume of the 3D scene and being processed by a computing resource. The method comprises obtaining a 3D scene comprising one or more objects, each object generating a computing resource cost, computing a first map that represents a density of computing costs of the provided 3D scene, defining a second map that represents constraints on the shapes of zones that will be obtained as a result of a partitioning of the 3D scene, discretizing the obtained 3D scene into cells by computing a space quantization of the 3D scene free of dynamic objects, computing, for each cell, a computing cost from the first map of the 3D scene, aggregating the cells into one or more zones in accordance with the second map.

Abstract: The invention notably relates to a computer-implemented method for simulating a 3D scene. The simulation is carried out with a set of computing resources running in parallel. The method comprises partitioning a 3D scene into a plurality of zones. Each zone is sized to satisfy real-time computing constraint by one computing resource of the set. The method comprises assigning each zone of the plurality to a computing resource, computing an estimation of a load of each computing resource and determining whether one or more computing resources are over-loaded or under-loaded, computing, for each zone, a contribution of the zone to the load of the computing resource to which the zone is assigned, reassigning one or more zones of a computing resource that is over-loaded or under-loaded to another computing resource, the reassignment resulting from the computed contributions of the zones with a combinatorial optimization algorithm.