Partition Of A 3D Scene Into A Plurality Of Zones Processed By A Computing Resource

A computer program comprising instructions for execution by a computer, the instructions being adapted for partitioning a three-dimensional scene into a plurality of zones, each zone being processed by a computing resource, by performing the steps of:

• 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.

A computerized system comprising:

• a storage system for storing a three-dimensional scene comprising one or more objects;
• a processing unit for processing a plurality of zones partitioning the three-dimensional scene, each zone being processed by a computing resource of the processing unit, the processing unit being adapted for partitioning the three-dimensional scene into a plurality of zones by performing the steps of:
• 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.