Data processing method and apparatus, device, computer-readable storage medium, and computer program product

Patent metadata

Field	Value
Publication number	US-12573149-B2
Application number	US-202318324617-A
Country	US
Kind code	B2
Filing date	May 26, 2023
Priority date	Jan 17, 2022
Publication date	Mar 10, 2026
Grant date	Mar 10, 2026

Abstract

A data processing method includes acquiring three-dimensional mesh data to be processed, and performing dimension reduction on the three-dimensional mesh data to obtain two-dimensional mesh data, the two-dimensional mesh data including vertex information and triangle information, constructing a hierarchical sub-mesh structure, each level of the hierarchical sub-mesh structure including one or more sub-meshes, performing grouping of triangles on the two-dimensional mesh data to obtain triangle grouping sets corresponding to the sub-meshes, hierarchically storing the sub-meshes and the triangle grouping sets corresponding to the sub-meshes, and determining cross-section loops of the sub-meshes, and rendering, based on the cross-section loops, cross-sections of each of the sub-meshes.

First claim

What is claimed is:

1 . A data processing method, performed by a computer device, the method comprising:
acquiring three-dimensional mesh data to be processed, and performing dimension reduction on the three-dimensional mesh data to obtain two-dimensional mesh data, the two-dimensional mesh data comprising vertex information and triangle information; constructing, based on the two-dimensional mesh data, a hierarchical sub-mesh structure having one or more levels, each level of the hierarchical sub-mesh structure comprising at least one sub-mesh; performing, based on the at least one sub-mesh, grouping of triangles in the two-dimensional mesh data to obtain triangle grouping sets corresponding to the at least one sub-mesh; hierarchically storing, based on levels corresponding to the at least one sub-mesh, the at least one sub-mesh and the triangle grouping sets corresponding to the at least one sub-mesh; acquiring a first target level of the hierarchical sub-mesh structure to be rendered for a virtual object corresponding to the two-dimensional mesh data, the first target level being based on a required detail with which the virtual object is to be rendered in a scene; determining, based on the vertex information, the first target level, and the triangle information, cross-section loops of one or more sub-meshes in the first target level; based on the first target level, rendering one or more target sub-meshes and cross-sections of the one or more target sub-meshes to obtain a first rendering result rendering the virtual object corresponding to the two-dimensional mesh data corresponding to the required detail, wherein the cross-sections are based on the cross-section loops, and wherein the cross-sections of the one or more target sub-meshes are not visible when the virtual object is rendered corresponding to the first target level; determining a second target level of the hierarchical sub-mesh structure for rendering the virtual object in response to the virtual object corresponding to the first target level being determined to meet a decomposition condition; determining movement information and rotation information of the at least one sub-mesh in the second target level; determining, based on the movement information and the rotation information of the sub- meshes, rendering positions of the at least one sub-mesh in the second target level; and rendering, based on the rendering positions and previously rendered cross-sections of the one or more target sub-meshes, a second rendering result.

2 . The data processing method according to claim 1 , wherein the performing dimension reduction comprises:
acquiring a preset conformal mapping function; acquiring three-dimensional coordinate information of vertices from the three-dimensional mesh data; and performing conformal mapping on the three-dimensional coordinate information of the vertices using the preset conformal mapping function to obtain two-dimensional coordinate information of the vertices.

3 . The data processing method according to claim 1 , wherein the constructing comprises:
determining a mesh corresponding to the two-dimensional mesh data as a first-level sub-mesh; acquiring vertex coordinates and center coordinates of i th target regions corresponding to i th -level sub-meshes, i=1, 2, . . . , (N−1), N being a preset level number, and N being an integer greater than 1; and dividing, based on the vertex coordinates and the center coordinates of the i th target regions, the i th -level sub-meshes to obtain a plurality of (i+1) th -level sub-meshes.

4 . The data processing method according to claim 1 , wherein performing the grouping of triangles comprises:
determining, based on the vertex information and the triangle information, center coordinates of the triangles; acquiring, based on region information of the at least one sub-mesh, vertex coordinates of a j th sub-mesh, j=1, 2, . . . , M, M being a total number of the at least one sub-mesh, and M being a positive integer; and allocating, based on the center coordinates of the triangles and the vertex coordinates of the j th sub-mesh, triangles with center coordinates positioned in the target region corresponding to the j th sub-mesh to the triangle grouping set corresponding to the j th sub-mesh.

5 . The data processing method according to claim 4 , wherein determining the center coordinates comprises:
determining, based on the vertex information and the triangle information, three vertex coordinates of each of the triangles, the vertex coordinates each comprising a first vertex coordinate value and a second vertex coordinate value; determining, based on three first vertex coordinate values of each of the triangles, a first center coordinate value of each of the triangles; and determining, based on three second vertex coordinate values of each of the triangles, a second center coordinate value of each of the triangles.

6 . The data processing method according to claim 1 , wherein determining the cross-section loops comprises:
determining, based on the vertex information and the triangle information, a plurality of target edges in the triangle grouping sets, the target edges being edges existing in only one of the triangles in the triangle grouping sets; determining target edges from the plurality of target edges in the triangle grouping sets that are connected end to end and form closed loops; and determining the formed closed loops as the cross-section loops of the at least one sub- mesh.

7 . The data processing method according to claim 6 , wherein determining the plurality of target edges comprises:
determining, based on the vertex information and the triangle information, connection edges in a k th triangle grouping set, k=1, 2, . . . , M, M being a total number of the at least one sub-mesh, and M being a positive integer; determining, based on the triangle information, sharing numbers of the connection edges; and determining the connection edges of which the sharing numbers are a first preset value as the target edges in the kth triangle grouping set.

8 . The data processing method according to claim 7 , wherein determining the sharing numbers of the connection edges comprises:
setting the sharing numbers of the connection edges as the first preset value; and updating a sharing number of a first connection edge to a second preset value based on a second connection edge having same vertices of the first connection edge and an opposite direction to the first connection edge existing among other connection edges than the first connection edge; the first connection edge being any of the connection edges.

9 . A data processing apparatus, the apparatus comprising:
at least one memory configured to store program code; and at least one processor configured to read the program code and operate as instructed by the program code, the program code comprising: dimension reduction code configured to cause at least one of the at least one processor to acquire three-dimensional mesh data to be processed, and perform dimension reduction on the three-dimensional mesh data to obtain two-dimensional mesh data, the two-dimensional mesh data comprising vertex information and triangle information; hierarchical construction code configured to cause at least one of the at least one processor to construct, based on the two-dimensional mesh data, a hierarchical sub-mesh structure having one or more levels, each level of the hierarchical sub-mesh structure comprising at least one sub-mesh; triangle grouping code configured to cause at least one of the at least one processor to perform, based on the at least one sub-mesh, grouping of triangles in the two-dimensional mesh data to obt

Assignees

• Tencent Tech Shenzhen Company Ltd

Inventors

• Lin Koon Wing Macgyver

Classifications

• G06T2200/04

  involving 3D image data · CPC title

• G06T15/00

  Three-dimensional [3D] image rendering · CPC title

• G06T7/13

  Edge detection · CPC title

• G06T7/75

  involving models · CPC title

• G06T2210/36

  Level of detail · CPC title