公开(公告)号：US09235906B2

公开(公告)日：2016-01-12

申请号：US13632003

申请日：2012-09-30

Applicant: Apple Inc.

Inventor： Guillaume A. Carbonneau ,  Vincent Dumont

IPC: G09G5/00 ,  G06T11/00 ,  G01C21/32 ,  G06F17/30

CPC classification number: G06T11/00 ,  G01C21/32 ,  G06F17/30241

Abstract: A method is provided that utilizes a parallel processing system to determine whether different geometries intersect each tile in a map hierarchy. The method receives a description of a geometry and an identification of a tile in a tile tree. The method utilizes an available processing unit to determine whether the geometry intersects the tile. When the geometry intersects the tile and the tile has child tiles, the method stores several task descriptions that can be assigned to any processing units in the parallel processing system. Each task description includes the description of the portion of the geometry that overlaps the tile and an identification of one of the child tiles of the tile. The method then assigns each of the tasks to an available processing unit to continue down the tree hierarchy to determine whether each child tile intersects a portion of the geometry.

Abstract translation: 提供了一种利用并行处理系统来确定不同几何是否与地图层次结构中的每个瓦片相交的方法。 该方法接收瓦片树中的几何图形和瓦片的标识的描述。 该方法利用可用的处理单元来确定几何是否与瓦片相交。 当几何与瓦片相交并且瓦片具有子瓦片时，该方法存储可以分配给并行处理系统中的任何处理单元的若干任务描述。 每个任务描述包括与该瓦片重叠的几何的部分的描述和该瓦片的一个子瓦片的标识。 然后，该方法将每个任务分配给可用处理单元以继续向下树结构层次以确定每个子图块是否与几何的一部分相交。