WO2023155779A1

WO2023155779A1 - Encoding method, decoding method, apparatus, and communication device

Info

Publication number: WO2023155779A1
Application number: PCT/CN2023/075953
Authority: WO
Inventors: 邹文杰; 张伟; 杨付正; 吕卓逸
Original assignee: 维沃移动通信有限公司
Priority date: 2022-02-18
Filing date: 2023-02-14
Publication date: 2023-08-24
Also published as: CN116668703A

Abstract

Disclosed in the present application are an encoding method, a decoding method, an apparatus, and a communication device. The encoding method in the embodiments of the present application comprises: on the basis of a space included angle of adjacent triangle patches in a three-dimensional mesh, an encoding end determines in a first space range vertexes to be sorted, the first space range being a space range where a target vertex of a triangle to be encoded in the three-dimensional mesh is located, and the vertexes to be sorted comprising the target vertex; and the encoding end sorts the vertexes to be sorted so as to obtain sorting information of the target vertex; and on the basis of encoding information corresponding to the sorting information of the target vertex, the encoding end obtains the encoding information of said triangle.

Description

Coding method, decoding method, device and communication equipment

Cross References to Related Applications

This application claims priority to Chinese Patent Application No. 202210163353.8 filed in China on February 18, 2022, the entire contents of which are hereby incorporated by reference.

technical field

The present application belongs to the technical field of encoding and decoding, and in particular relates to an encoding method, a decoding method, a device, and a communication device.

Background technique

According to the dominance and sequence of coding geometric information and connectivity relations, the 3D grid coding algorithms can be divided into coding algorithms driven by connectivity relations and coding algorithms driven by geometric information. The encoding algorithm driven by connectivity relations first considers the compression of connectivity relations, and the compression of geometric information is completed on the basis of it. In this way, the order of vertices will be changed when encoding geometric information, which is not conducive to the compression of geometric information. The geometric information-driven coding algorithm encodes the geometric information first, and then encodes the connectivity relationship. However, in this way, when there are many vertices to be encoded, more coding bits are needed to encode the connectivity relationship, resulting in low coding efficiency.

Contents of the invention

Embodiments of the present application provide an encoding method, a decoding method, a device, and a communication device, which can solve the problem of low encoding efficiency of an encoding algorithm driven by geometric information in the related art.

In the first aspect, an encoding method is provided, including:

The encoding end determines the vertices to be sorted in the first space range according to the spatial angles of adjacent triangle patches in the three-dimensional grid, and the first space range is the space where the target vertices of the triangles to be encoded in the three-dimensional grid are located range, and the vertex to be sorted includes the target vertex;

The encoding end sorts the vertices to be sorted to obtain the sorting information of the target vertices;

The coding end obtains the to-be Encodes the encoded information of the triangle.

In the second aspect, a decoding method is provided, including:

The decoding end decodes the target code stream to obtain decoding information; when the decoding information includes the sorting information of the target vertices, the decoding end determines the first spatial Vertices to be sorted within the range, and the vertices to be sorted are sorted, wherein the sorting information is the sequence number of the target vertex in the vertices to be sorted within the first space range, and the first space range is three-dimensional The spatial range of the target vertex of the triangle to be decoded in the grid;

The decoding end determines the target vertex of the triangle to be decoded among the vertices to be sorted according to the sorting result of the vertices to be sorted and the sorting information of the target vertex.

In a third aspect, an encoding device is provided, including:

The first determination module is used to determine the vertices to be sorted in the first spatial range according to the spatial angles of adjacent triangular patches in the three-dimensional grid, and the first spatial range is the triangle to be encoded in the three-dimensional grid The spatial range where the target vertex is located, and the vertices to be sorted include the target vertex;

The first acquisition module is used for the encoding end to sort the vertices to be sorted to obtain the sorting information of the target vertices;

The second obtaining module is used for the encoding end to obtain the encoding information of the triangle to be encoded according to the encoding information corresponding to the sorting information of the target vertices.

In a fourth aspect, a decoding device is provided, including:

The third acquisition module is used to decode the target code stream to obtain decoding information;

The fourth acquisition module is used to determine the vertices to be sorted in the first space range according to the spatial angles of adjacent triangular patches in the three-dimensional mesh when the decoding information includes the sorting information of the target vertices, And sort the vertices to be sorted, wherein the sorting information is the sequence number of the target vertex in the vertices to be sorted in the first space range, and the first space range is the triangle to be decoded in the three-dimensional grid The space range where the target vertex is located;

The second determination module is configured to determine, among the vertices to be sorted, the target vertex of the triangle to be decoded according to the sorting result of the vertices to be sorted and the sorting information of the target vertex.

In a fifth aspect, an encoding device is provided, including a processor and a communication interface, wherein the processor is used to determine the vertices to be sorted in the first space range according to the spatial angles of adjacent triangular faces in the three-dimensional mesh , the first spatial range is the spatial range where the target vertices of the triangles to be encoded in the three-dimensional grid are located, and the vertices to be sorted include the target vertices; the vertices to be sorted are sorted to obtain the target Sorting information of the vertices; according to the coding information corresponding to the sorting information of the target vertex, the coding information of the triangle to be coded is obtained.

According to a sixth aspect, a communication device is provided, the communication device includes a processor and a memory, the memory stores programs or instructions that can run on the processor, and the programs or instructions are implemented when executed by the processor. The steps of the method as described in the first aspect or the second aspect.

In the seventh aspect, a decoding device is provided, including a processor and a communication interface, wherein the processor is used to decode the target code stream to obtain decoding information; when the decoding information includes the sorting information of the target vertices , determine the vertices to be sorted in the first space range according to the spatial angles of adjacent triangular faces in the three-dimensional mesh, and sort the vertices to be sorted, wherein the sorting information is that the target vertex is at the The sequence numbers in the vertices to be sorted in a spatial range, the first spatial range is the spatial range where the target vertices of the triangles to be decoded in the three-dimensional grid are located; according to the sorting results of the vertices to be sorted and the sorting of the target vertices information, and determine the target vertex of the triangle to be decoded among the vertices to be sorted.

In an eighth aspect, there is provided a codec system, including: an encoding device and a decoding device, the encoding device can be used to perform the steps of the encoding method described in the first aspect, and the decoding device can be used to perform the steps of the encoding method described in the second aspect The steps of the decoding method.

In the ninth aspect, a readable storage medium is provided, and programs or instructions are stored on the readable storage medium, and when the programs or instructions are executed by a processor, the steps of the method described in the first aspect are realized, or the steps of the method described in the first aspect are realized, or The steps of the method described in the second aspect.

In a tenth aspect, a chip is provided, the chip includes a processor and a communication interface, the communication interface is coupled to the processor, and the processor is used to run programs or instructions to implement the method as described in the first aspect , or implement the method described in the second aspect.

In an eleventh aspect, a computer program/program product is provided, the computer program/program product The product is stored in a storage medium, and the computer program/program product is executed by at least one processor to implement the steps of the method as described in the first aspect, or to implement the steps of the method as described in the second aspect.

In the embodiment of the present application, according to the spatial angles of adjacent triangular faces in the three-dimensional mesh, some vertices are excluded in the first space range, and the vertices to be sorted are determined based on the excluded vertices, that is, the vertices to be sorted are reduced In this way, when encoding the sorting information of the target vertex, the number of bits occupied by the encoding information can be further reduced, thereby effectively improving the encoding efficiency.

Description of drawings

FIG. 1 is a schematic flow chart of an encoding method in an embodiment of the present application;

Fig. 2 is the coding schematic diagram of the coding method of the embodiment of the present application;

Fig. 3 is one of the schematic diagrams of the encoding connectivity relationship in the embodiment of the present application;

Fig. 4 is the second schematic diagram of the encoding connectivity relationship in the embodiment of the present application;

FIG. 5 is a schematic flowchart of a decoding method according to an embodiment of the present application;

FIG. 6 is a schematic diagram of decoding of a decoding method according to an embodiment of the present application;

FIG. 7 shows a schematic diagram of modules of an encoding device according to an embodiment of the present application;

FIG. 8 shows one of the structural schematic diagrams of the encoding device according to the embodiment of the present application;

FIG. 9 shows the second structural schematic diagram of the encoding device according to the embodiment of the present application;

FIG. 10 shows a schematic diagram of modules of a decoding device according to an embodiment of the present application.

Detailed ways

The technical solutions in the embodiments of the present application will be clearly described below in conjunction with the drawings in the embodiments of the present application. Obviously, the described embodiments are part of the embodiments of the present application, but not all of them. All other embodiments obtained by persons of ordinary skill in the art based on the embodiments in this application belong to the protection scope of this application.

The terms "first", "second" and the like in the specification and claims of the present application are used to distinguish similar objects, and are not used to describe a specific sequence or sequence. It is to be understood that the terms so used are interchangeable under appropriate circumstances such that the embodiments of the present application can be used in a manner other than that illustrated or described herein. It is implemented in an order other than those mentioned above, and the objects distinguished by "first" and "second" are usually of one type, and the number of objects is not limited, for example, there may be one or more first objects. In addition, "and/or" in the description and claims means at least one of the connected objects, and the character "/" generally means that the related objects are an "or" relationship.

Both the encoding device corresponding to the encoding method and the decoding device corresponding to the decoding method in the embodiment of the present application may be a terminal, and the terminal may also be called a terminal device or a user equipment (User Equipment, UE), and the terminal may be a mobile phone, a tablet computer ( Tablet Personal Computer), laptop computer (Laptop Computer) or notebook computer, personal digital assistant (Personal Digital Assistant, PDA), palmtop computer, netbook, ultra-mobile personal computer (ultra-mobile personal computer, UMPC), mobile Internet devices (Mobile Internet Device, MID), augmented reality (augmented reality, AR) / virtual reality (virtual reality, VR) equipment, robots, wearable devices (Wearable Device) or vehicle equipment (Vehicle User Equipment, VUE), Pedestrian User Equipment (PUE) and other terminal-side devices, wearable devices include: smart watches, bracelets, earphones, glasses, etc. It should be noted that, the embodiment of the present application does not limit the specific type of the terminal.

In order to enable those skilled in the art to better understand the embodiments of the present application, the following descriptions are given first.

With the advancement of 3D mesh modeling and scanning technology, people have higher requirements for the accuracy and details of 3D graphics, which also leads to a double increase in the data volume of the original 3D mesh. This poses a major challenge to the transmission, storage and computer processing of 3D meshes. Therefore, it is particularly important to achieve efficient 3D grid data compression under the condition of quality assurance. A 3D mesh is composed of elements at different levels, including vertices, edges and faces. Vertices are the basic elements that make up a 3D mesh, described using coordinates in 3D space. An edge is a part that connects two vertices in a 3D mesh. Surfaces are polygons connected by closed edges, and most surfaces in 3D meshes are triangles. The three-dimensional grid mainly contains the following three kinds of information: 1. Geometric information, which is the coordinates of all vertices in the three-dimensional grid in three-dimensional space; The connection relationship of the patch; 3. Other optional attribute information, including other information attached to the 3D grid, which can be color information, normal vector, texture coordinates, etc.

Among them, the connectivity relationship is used to describe the connection of vertices in the 3D mesh, which affects the overall shape and local details of the model, and is an important part of the 3D mesh.

The encoding method provided by the embodiment of the present application will be described in detail below through some embodiments and application scenarios with reference to the accompanying drawings.

As shown in Figure 1, the embodiment of this application provides an encoding method, including:

Step 101: The encoding end determines the vertices to be sorted in the first spatial range according to the spatial angles of adjacent triangular patches in the 3D grid, and the first spatial range is the target vertex of the triangle to be encoded in the 3D grid The spatial range where the vertex is located, and the vertex to be sorted includes the target vertex.

The encoding method of the embodiment of the present application is based on the geometric information-driven connectivity relationship encoding method, as shown in Figure 2, in the embodiment of the present application, the encoding end first encodes the geometric information based on the three-dimensional grid, and then reconstructs the geometric information. The geometric information is used to encode the connectivity relationship, and finally the code stream is output based on the encoded geometric information and the encoded connectivity relationship information.

Here, the reconstructed geometric information includes index information of vertices in the three-dimensional mesh.

In the embodiment of the present application, the above-mentioned three-dimensional network may be divided into at least one triangular surface, and each triangular surface contains at least one triangle.

In this step, based on the spatial angles of adjacent triangular faces in the three-dimensional mesh, some vertices within the first spatial range may be screened out, and the remaining partial vertices may be used as vertices to be sorted.

Optionally, the first spatial range includes:

the spatial extent between the first sphere and the second sphere;

Wherein, the center of the first sphere and the second sphere are the same, the radius of the first sphere is different from the radius of the second sphere, and the center of the sphere is the target in the first side of the triangle to be encoded Position, such as the center of the sphere being the midpoint of the first side of the triangle to be encoded.

Step 102: The encoder sorts the vertices to be sorted to obtain sorting information of the target vertices.

In this step, the vertices to be sorted are sorted according to the preset sorting criterion, for example, the sorting criterion can be sorted according to the distance between the vertex and the midpoint of the first side of the triangle to be encoded, or the sorting criterion can also be based on the distance between the vertex and the midpoint of the first side of the triangle to be encoded. The size of the radius of the circumcircle of the triangle formed by the first side Sort. Of course, the sorting criteria may also be other criteria, which are not specifically limited here.

Here, the vertices in the first spatial range are further deleted through the spatial angles of adjacent triangular faces, reducing the number of vertices to be sorted, that is, the bit information used for the sorting information of the target vertices can be reduced,

Step 103: The encoding end obtains the encoding information of the triangle to be encoded according to the encoding information corresponding to the sorting information of the target vertex.

Optionally, when the target condition is met, the encoding end encodes the sorting information of the target vertex to obtain the encoded information, and when the target condition is not satisfied, encodes the index of the target vertex to obtain the above coded information. For example, the target condition is that the number of vertices to be sorted within the first spatial range is less than a preset threshold, and/or the sorting number of the target vertex is less than a preset value. Since the number of vertices to be sorted in the first space range is small or the sorting sequence number of the target vertex is small, the coding information corresponding to the sorting information will occupy a small number of bits. At this time, the sorting information of the target vertex is encoded. It can effectively reduce the number of coding bits. However, when the number of vertices to be sorted is large or the sorting sequence number of the target vertex is large, encoding the index of the target vertex can effectively reduce the number of coding bits compared with encoding the sorting information.

In the embodiment of the present application, according to the spatial angles of adjacent triangular faces in the three-dimensional grid, some vertices are excluded in the first space range, and the vertices to be sorted are determined based on the excluded vertices, that is, the number of vertices to be sorted is reduced. In this way, when encoding the sorting information of the target vertex, the number of bits occupied by the encoding information can be further reduced, thereby effectively improving the encoding efficiency.

Optionally, before the encoding end determines the first spatial range, it further includes:

The encoding end selects a first edge from an edge set corresponding to a three-dimensional grid, wherein the edge set is a set of at least one edge of an encoded triangle in the three-dimensional grid;

The encoding end determines the triangle to be encoded according to the first side and the vertex corresponding to the first side, wherein the target vertex of the triangle to be encoded is the vertex corresponding to the first side divided by the vertex corresponding to the first side For vertices other than the two vertices connected by one side, the target vertex can also be described as the opposite vertex of the first side.

Optionally, the encoding end determines the third Vertices to be sorted within a spatial range, including:

The encoding end determines the vertices to be sorted in the first space range according to the spatial angles of adjacent triangle patches in the three-dimensional mesh when the triangle to be encoded is a triangle other than the preset category of triangles.

Optionally, the preset category triangle includes at least one of the following:

The angle between the encoded triangle and the triangle is smaller than the preset angle;

A triangle with two vertices coincident or three vertices collinear. Specifically, it means that two vertices in a triangle coincide or three vertices are collinear.

Optionally, the method of the embodiment of the present application further includes:

The encoding end obtains the encoding information of the triangle to be encoded according to the encoding information corresponding to the target vertex information of the triangle to be encoded when the triangle to be encoded is the triangle of the preset category.

For example, when the triangle to be encoded is the triangle of the preset category, the index of the target vertex of the triangle to be encoded is directly encoded, and the encoding information of the triangle to be encoded is obtained according to the encoding information corresponding to the index of the target vertex.

In the embodiment of the present application, when encoding the index of the vertex, the binary representation can be used directly or encoding algorithm such as Huffman can be used for encoding, and the encoding method is not specifically limited here.

Optionally, after obtaining the encoding information of the triangle to be encoded, the method further includes:

The encoder updates the edge set according to a first preset rule;

The encoding end re-determines the triangle to be encoded according to the updated edge set, until all the triangles in the three-dimensional grid obtain encoding information;

Wherein, the first preset rule includes: adding two sides of the triangle to be encoded except the first side to the side set, and removing the first side from the side set side.

Optionally, the encoding end determines the vertices to be sorted in the first spatial range according to the spatial angles of adjacent triangular patches in the three-dimensional grid, including:

The encoding end excludes all vertices of the first target triangle from the vertices within the first space range to obtain the remaining vertices;

The encoding end determines vertices to be sorted in the first space range according to the remaining vertices;

Wherein, the first target triangle is a triangle whose included angle with an adjacent encoded triangle is smaller than the included angle threshold, and one side of the first target triangle is the same as the first side of the triangle to be encoded.

Optionally, the encoding information of the triangle to be encoded further includes: encoding information of the included angle threshold.

Here, by encoding the included angle threshold, the decoding end can obtain the included angle threshold according to the encoded information, and determine the vertices to be sorted in the first space range based on the included angle threshold. In this way, the encoding end can flexibly Set the angle threshold.

Of course, a fixed angle threshold can also be pre-agreed, and the encoding end and the decoding end determine the vertices to be sorted in the first space range based on the pre-agreed angle threshold, and the encoding end does not need to encode the angle threshold.

Optionally, the method in the embodiment of the present application further includes: encoding the target vertex information of the triangle to be encoded within the second spatial range to obtain the encoded information of the triangle to be encoded, the second spatial range being the The extent of the 3D grid other than the first spatial extent.

Optionally, the encoding information of the triangle to be encoded further includes encoding information of the first spatial range.

For example, the radii of the above-mentioned first sphere and the second sphere are coded, and in this implementation manner, the first spatial range can be flexibly set.

Of course, the encoding end and the decoding end may also pre-determine the size of the first spatial range, and in this manner, the encoding end does not need to encode the first spatial range.

In a specific embodiment of the present application, the input 3D grid is divided into one or more slices at the encoding end, and an initial triangle is selected in each slice. Encode the vertex indices of the initial triangle and put the edges of the initial triangle into the set of edges (ie, set of edges). Select an edge in the edge set and determine its opposite vertex, the triangle formed by the edge and the opposite vertex is the triangle to be coded. For example, the edge selected in each iteration can be marked as τ, its opposite vertex can be marked as v, and the triangle to be encoded adjacent to this edge can be encoded. As shown in Figure 3 and Figure 4, the process of encoding connectivity relations may specifically include:

(1) If the preset condition is met, the vertex index of the triangle may be encoded directly, or the triangle may be encoded in other ways. The preset condition can be that the triangle to be coded belongs to several special triangles, such as belonging to a degenerate surface (with two points coincident or three points collinear) or when the angle between the triangle and the coded triangle is less than a certain angle, or, the preset The condition is that the number of vertices in the first spatial range is greater than the preset number, or, the preset condition is that the target vertex is located outside the second spatial range, such as within the second spatial range, or, the target vertex within the preset condition The sorting numbers of the vertices in the first space range are greater than or equal to a preset value, and this preset condition can be flexibly set according to requirements. Add the two sides of the triangle to be coded except the side τ into the side set, and remove the side τ from the set. Then take out another side of the triangle to be coded (a side other than side τ) from the side set according to a certain criterion, and continue to code the triangles adjacent to the side, for example, the next side τ can be selected in the order of access.

(2) If the above preset condition is not met, determine the spatial range where the vertex v is located (that is, the first spatial range) and encode the spatial range. Traverse all the vertices within the space range in the slice, filter out all the vertices of the new triangle formed with the edge τ and the encoded adjacent triangle whose angle is smaller than a certain angle, and encode the angle value.

The spatial range can be determined by using geometric properties of adjacent triangular surfaces, spatial angles or other criteria. For example, the space range can use the midpoint of the side τ as the center of the sphere, and combine {Rmin, Rmax} with the minimum radius Rmin and the maximum radius Rmax between two concentric spheres, and the code is {Rmin, Rmax} group.

Optionally, the above angle value may also be encoded.

(3) Traverse all vertices in the space range and sort them according to certain sorting criteria. For example, the ordering criterion could be the distance from the vertex v to the midpoint of the side τ; or the radius of the circumscribed circle of the triangle formed with the side τ. Encodes the ordinal number of the vertex v in the sort.

(4) Add the two sides of the new coded triangle except side τ to the edge set, and remove the edge τ from the edge set. Then take another side of the newly coded triangle from the set according to a certain criterion, and continue to code the triangles adjacent to this side.

The encoding process is iterated for each slice of the 3D mesh until the triangles in each slice are complete coding. If the edge set is empty but there are unencoded triangles, the initial triangle is selected from the remaining unencoded triangles, and the encoding process is repeated.

As shown in Figure 5, the embodiment of the present application also provides a decoding method, including:

Step 501: The decoding end performs decoding processing on the target code stream to obtain decoding information.

The target code stream may be a code stream obtained by encoding the above-mentioned three-dimensional grid at the encoding end.

As shown in FIG. 6 , when decoding, the decoding end first decodes the geometric information, and then decodes the connectivity relationship according to the geometric information.

Step 502: When the decoding information includes the sorting information of the target vertices, the decoding end determines the vertices to be sorted in the first space range according to the spatial angles of adjacent triangular patches in the 3D mesh, and The vertices to be sorted are sorted, wherein the sorting information is the sequence number of the target vertex in the vertices to be sorted in the first space range, and the first space range is where the target vertex of the triangle to be decoded in the three-dimensional grid is located. spatial extent.

The above vertex information may be an index of a vertex.

In this step, the vertices to be sorted are sorted according to the preset sorting criterion, for example, the sorting criterion can be sorted according to the distance between the vertex and the midpoint of the first side of the triangle to be encoded, or the sorting criterion can also be based on the distance between the vertex and the midpoint of the first side of the triangle to be encoded. Sort by the size of the radius of the circumcircle of the triangle formed by the first side. Of course, the sorting criteria may also be other criteria, which are not specifically limited here.

Step 503: The decoding end determines the target vertex of the triangle to be decoded among the vertices to be sorted according to the sorting result of the vertices to be sorted and the sorting information of the target vertex.

Here, the sorting information of the target vertex is decoded to obtain the sorting sequence number corresponding to the target vertex, and then the target vertex is determined among the vertices to be sorted according to the sorting result of the above-mentioned vertices to be sorted.

In the method of the embodiment of the present application, the decoding end performs decoding processing on the target code stream to obtain decoding information; when the decoding information includes the sorting information of the target vertices, the decoding end performs the decoding process according to the Determine the vertex to be sorted in the first spatial range by the space angle between adjacent triangular faces, and sort the vertex to be sorted; the decoding end according to the sorting result of the vertex to be sorted and the sorting information, determining the target vertex of the triangle to be decoded among the vertices to be sorted. In the embodiment of the present application, some vertices are excluded in the first space range according to the spatial angles of adjacent triangular faces in the three-dimensional grid, and the vertices to be sorted are determined based on the excluded vertices, that is, the number of vertices to be sorted is reduced , which can effectively improve the decoding efficiency.

If the decoding information includes vertex information of the target vertex, the decoding end determines the target vertex of the triangle to be decoded according to the vertex information.

The above-mentioned vertex information may specifically be an index of a vertex.

Acquiring target vertex information of triangles to be decoded within a second spatial range according to the decoding information, where the second spatial range is a range in the three-dimensional grid other than the first spatial range;

Determine the target vertex of the triangle to be decoded according to the target vertex information.

Optionally, after the decoder determines the target vertex of the triangle to be decoded, it further includes:

The decoding end determines the triangle to be decoded according to the target vertex and the first side of the triangle to be decoded;

Wherein, the first edge is selected by the decoding end from an edge set corresponding to the three-dimensional mesh, and the edge set is a set of at least one edge of a decoded triangle in the three-dimensional mesh.

Optionally, after the decoding end determines the triangle to be decoded, it further includes:

The decoder updates the edge set according to a second preset rule;

The decoding end re-determines the first edge according to the updated edge set until each triangle in the three-dimensional mesh is determined;

Wherein, the second preset rule includes: adding two sides of the triangle to be decoded except the first side to the set of sides, and removing the first side from the set of sides. side.

Optionally, the decoding end determines the vertices to be sorted in the first spatial range according to the spatial angles of adjacent triangular patches in the three-dimensional grid, including:

The decoding end excludes all vertices of the second target triangle from the vertices within the first spatial range to obtain the remaining vertices;

The decoding end determines vertices to be sorted in the first space range according to the remaining vertices;

Wherein, the second target triangle is a triangle whose angle with an adjacent decoded triangle is smaller than the angle threshold, and one side of the second target triangle is the same as the first side of the triangle to be decoded.

According to the decoded information, information about the included angle threshold is acquired.

Optionally, the first spatial range includes:

the spatial extent between the first sphere and the second sphere;

Wherein, the center of the first sphere and the second sphere are the same, the radius of the first sphere is different from the radius of the second sphere, and the center of the sphere is the target in the first side of the triangle to be decoded Location.

Acquire information of the first spatial range according to the decoded information.

For example, according to the decoded information, the radius information of the above two spheres is acquired.

In a specific embodiment of the present application, the geometric information is first decoded at the decoding end, and then the connectivity relationship is decoded according to the geometric information. The process of decoding the connectivity relationship may specifically include:

(1) Decode the vertices of the initial triangle, and store the edges of the initial triangle into the edge set. Edges τ are taken from the edge set following the criteria used in the encoder. If the codeword to be decoded is a vertex index, then directly decode the vertex and use it as the pair vertex v. Use the vertex v and side τ to form a newly decoded triangle, and add the two sides of the triangle except side τ to the edge set, and remove the edge τ in the set according to a certain rule, such as moving according to the criterion at the top of the queue. Remove the edge τ. Take out the next edge according to a certain rule and continue to decode the adjacent triangle of this edge, for example, you can take the edge at the top of the queue as the rule.

(2) If the codeword to be decoded is not a vertex index, decode and determine the spatial range of the vertex v. For example, decode two concentric sphere radii {Rmin, Rmax} at the midpoint of τ, traverse all vertices within the range between concentric spheres, and filter out the new triangle formed with side τ whose angle with the decoded triangle is less than a certain angle all vertices of the shape.

(3) For the remaining vertices within the spatial range where the vertex v is located, sort the vertices according to the same sorting criterion as that of the encoding side. Decode the serial number corresponding to the vertex v in the triangle to be decoded, and look up the table to obtain the vertex v, and construct the decoding triangle. Add the two sides of the newly decoded triangle except side τ to the side set, and remove the side τ in the set according to a certain rule, such as removing side τ according to the criterion at the top of the queue. Take out the next edge according to a certain rule and continue to decode the adjacent triangle of this edge, for example, you can take the edge at the top of the queue as the rule.

The decoding process is iterated for each tile's codestream until the triangles in each tile are decoded. Eventually the pieces are merged into a complete mesh.

In the method of the embodiment of the present application, the decoding end performs decoding processing on the target code stream to obtain decoding information; when the decoding information includes the sorting information of the target vertices, the decoding end performs the decoding according to the space of adjacent triangular patches in the three-dimensional grid. Angle, determine the vertices to be sorted in the first space range, and sort the vertices to be sorted; the decoding end according to the sorting results of the vertices to be sorted and the sorting information of the target vertices, in the to-be-sorted vertices A target vertex of the triangle to be decoded is determined from the sorted vertices. In the embodiment of the present application, some vertices are excluded in the first space range according to the spatial angles of adjacent triangular faces in the three-dimensional grid, and the vertices to be sorted are determined based on the excluded vertices, that is, the number of vertices to be sorted is reduced , which can effectively improve the decoding efficiency.

The encoding method provided in the embodiment of the present application may be executed by an encoding device. In the embodiment of the present application, the encoding device provided in the embodiment of the present application is described by taking the encoding device executing the encoding method as an example.

As shown in Figure 7, the embodiment of the present application also provides an encoding device 700, including:

The first determination module 701 is configured to determine the vertices to be sorted in a first spatial range according to the spatial angles of adjacent triangular patches in the three-dimensional mesh, and the first spatial range is the triangle to be encoded in the three-dimensional mesh The spatial range where the target vertex is located, and the vertex to be sorted includes the target vertex;

The first acquisition module 702 is used for the encoding end to sort the vertices to be sorted to obtain the sorting information of the target vertices;

The second obtaining module 703 is used for the encoding end to obtain the encoding information of the triangle to be encoded according to the encoding information corresponding to the sorting information of the target vertex.

The device of the embodiment of the present application excludes some vertices in the first space range according to the spatial angles of adjacent triangular faces in the three-dimensional grid, and determines the vertices to be sorted based on the excluded vertices, that is, reduces the number of vertices to be sorted In this way, when encoding the sorting information of the target vertex, the number of bits occupied by the encoding information can be further reduced, thereby effectively improving the encoding efficiency.

Optionally, the device of the embodiment of the present application further includes:

The first selecting module is configured to select a first edge from an edge set corresponding to a three-dimensional grid, wherein the edge set is a set of at least one edge of an encoded triangle in the three-dimensional grid;

The third determination module is used to determine the triangle to be encoded according to the first side and the vertex corresponding to the first side, wherein the target vertex of the triangle to be encoded is the vertex corresponding to the first side divided by Vertices other than the two vertices connected by the first edge.

Optionally, the first determination module is used to determine the triangles within the first space range according to the spatial angles of adjacent triangles in the three-dimensional mesh when the triangle to be encoded is a triangle other than the preset category of triangles. vertices to be sorted.

The fifth acquisition module is configured to obtain the encoding information of the triangle to be encoded according to the encoding information corresponding to the target vertex information of the triangle to be encoded when the triangle to be encoded is a triangle of a preset category.

A triangle with two vertices coincident or three vertices collinear.

A first update module, configured to update the set of edges according to a first preset rule;

The fourth determining module is used to re-determine the triangle to be encoded according to the updated edge set, until all the triangles in the three-dimensional grid obtain encoding information;

Optionally, the first determination module includes:

The first acquisition sub-module is used to exclude all vertices of the first target triangle from the vertices within the first spatial range to obtain the remaining vertices;

A first determining submodule, configured to determine vertices to be sorted within the first space range according to the remaining vertices;

The sixth acquisition module is configured to encode the target vertex information of the triangle to be encoded within a second spatial range to obtain the encoded information of the triangle to be encoded, and the second spatial range is the three-dimensional grid except the first outside the scope of the space.

Optionally, the first spatial range includes:

the spatial extent between the first sphere and the second sphere;

Wherein, the center of the first sphere and the second sphere are the same, the radius of the first sphere is different from the radius of the second sphere, and the center of the sphere is the target in the first side of the triangle to be encoded Location.

The encoding device in the embodiment of the present application may be an electronic device, such as an electronic device with an operating system, or a component in the electronic device, such as an integrated circuit or a chip. The electronic device may be a terminal, or other devices other than the terminal. Exemplary other devices can be servers, Network Attached Storage (NAS), etc., are not specifically limited in this embodiment of the present application.

The encoding device provided by the embodiment of the present application can realize each process realized by the method embodiment in FIG. 1 and achieve the same technical effect. To avoid repetition, details are not repeated here.

Optionally, as shown in FIG. 8 , this embodiment of the present application also provides a communication device, including a processor 801 and a memory 802, and the memory 802 stores programs or instructions that can run on the processor 801. The program Or, when the instruction is executed by the processor 801, each step of the above-mentioned encoding method embodiment can be realized, and the same technical effect can be achieved. To avoid repetition, details are not repeated here.

The embodiment of the present application also provides an encoding device, including a processor and a communication interface, the processor is used to determine the vertices to be sorted in the first space range according to the spatial angles of adjacent triangular faces in the three-dimensional grid, and the second A spatial range is the spatial range where the target vertices of the triangles to be encoded in the three-dimensional grid are located, and the vertices to be sorted include the target vertices; the vertices to be sorted are sorted to obtain the sorting information of the target vertices ; Obtain the encoding information of the triangle to be encoded according to the encoding information corresponding to the sorting information of the target vertex. This device embodiment corresponds to the above-mentioned encoding method embodiment, and each implementation process and implementation mode of the above-mentioned method embodiment can be applied to this device embodiment, and can achieve the same technical effect. Specifically, FIG. 9 is a schematic diagram of a hardware structure of an encoding device implementing an embodiment of the present application.

The coding device includes but not limited to: radio frequency unit 901, network module 902, audio output unit 903, input unit 904, sensor 905, display unit 906, user input unit 907, interface unit 908, memory 909, processor 910, etc. At least some parts.

Those skilled in the art can understand that the encoding device can also include a power supply (such as a battery) for supplying power to each component, and the power supply can be logically connected to the processor 910 through the power management system, so as to manage charging, discharging, and power consumption through the power management system. Management and other functions. The structure of the device shown in FIG. 9 does not constitute a limitation to the device. The device may include more or fewer components than shown in the figure, or combine some components, or arrange different components, which will not be repeated here.

It should be understood that, in the embodiment of the present application, the input unit 904 may include a graphics processing unit (Graphics Processing Unit, GPU) 9041 and a microphone 9042, and the graphics processor 9041 Still picture or video image data obtained by an image capture device (such as a camera) in video capture mode or image capture mode is processed. The display unit 906 may include a display panel 9061, and the display panel 9061 may be configured in the form of a liquid crystal display, an organic light emitting diode, or the like. The user input unit 907 includes at least one of a touch panel 9071 and other input devices 9072 . The touch panel 9071 is also called a touch screen. The touch panel 9071 may include two parts, a touch detection device and a touch controller. Other input devices 9072 may include, but are not limited to, physical keyboards, function keys (such as volume control buttons, switch buttons, etc.), trackballs, mice, and joysticks, which will not be repeated here.

In the embodiment of the present application, the radio frequency unit 901 may transmit the downlink data from the network side device to the processor 910 for processing after receiving the downlink data; in addition, the radio frequency unit 901 may send the uplink data to the network side device. Generally, the radio frequency unit 901 includes, but is not limited to, an antenna, an amplifier, a transceiver, a coupler, a low noise amplifier, a duplexer, and the like.

The memory 909 can be used to store software programs or instructions as well as various data. The memory 909 may mainly include a first storage area for storing programs or instructions and a second storage area for storing data, wherein the first storage area may store an operating system, an application program or instructions required by at least one function (such as a sound playing function, image playback function, etc.), etc. Furthermore, memory 909 may include volatile memory or nonvolatile memory, or, memory 909 may include both volatile and nonvolatile memory. Wherein, the non-volatile memory may be a read-only memory (Read-Only Memory, ROM), a programmable read-only memory (Programmable ROM, PROM), an erasable programmable read-only memory (Erasable PROM, EPROM), an electronically programmable Erase Programmable Read-Only Memory (Electrically EPROM, EEPROM) or Flash. Volatile memory can be random access memory (Random Access Memory, RAM), static random access memory (Static RAM, SRAM), dynamic random access memory (Dynamic RAM, DRAM), synchronous dynamic random access memory (Synchronous DRAM, SDRAM), double data rate synchronous dynamic random access memory (Double Data Rate SDRAM, DDRSDRAM), enhanced synchronous dynamic random access memory (Enhanced SDRAM, ESDRAM), synchronous connection dynamic random access memory (Synch link DRAM , SLDRAM) and Direct Memory Bus Random Access Memory (Direct Rambus RAM, DRRAM). The memory 909 in the embodiment of the present application includes but is not limited to these and any other suitable types of memory.

The processor 910 may include one or more processing units; optionally, the processor 910 integrates an application processor and a modem processor, wherein the application processor mainly processes operations related to the operating system, user interface, and application programs, etc., Modem processors mainly process wireless communication signals, such as baseband processors. It can be understood that the foregoing modem processor may not be integrated into the processor 910 .

Wherein, the processor 910 is configured to determine the vertices to be sorted in a first spatial range according to the spatial angles of adjacent triangular patches in the three-dimensional mesh, and the first spatial range is the triangle to be encoded in the three-dimensional mesh The spatial range where the target vertices are located, and the vertices to be sorted include the target vertices; sort the vertices to be sorted to obtain the sorting information of the target vertices; according to the coding information corresponding to the sorting information of the target vertices , to obtain the encoding information of the triangle to be encoded.

Optionally, the processor 910 is further configured to:

Selecting a first edge from an edge set corresponding to a three-dimensional grid, wherein the edge set is a set of at least one edge of an encoded triangle in the three-dimensional grid;

Determine the triangle to be coded according to the first side and the vertex corresponding to the first side, wherein the target vertex of the triangle to be coded is the vertex corresponding to the first side except the one connected to the first side Vertices other than two vertices.

Optionally, the processor 910 is further configured to:

In the case that the triangle to be coded is a triangle other than the preset category of triangles, the vertices to be sorted in the first space range are determined according to the spatial angles of adjacent triangle patches in the three-dimensional mesh.

Optionally, the processor 910 is further configured to:

In the case that the triangle to be encoded is a triangle of a preset category, the encoding information of the triangle to be encoded is obtained according to the encoding information corresponding to the target vertex information of the triangle to be encoded.

A triangle with two vertices coincident or three vertices collinear.

Optionally, the processor 910 is further configured to:

The encoder updates the edge set according to a first preset rule;

The encoding end re-determines the triangle to be encoded according to the updated edge set until the three All the triangles in the three-dimensional grid get encoded information;

Optionally, the processor 910 is further configured to:

Optionally, the encoding information of the triangle further includes: encoding information of the included angle threshold.

Optionally, the processor 910 is further configured to:

Encoding the target vertex information of the triangle to be encoded within a second spatial range to obtain the encoded information of the triangle to be encoded, where the second spatial range is a range in the three-dimensional grid other than the first spatial range.

Optionally, the first spatial range includes:

the spatial extent between the first sphere and the second sphere;

The decoding method provided in the embodiment of the present application may be executed by a decoding device. Implementation of this application In the example, the decoding device executed by the decoding device is taken as an example to describe the decoding device provided in the embodiment of the present application.

As shown in Figure 10, the embodiment of the present application provides a decoding device 1000, including:

The third acquisition module 1001 is used to decode the target code stream to obtain decoding information;

The fourth acquisition module 1002 is used to determine the vertices to be sorted in the first space range according to the spatial angles of adjacent triangular patches in the three-dimensional mesh when the decoding information includes the sorting information of the target vertices , and sort the vertices to be sorted, wherein the sorting information is the sequence number of the target vertex in the vertices to be sorted within the first space range, and the first space range is the triangle to be decoded in the three-dimensional mesh The spatial range of the target vertex of ;

The second determination module 1003 is configured to determine, among the vertices to be sorted, the target vertex of the triangle to be decoded according to the sorting result of the vertices to be sorted and the sorting information of the target vertex.

The fifth determining module is configured to determine, by the decoding end, the target vertex of the triangle to be decoded according to the vertex information when the decoding information includes vertex information of the target vertex.

A seventh acquisition module, configured to acquire target vertex information of a triangle to be decoded within a second spatial range according to the decoding information, and the second spatial range is a range in the three-dimensional grid other than the first spatial range ;

A sixth determining module, configured to determine the target vertex of the triangle to be decoded according to the target vertex information.

A seventh determining module, configured to determine the triangle to be decoded according to the target vertex and the first side of the triangle to be decoded;

A second updating module, configured to update the set of edges according to a second preset rule;

The eighth determining module is used to re-determine the first edge according to the updated edge set until the each triangle in the three-dimensional mesh;

Optionally, the second determination module includes:

The second acquisition sub-module is used to exclude all vertices of the second target triangle from the vertices within the first spatial range to obtain the remaining vertices;

The second determination submodule is configured to determine the vertices to be sorted within the first space range according to the remaining vertices;

An eighth acquiring module, configured to acquire the information of the included angle threshold according to the decoded information.

Optionally, the first spatial range includes:

the spatial extent between the first sphere and the second sphere;

A ninth obtaining module, configured to obtain information of the first spatial range according to the decoded information.

In the embodiment of the present application, the target code stream is decoded to obtain the decoded information; when the decoded information includes the sorting information of the target vertices, the first space is determined according to the spatial angles of adjacent triangular patches in the three-dimensional grid. Vertices to be sorted within the range, and sort the vertices to be sorted; according to the sorting results of the vertices to be sorted and the sorting information of the target vertices, determine the target of the triangle to be decoded among the vertices to be sorted vertex. In the embodiment of the present application, some vertices are excluded in the first space range according to the spatial angles of adjacent triangular faces in the three-dimensional grid, and the vertices to be sorted are determined based on the excluded vertices, that is, the number of vertices to be sorted is reduced , which can effectively improve the decoding efficiency.

The decoding device provided by the embodiment of the present application can realize each process realized by the method embodiment in FIG. 5 and achieve the same technical effect. To avoid repetition, details are not repeated here.

Optionally, the embodiment of the present application also provides a communication device (see FIG. 8 for its structural diagram), including a processor 801 and a memory 802, and the memory 802 stores programs or instructions that can run on the processor 801. , when the program or instruction is executed by the processor 801, each step of the above embodiment of the decoding method can be realized, and the same technical effect can be achieved, so to avoid repetition, details are not repeated here.

The embodiment of the present application also provides a decoding device, including a processor and a communication interface, and the processor is used to decode the target code stream to obtain decoded information; when the decoded information includes the sorting information of the target vertices, according to the three-dimensional network The spatial angles of adjacent triangular faces in the lattice, determine the vertices to be sorted in the first space range, and sort the vertices to be sorted, wherein the sorting information is that the target vertex is in the first space range The sequence numbers in the vertices to be sorted, the first spatial range is the spatial range where the target vertices of the triangles to be decoded in the three-dimensional mesh are located; according to the sorting results of the vertices to be sorted and the sorting information of the target vertices, in the Determine the target vertex of the triangle to be decoded from the vertices to be sorted.

The embodiment of the present application also provides a decoding device, and its hardware structure diagram can be referred to FIG. 9 . The decoding device includes but not limited to: a radio frequency unit 901, a network module 902, an audio output unit 903, an input unit 904, a sensor 905, a display unit 906, a user input unit 907, an interface unit 908, a memory 909, and a processor 910, etc. At least some parts.

Those skilled in the art can understand that the decoding device can also include a power supply (such as a battery) for supplying power to each component, and the power supply can be logically connected to the processor 910 through the power management system, so as to manage charging, discharging, and power consumption through the power management system. Management and other functions. The structure of the device shown in FIG. 9 does not constitute a limitation to the device. The device may include more or fewer components than shown in the figure, or combine some components, or arrange different components, which will not be repeated here.

It should be understood that, in this embodiment of the present application, the input unit 904 may include a graphics processing unit (Graphics Processing Unit, GPU) 9041 and a microphone 9042, and the graphics processor 9041 is used in the video capture mode or the image capture mode by the image capture device ( Such as the static image obtained by the camera) The image data of pictures or videos is processed. The display unit 906 may include a display panel 9061, and the display panel 9061 may be configured in the form of a liquid crystal display, an organic light emitting diode, or the like. The user input unit 907 includes at least one of a touch panel 9071 and other input devices 9072 . The touch panel 9071 is also called a touch screen. The touch panel 9071 may include two parts, a touch detection device and a touch controller. Other input devices 9072 may include, but are not limited to, physical keyboards, function keys (such as volume control buttons, switch buttons, etc.), trackballs, mice, and joysticks, which will not be repeated here.

The memory 909 can be used to store software programs or instructions as well as various data. The memory 909 may mainly include a first storage area for storing programs or instructions and a second storage area for storing data, wherein the first storage area may store an operating system, an application program or instructions required by at least one function (such as a sound playing function, image playback function, etc.), etc. Furthermore, memory 909 may include volatile memory or nonvolatile memory, or, memory 909 may include both volatile and nonvolatile memory. Among them, the non-volatile memory can be read-only memory (Read-Only Memory, ROM), programmable read-only memory (Programmable ROM, PROM), erasable programmable read-only memory (Erasable PROM, EPROM), electronically programmable Erase Programmable Read-Only Memory (Electrically EPROM, EEPROM) or Flash. Volatile memory can be random access memory (Random Access Memory, RAM), static random access memory (Static RAM, SRAM), dynamic random access memory (Dynamic RAM, DRAM), synchronous dynamic random access memory (Synchronous DRAM, SDRAM), double data rate synchronous dynamic random access memory (Double Data Rate SDRAM, DDRSDRAM), enhanced synchronous dynamic random access memory (Enhanced SDRAM, ESDRAM), synchronous connection dynamic random access memory (Synch link DRAM , SLDRAM) and Direct Memory Bus Random Access Memory (Direct Rambus RAM, DRRAM). The memory 909 in the embodiment of the present application includes but is not limited to these and any other suitable types of memory.

The processor 910 may include one or more processing units; optionally, the processor 910 integrates application A processor and a modem processor, wherein the application processor mainly deals with operations related to the operating system, user interface, and application programs, and the modem processor mainly deals with wireless communication signals, such as a baseband processor. It can be understood that the foregoing modem processor may not be integrated into the processor 910 .

Wherein, the processor 910 is configured to determine the vertices to be sorted in the first space range according to the spatial angles of adjacent triangular patches in the three-dimensional mesh when the decoding information includes the sorting information of the target vertices, and The vertices to be sorted are sorted, wherein the sorting information is the sequence number of the target vertex in the vertices to be sorted within the first space range, and the first space range is the target vertex of the triangle to be decoded in the three-dimensional mesh The spatial range where the target vertex of the triangle to be decoded is determined among the vertices to be sorted according to the sorting result of the vertices to be sorted and the sorting information of the target vertex.

Optionally, the processor 910 is further configured to:

The decoder updates the edge set according to a second preset rule;

Wherein, the second preset rule includes: removing the triangle to be decoded from the first side The two edges of are added to the edge set, and the first edge is removed from the edge set.

Optionally, the processor 910 is further configured to:

Excluding all the vertices of the second target triangle from the vertices within the first space range to obtain the remaining vertices;

According to the remaining vertices, determine the vertices to be sorted in the first spatial range;

Optionally, the processor 910 is further configured to:

Optionally, the first spatial range includes:

the spatial extent between the first sphere and the second sphere;

Optionally, the processor 910 is further configured to:

The embodiment of the present application also provides a readable storage medium, on which a program or instruction is stored, and when the program or instruction is executed by a processor, the above-mentioned encoding method or decoding method is implemented. Each process of the example, and can achieve the same technical effect, in order to avoid repetition, will not repeat them here.

Wherein, the processor is the processor in the device described in the foregoing embodiments. The readable storage medium includes a computer-readable storage medium, such as a computer read-only memory ROM, a random access memory RAM, a magnetic disk or an optical disk, and the like.

The embodiment of the present application further provides a chip, the chip includes a processor and a communication interface, the communication interface is coupled to the processor, and the processor is used to run programs or instructions to implement the above encoding method or decoding method Each process of the example, and can achieve the same technical effect, in order to avoid repetition, will not repeat them here.

It should be understood that the chip mentioned in the embodiment of the present application may also be called a system-on-chip, a system-on-chip, a system-on-a-chip, or a system-on-a-chip.

The embodiment of the present application further provides a computer program/program product, the computer program/program product is stored in a storage medium, and the computer program/program product is executed by at least one processor to implement the above encoding method or decoding method The various processes of the embodiment can achieve the same technical effect, so in order to avoid repetition, details are not repeated here.

The embodiment of the present application also provides a codec system, including: an encoding device or a decoding device, the encoding device can be used to perform the steps of the encoding method described above, and the decoding device can be used to perform the decoding method described above A step of.

It should be noted that, in this document, the term "comprising", "comprising" or any other variation thereof is intended to cover a non-exclusive inclusion such that a process, method, article or apparatus comprising a set of elements includes not only those elements, It also includes other elements not expressly listed, or elements inherent in the process, method, article, or device. Without further limitations, an element defined by the phrase "comprising a ..." does not preclude the presence of additional identical elements in the process, method, article, or apparatus comprising that element. In addition, it should be pointed out that the scope of the methods and devices in the embodiments of the present application is not limited to performing functions in the order shown or discussed, and may also include performing functions in a substantially simultaneous manner or in reverse order according to the functions involved. Functions are performed, for example, the described methods may be performed in an order different from that described, and various steps may also be added, omitted, or combined. Additionally, features described with reference to certain examples may be implemented in other examples combination.

Through the description of the above embodiments, those skilled in the art can clearly understand that the methods of the above embodiments can be implemented by means of software plus a necessary general-purpose hardware platform, and of course also by hardware, but in many cases the former is better implementation. Based on such an understanding, the technical solution of the present application can be embodied in the form of computer software products, which are stored in a storage medium (such as ROM/RAM, magnetic disk, etc.) , CD-ROM), including several instructions to make a terminal (which may be a mobile phone, a computer, a server, an air conditioner, or a network device, etc.) execute the methods described in the various embodiments of the present application.

The embodiments of the present application have been described above in conjunction with the accompanying drawings, but the present application is not limited to the above-mentioned specific implementations. The above-mentioned specific implementations are only illustrative and not restrictive. Those of ordinary skill in the art will Under the inspiration of this application, without departing from the purpose of this application and the scope of protection of the claims, many forms can also be made, all of which belong to the protection of this application.

Claims

An encoding method comprising:

The encoding end determines the vertices to be sorted in the first space range according to the spatial angles of adjacent triangle patches in the three-dimensional grid, and the first space range is the space where the target vertices of the triangles to be encoded in the three-dimensional grid are located range, and the vertex to be sorted includes the target vertex;

The encoding end sorts the vertices to be sorted to obtain the sorting information of the target vertices;

The encoding end obtains the encoding information of the triangle to be encoded according to the encoding information corresponding to the sorting information of the target vertices.
The method according to claim 1, wherein, before the encoding end determines the first spatial range, further comprising:

The encoding end selects a first edge from an edge set corresponding to a three-dimensional grid, wherein the edge set is a set of at least one edge of an encoded triangle in the three-dimensional grid;

The encoding end determines the triangle to be encoded according to the first side and the vertex corresponding to the first side, wherein the target vertex of the triangle to be encoded is the vertex corresponding to the first side divided by the vertex corresponding to the first side Vertices other than the two vertices connected by one side.
The method according to claim 2, wherein the encoding end determines the vertices to be sorted in the first spatial range according to the spatial angles of adjacent triangular patches in the three-dimensional mesh, including:

The encoding end determines the vertices to be sorted in the first space range according to the spatial angles of adjacent triangle patches in the three-dimensional mesh when the triangle to be encoded is a triangle other than the preset category of triangles.
The method according to claim 2, further comprising:

The encoding end obtains the encoding information of the triangle to be encoded according to the encoding information corresponding to the target vertex information of the triangle to be encoded when the triangle to be encoded is a triangle of a preset category.
The method according to claim 3 or 4, wherein the preset category triangles include at least one of the following:

The angle between the encoded triangle and the triangle is smaller than the preset angle;

A triangle with two vertices coincident or three vertices collinear.
The method according to claim 3 or 4, wherein, after obtaining the encoding information of the triangle to be encoded, the method further comprises:

The encoder updates the edge set according to a first preset rule;

The encoding end re-determines the triangle to be encoded according to the updated edge set, until all the triangles in the three-dimensional grid obtain encoding information;

Wherein, the first preset rule includes: adding two sides of the triangle to be encoded except the first side to the side set, and removing the first side from the side set side.
The method according to claim 1, wherein the encoding end determines the vertices to be sorted in the first spatial range according to the spatial angles of adjacent triangular patches in the three-dimensional mesh, including:

The encoding end excludes all vertices of the first target triangle from the vertices within the first space range to obtain the remaining vertices;

The encoding end determines vertices to be sorted in the first space range according to the remaining vertices;

Wherein, the first target triangle is a triangle whose included angle with an adjacent encoded triangle is smaller than an included angle threshold, and one side of the first target triangle is the same as the first side of the triangle to be encoded.
The method according to claim 7, wherein the encoding information of the triangle to be encoded further includes: encoding information of the included angle threshold.
The method according to claim 1, further comprising:

Encoding the target vertex information of the triangle to be encoded within a second spatial range to obtain the encoded information of the triangle to be encoded, where the second spatial range is a range in the three-dimensional grid other than the first spatial range.
The method according to claim 1, wherein the first spatial extent comprises:

the spatial extent between the first sphere and the second sphere;

Wherein, the center of the first sphere and the second sphere are the same, the radius of the first sphere is different from the radius of the second sphere, and the center of the sphere is the target in the first side of the triangle to be encoded Location.
The method according to claim 1, wherein the encoding information of the triangle to be encoded further includes encoding information of the first spatial range.
A decoding method comprising:

The decoding end decodes the target code stream to obtain decoding information;

When the decoding information includes the ordering information of the target vertices, the decoding end determines the vertices to be sorted in the first space range according to the spatial angles of adjacent triangular patches in the three-dimensional mesh, and the vertices to be sorted Sorting, wherein the sorting information is the sequence number of the target vertex in the vertices to be sorted within the first spatial range, and the first spatial range is the spatial range where the target vertex of the triangle to be decoded in the three-dimensional mesh is located;

The decoding end determines the target vertex of the triangle to be decoded among the vertices to be sorted according to the sorting result of the vertices to be sorted and the sorting information of the target vertex.
The method according to claim 12, further comprising:

If the decoding information includes vertex information of the target vertex, the decoding end determines the target vertex of the triangle to be decoded according to the vertex information.
The method according to claim 12, further comprising:

Acquiring target vertex information of triangles to be decoded within a second spatial range according to the decoding information, where the second spatial range is a range in the three-dimensional grid other than the first spatial range;

Determine the target vertex of the triangle to be decoded according to the target vertex information.
The method according to claim 12, 13 or 14, wherein, after the decoding end determines the target vertex of the triangle to be decoded, further comprising:

The decoding end determines the triangle to be decoded according to the target vertex and the first side of the triangle to be decoded;

Wherein, the first edge is selected by the decoding end from an edge set corresponding to the three-dimensional mesh, and the edge set is a set of at least one edge of a decoded triangle in the three-dimensional mesh.
The method according to claim 15, wherein, after the decoding end determines the triangle to be decoded, further comprising:

The decoding end updates the edge set according to a second preset rule;

The decoding end re-determines the first edge according to the updated edge set until each triangle in the three-dimensional mesh is determined;

Wherein, the second preset rule includes: adding two sides of the triangle to be decoded except the first side to the set of sides, and removing the first side from the set of sides. side.
The method according to claim 12, wherein the decoding end according to the phase in the three-dimensional grid The space angle between adjacent triangular faces determines the vertices to be sorted within the first space range, including:

The decoding end excludes all vertices of the second target triangle from the vertices within the first spatial range to obtain the remaining vertices;

The decoding end determines vertices to be sorted in the first space range according to the remaining vertices;

Wherein, the second target triangle is a triangle whose included angle with an adjacent decoded triangle is smaller than an included angle threshold, and one side of the second target triangle is the same as the first side of the triangle to be decoded.
The method according to claim 17, further comprising:

According to the decoded information, information about the included angle threshold is acquired.
The method of claim 12, wherein the first spatial extent comprises:

the spatial extent between the first sphere and the second sphere;

Wherein, the center of the first sphere and the second sphere are the same, the radius of the first sphere is different from the radius of the second sphere, and the center of the sphere is the target in the first side of the triangle to be decoded Location.
The method according to claim 12 or 19, further comprising:

Acquire information of the first spatial range according to the decoded information.
An encoding device comprising:

The first determination module is used to determine the vertices to be sorted in the first spatial range according to the spatial angles of adjacent triangular patches in the three-dimensional grid, and the first spatial range is the triangle to be encoded in the three-dimensional grid The spatial range where the target vertex is located, and the vertices to be sorted include the target vertex;

A first acquisition module, configured to sort the vertices to be sorted, and obtain the sorting information of the target vertices;

The second acquiring module is configured to obtain the encoding information of the triangle to be encoded according to the encoding information corresponding to the sorting information of the target vertices.
A decoding device, comprising:

The third acquisition module is used to decode the target code stream to obtain decoding information;

The fourth acquisition module is used to determine the vertices to be sorted in the first space range according to the spatial angles of adjacent triangular faces in the three-dimensional mesh when the decoding information includes the sorting information of the target vertices, and to the The vertices to be sorted are sorted, wherein the sorting information is that the target vertex is in the first The serial numbers in the vertices to be sorted in the spatial range, the first spatial range is the spatial range where the target vertex of the triangle to be decoded is located in the three-dimensional grid;

The second determination module is configured to determine, among the vertices to be sorted, the target vertex of the triangle to be decoded according to the sorting result of the vertices to be sorted and the sorting information of the target vertex.
A communication device, comprising a processor and a memory, the memory stores programs or instructions that can run on the processor, and when the programs or instructions are executed by the processor, any one of claims 1 to 11 is implemented The steps of the encoding method, or the steps of the decoding method according to any one of claims 12 to 20.
A communication device, comprising a processor and a memory, the memory stores programs or instructions that can run on the processor, and when the programs or instructions are executed by the processor, any one of claims 1 to 11 is implemented The steps of the encoding method, or the steps of the decoding method according to any one of claims 12 to 20.
A readable storage medium, on which a program or instruction is stored, and when the program or instruction is executed by a processor, the steps of the encoding method according to any one of claims 1 to 11 are realized, or the steps of the encoding method as described in any one of claims 1 to 11 are realized, or The steps of the decoding method described in any one of claims 12 to 20.