| CPC G06T 17/10 (2013.01) [G06F 30/10 (2020.01); G06T 2210/12 (2013.01)] | 15 Claims |
|
1. A computer implemented method, performed by a processor of a data processing apparatus, of bounding spatial data associated with geometric bounds of an item mapped into one or more three-dimensional (3-D) axis-aligned bounding boxes, the geometric bounds bounding each permutation of all possible positions of the item geometrically, the method comprising:
partitioning, by the processor, a set of bounding boxes using a first group of intervals along an x-axis direction and allocating a partition identification xpar;
partitioning, by the processor, the set of bounding boxes using a second group of intervals along a y-axis direction and allocating a partition identification ypar;
partitioning, by the processor, the set of bounding boxes using a third group of intervals along a z-axis direction and allocating a partition identification zpar; and
partitioning, by the processor, the set of bounding boxes by partition identification tuples (xpar, ypar, zpar),
wherein the partitioning of the set of bounding boxes along the x-axis direction, the y-axis direction, or the z-axis direction comprises:
projecting each bounding box in the set of bounding boxes onto the respective axis direction to form a one-dimensional (1-D) interval from a 3-D axis-aligned bounding box;
sorting the 1-D intervals either by ascending value of xmin, ymin, or zmin or descending value of xmax, ymax, or zmax; and
scanning the 1-D intervals in ascending order or descending order and assigning the partition identification xpar, ypar, or zpar, respectively, to each 1-D interval.
|