| 摘要 |
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. |
