Patent ID: 9454842
Filing Date: 2016-09-27
CPC Classification: A63F,G06T

Claim Text:
1. 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 comprising: 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 of the determined set with a corresponding maximum occupancy of objects that reaches a respective most expensive computing cost; computing, for each given location of the determined set, a maximum computing cost density, wherein the computing comprises computing a ratio P/A, and wherein P is a measured percentage of a computing resource required for processing the given location, and A is an area or a volume of the given location in the three-dimensional scene; and grouping adjacent locations into one or more zones, each zone having a resulting computing cost density guarantying a real-time performance of the respective zone, resulting in the three-dimensional scene being partitioned into the one or more zones.