# US 2022/0284633 A1 · Method and apparatus for constructing a 3d geometry

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

- Number: US 2022/0284633 A1
- Document ID: US20220284633A1
- Status: Published application
- Kind: A1
- Application number: 17/501,779
- Filed: 2021-10-14
- Published: 2022-09-08
- Earliest claimed: 2021-03-05
- Assignees: Tencent America LLC
- Applicants: Tencent America LLC
- Inventors: Xiang ZHANG; Wen Gao; Shan Liu
- Web page: https://patentgrep.com/patent/US20220284633A1

## CPC

- G06T 9/001: {Model-based coding, e.g. wire frame}
- G06T 9/007: {Transform coding, e.g. discrete cosine transform}
- G06T 17/00: Three-dimensional [3D] modelling for computer graphics
- H04N 19/132: Sampling, masking or truncation of coding units, e.g. adaptive resampling, frame skipping, frame interpolation or high-frequency transform coefficient masking
- H04N 19/146: Data rate or code amount at the encoder output
- H04N 19/169: characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
- H04N 19/597: specially adapted for multi-view video sequence encoding
- H04N 19/60: using transform coding
- H04N 19/96: Tree coding, e.g. quad-tree coding
- G06T 2210/12: Bounding box
- G06T 2210/56: Particle system, point based geometry or rendering
- H04N 19/119: Adaptive subdivision aspects, e.g. subdivision of a picture into rectangular or non-rectangular coding blocks
- G06T: IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- H04N: PICTORIAL COMMUNICATION, e.g. TELEVISION

## Abstract

Aspects of the disclosure include methods, apparatuses, and non-transitory computer-readable storage mediums for point cloud compression. An apparatus includes processing circuitry that encodes information associated with a current point of a plurality of points of a point cloud. The plurality of points is partitioned into multiple bounding boxes. The processing circuitry determines whether a first size of a hash table is greater than or equal to a predetermined maximum size of the hash table. The processing circuitry removes information associated with non-boundary points in the multiple bounding boxes from the hash table based on the first size of the hash table being greater than or equal to the predetermined maximum size of the hash table. The processing circuitry stores the encoded information associated with the current point into the hash table.

## Claims

### Claim 1

A method for point cloud compression, comprising:
encoding information associated with a current point of a plurality of points of a point cloud, the plurality of points being partitioned into multiple bounding boxes;
determining whether a first size of a hash table is greater than or equal to a predetermined maximum size of the hash table;
removing information associated with non-boundary points in the multiple bounding boxes from the hash table based on the first size of the hash table being greater than or equal to the predetermined maximum size of the hash table; and
storing the encoded information associated with the current point into the hash table.

### Claim 2 (depends on 1)

The method of claim 1, wherein the removing comprises:
determining whether a check point of the current point is equal to a saved check point, the check point of the current point being generated based on a boundary size of each of the multiple bounding boxes and a position of the current point;
removing the information associated with the non-boundary points in the multiple bounding boxes from the hash table based on the check point of the current point being different from the saved check point; and
modifying the saved check point based on the check point of the current point.

### Claim 3 (depends on 2)

The method of claim 2, further comprising:
determining whether a second size of the hash table is greater than or equal to the predetermined maximum size of the hash table; and
removing information associated with all remaining points in the multiple bounding boxes from the hash table based on the second size of the hash table being greater than or equal to the predetermined maximum size of the hash table.

### Claim 4 (depends on 1)

The method of claim 1, further comprising:
removing information associated with all remaining points in the multiple bounding boxes from the hash table.

### Claim 5 (depends on 1)

The method of claim 1, further comprising:
encoding at least one of the predetermined maximum size of the hash table or a boundary size of each of the multiple bounding boxes into a bitstream.

### Claim 6 (depends on 1)

The method of claim 1, further comprising:
encoding a mode index into a bitstream, the mode index indicating one of plurality of hash table shrinking modes.

### Claim 7 (depends on 6)

The method of claim 6, further comprising:
encoding at least one of the predetermined maximum size of the hash table or a boundary size of each of the multiple bounding boxes based on the mode index.

### Claim 8 (depends on 1)

The method of claim 1, wherein the information associated with the current point includes one of geometry information or attribute information associated with the current block.

### Claim 9

An apparatus, comprising:
processing circuitry configured to:
encode information associated with a current point of a plurality of points of a point cloud, the plurality of points being partitioned into multiple bounding boxes;
determine whether a first size of a hash table is greater than or equal to a predetermined maximum size of the hash table;
remove information associated with non-boundary points in the multiple bounding boxes from the hash table based on the first size of the hash table being greater than or equal to the predetermined maximum size of the hash table; and
store the encoded information associated with the current point into the hash table.

### Claim 10 (depends on 9)

The apparatus of claim 9, wherein the processing circuitry is configured to:
determine whether a check point of the current point is equal to a saved check point, the check point of the current point being generated based on a boundary size of each of the multiple bounding boxes and a position of the current point;
remove the information associated with the non-boundary points in the multiple bounding boxes from the hash table based on the check point of the current point being different from the saved check point; and
modify the saved check point based on the check point of the current point.

### Claim 11 (depends on 10)

The apparatus of claim 10, wherein the processing circuitry is configured to:
determine whether a second size of the hash table is greater than or equal to the predetermined maximum size of the hash table; and
remove information associated with all remaining points in the multiple bounding boxes from the hash table based on the second size of the hash table being greater than or equal to the predetermined maximum size of the hash table.

### Claim 12 (depends on 9)

The apparatus of claim 9, wherein the processing circuitry is configured to:
remove information associated with all remaining points in the multiple bounding boxes from the hash table.

### Claim 13 (depends on 9)

The apparatus of claim 9, wherein the processing circuitry is configured to:
encode at least one of the predetermined maximum size of the hash table or a boundary size of each of the multiple bounding boxes into a bitstream.

### Claim 14 (depends on 9)

The apparatus of claim 9, wherein the processing circuitry is configured to:
encode a mode index into a bitstream, the mode index indicating one of plurality of hash table shrinking modes.

### Claim 15 (depends on 14)

The apparatus of claim 14, wherein the processing circuitry is configured to:
encode at least one of the predetermined maximum size of the hash table or a boundary size of each of the multiple bounding boxes based on the mode index.

### Claim 16 (depends on 9)

The apparatus of claim 9, wherein the information associated with the current point includes one of geometry information or attribute information associated with the current block.

### Claim 17

A non-transitory computer-readable storage medium storing instructions which, when executed by at least one processor, cause the at least one processor to perform:
encoding information associated with a current point of a plurality of points of a point cloud, the plurality of points being partitioned into multiple bounding boxes;
determining whether a first size of a hash table is greater than or equal to a predetermined maximum size of the hash table;
removing information associated with non-boundary points in the multiple bounding boxes from the hash table based on the first size of the hash table being greater than or equal to the predetermined maximum size of the hash table; and
storing the encoded information associated with the current point into the hash table.

### Claim 18 (depends on 17)

The non-transitory computer-readable storage medium of claim 17, wherein the removing comprises:
determining whether a check point of the current point is equal to a saved check point, the check point of the current point being generated based on a boundary size of each of the multiple bounding boxes and a position of the current point;
removing the information associated with the non-boundary points in the multiple bounding boxes from the hash table based on the check point of the current point being different from the saved check point; and
modifying the saved check point based on the check point of the current point.

### Claim 19 (depends on 2)

The non-transitory computer-readable storage medium of claim 2, wherein the stored instructions cause the at least one processor to perform:
determining whether a second size of the hash table is greater than or equal to the predetermined maximum size of the hash table; and
removing information associated with all remaining points in the multiple bounding boxes from the hash table based on the second size of the hash table being greater than or equal to the predetermined maximum size of the hash table.

### Claim 20 (depends on 1)

The non-transitory computer-readable storage medium of claim 1, wherein the stored instructions cause the at least one processor to perform:
removing information associated with all remaining points in the multiple bounding boxes from the hash table.
