# US 2020/0221139 A1 · Method and apparatus for dynamic point cloud partition packing

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2020/0221139 A1
- Document ID: US20200221139A1
- Status: Published application
- Kind: A1
- Application number: 16/738,287
- Filed: 2020-01-09
- Published: 2020-07-09
- Earliest claimed: 2019-01-09
- Assignees: Tencent America LLC
- Applicants: Tencent America LLC
- Inventors: Arash VOSOUGHI; Sehoon YEA; Shan LIU; Byeongdoo CHOI; Stephan WENGER
- Web page: https://patentgrep.com/patent/US20200221139A1

## CPC

- H04N 19/91: Entropy coding, e.g. variable length coding [VLC] or arithmetic coding
- H04N 19/119: Adaptive subdivision aspects, e.g. subdivision of a picture into rectangular or non-rectangular coding blocks
- H04N 19/167: Position within a video image, e.g. region of interest [ROI]
- H04N 19/17: the unit being an image region, e.g. an object
- H04N 19/172: the region being a picture, frame or field
- H04N: PICTORIAL COMMUNICATION, e.g. TELEVISION

## Abstract

A method of dynamic point cloud partition packing is by at least one processor and includes obtaining one or more region of interest (ROI) patches from an ROI of a point cloud, and attempting to pack, into one among tiles of a tile map, one among the obtained one or more ROI patches, in a tile scan order. The method further includes identifying whether the one among the one or more ROI patches is packed successfully into the one among the tiles, and based on the one among the one or more ROI patches being determined to be not packed successfully into the one among the tiles, chunking the one among the one or more ROI patches into multiple ROI patches.

## Claims

### Claim 1

A method of dynamic point cloud partition packing, the method being performed by at least one processor, and the method comprising:
obtaining one or more region of interest (ROI) patches from an ROI of a point cloud;
attempting to pack, into one among tiles of a tile map, one among the obtained one or more ROI patches, in a tile scan order;
identifying whether the one among the one or more ROI patches is packed successfully into the one among the tiles; and
based on the one among the one or more ROI patches being determined to be not packed successfully into the one among the tiles, chunking the one among the one or more ROI patches into multiple ROI patches.

### Claim 2 (depends on 1)

The method of claim 1, further comprising:
attempting to pack, into the one among the tiles, one among the multiple ROI patches into which the one among the one or more ROI patches is chunked, in the tile scan order;
identifying whether the one among the multiple ROI patches is packed successfully into the one among the tiles; and
based on the one among the multiple ROI patches being determined to be not packed successfully into the one among the tiles, chunking the one among the multiple ROI patches into a plurality of ROI patches.

### Claim 3 (depends on 1)

The method of claim 1, further comprising:
partitioning the point cloud into multiple partitions; and
packing each of the multiple partitions into which the point cloud is partitioned, into a set of the tiles that is not shared by any of the multiple partitions.

### Claim 4 (depends on 1)

The method of claim 1, further comprising:
partitioning the point cloud into multiple partitions;
obtaining, for each of the multiple partitions into which the point cloud is partitioned, a maximum number of tiles in a frame to be used to pack a respective one of the multiple partitions, among a group of frames; and
packing each of the multiple partitions into the maximum number of tiles obtained for a respective one of the multiple partitions, in each of the group of frames.

### Claim 5 (depends on 1)

The method of claim 1, further comprising:
partitioning the point cloud into multiple partitions; and
packing each of the multiple partitions into which the point cloud is partitioned, into a group of tiles that is not shared by any of the multiple partitions and remains the same for all frames in a group of frames.

### Claim 6 (depends on 5)

The method of claim 5, further comprising transmitting information of a super bounding box for the group of tiles into which a respective one of the multiple partitions is packed, the super bounding box comprising all tiles into which the respective one of the multiple partitions is packed for all frames in the group of frames.

### Claim 7 (depends on 1)

The method of claim 1, further comprising, based on the one among the one or more ROI patches being determined to be packed successfully into the one among the tiles, transmitting an index of the one among the tiles.

### Claim 8

An apparatus for dynamic point cloud partition packing, the apparatus comprising:
at least one memory configured to store computer program code; and
at least one processor configured to access the at least one memory and operate according to the computer program code, the computer program code comprising:
obtaining code configured to cause the at least one processor to obtain one or more region of interest (ROI) patches from an ROI of a point cloud;
packing code configured to cause the at least one processor to attempt to pack, into one among tiles of a tile map, one among the obtained one or more ROI patches, in a tile scan order;
identifying code configured to cause the at least one processor to identify whether the one among the one or more ROI patches is packed successfully into the one among the tiles; and
chunking code configured to cause the at least one processor to, based on the one among the one or more ROI patches being determined to be not packed successfully into the one among the tiles, chunk the one among the one or more ROI patches into multiple ROI patches.

### Claim 9 (depends on 8)

The apparatus of claim 8, wherein the packing code is further configured to cause the at least one processor to attempt to pack, into the one among the tiles, one among the multiple ROI patches into which the one among the one or more ROI patches is chunked, in the tile scan order,
the identifying code is further configured to cause the at least one processor to identify whether the one among the multiple ROI patches is packed successfully into the one among the tiles, and
the chunking code is further configured to cause the at least one processor to, based on the one among the multiple ROI patches being determined to be not packed successfully into the one among the tiles, chunk the one among the multiple ROI patches into a plurality of ROI patches.

### Claim 10 (depends on 8)

The apparatus of claim 8, further comprising partitioning code configured to cause the at least one processor to partition the point cloud into multiple partitions,
wherein the packing code is further configured to cause the at least one processor to pack each of the multiple partitions into which the point cloud is partitioned, into a set of the tiles that is not shared by any of the multiple partitions.

### Claim 11 (depends on 8)

The apparatus of claim 8, further comprising partitioning code configured to cause the at least one processor to partition the point cloud into multiple partitions,
wherein the obtaining code is further configured to cause the at least one processor to obtain, for each of the multiple partitions into which the point cloud is partitioned, a maximum number of tiles in a frame to be used to pack a respective one of the multiple partitions, among a group of frames, and
the packing code is further configured to cause the at least one processor to pack each of the multiple partitions into the maximum number of tiles obtained for a respective one of the multiple partitions, in each of the group of frames.

### Claim 12 (depends on 8)

The apparatus of claim 8, further comprising partitioning code configured to cause the at least one processor to partition the point cloud into multiple partitions,
wherein the packing code is further configured to cause the at least one processor to pack each of the multiple partitions into which the point cloud is partitioned, into a group of tiles that is not shared by any of the multiple partitions and remains the same for all frames in a group of frames.

### Claim 13 (depends on 12)

The apparatus of claim 12, further comprising transmitting code configured to cause the at least one processor to transmit information of a super bounding box for the group of tiles into which a respective one of the multiple partitions is packed, the super bounding box comprising all tiles into which the respective one of the multiple partitions is packed for all frames in the group of frames.

### Claim 14 (depends on 8)

The apparatus of claim 8, further comprising transmitting code configured to cause the at least one processor to, based on the one among the one or more ROI patches being determined to be packed successfully into the one among the tiles, transmit an index of the one among the tiles.

### Claim 15

A non-transitory computer-readable storage medium storing instructions that cause at least one processor to:
obtain one or more region of interest (ROI) patches from an ROI of a point cloud;
attempt to pack, into one among tiles of a tile map, one among the obtained one or more ROI patches, in a tile scan order;
identify whether the one among the one or more ROI patches is packed successfully into the one among the tiles; and
based on the one among the one or more ROI patches being determined to be not packed successfully into the one among the tiles, chunk the one among the one or more ROI patches into multiple ROI patches.

### Claim 16 (depends on 15)

The non-transitory computer-readable storage medium of claim 15, wherein the instructions further cause the at least one processor to:
attempt to pack, into the one among the tiles, one among the multiple ROI patches into which the one among the one or more ROI patches is chunked, in the tile scan order;
identify whether the one among the multiple ROI patches is packed successfully into the one among the tiles; and
based on the one among the multiple ROI patches being determined to be not packed successfully into the one among the tiles, chunk the one among the multiple ROI patches into a plurality of ROI patches.

### Claim 17 (depends on 15)

The non-transitory computer-readable storage medium of claim 15, wherein the instructions further cause the at least one processor to:
partition the point cloud into multiple partitions; and
pack each of the multiple partitions into which the point cloud is partitioned, into a set of the tiles that is not shared by any of the multiple partitions.

### Claim 18 (depends on 15)

The non-transitory computer-readable storage medium of claim 15, wherein the instructions further cause the at least one processor to:
partition the point cloud into multiple partitions;
obtain, for each of the multiple partitions into which the point cloud is partitioned, a maximum number of tiles in a frame to be used to pack a respective one of the multiple partitions, among a group of frames; and
pack each of the multiple partitions into the maximum number of tiles obtained for a respective one of the multiple partitions, in each of the group of frames.

### Claim 19 (depends on 15)

The non-transitory computer-readable storage medium of claim 15, wherein the instructions further cause the at least one processor to:
partition the point cloud into multiple partitions; and
pack each of the multiple partitions into which the point cloud is partitioned, into a group of tiles that is not shared by any of the multiple partitions and remains the same for all frames in a group of frames.

### Claim 20 (depends on 19)

The non-transitory computer-readable storage medium of claim 19, wherein the instructions further cause the at least one processor to transmit information of a super bounding box for the group of tiles into which a respective one of the multiple partitions is packed, the super bounding box comprising all tiles into which the respective one of the multiple partitions is packed for all frames in the group of frames.
