Mesh patch subdivision

Abstract

This document describes a method for post-processing the decoded mesh and modifying the triangles received per patch to improve the geometry of the mesh. Since the transmitted geometry contains high-resolution surface information, it can be applied to a mesh reconstruction operation to generate triangles aligned with the original surface. The method includes splitting the edges of the received triangles according to size, inserting new vertices at the triangle centroids, splitting the vertices, and generating new triangles by performing marching cubes within the surface defined by the geometry image.

Description

Technical Field

[0001] [Cross - reference to Related Applications] This application claims priority under 35 U.S.C. § 119 to U.S. Provisional Patent Application No. 63 / 269,906, entitled "MESH PATCH SUB - DIVISION", filed on March 25, 2022, and this document is hereby incorporated by reference in its entirety for all purposes.

[0002] The present invention relates to 3D graphics. Specifically, the present invention relates to the encoding of 3D graphics.

Background Art

[0003] In recent years, new methods for compressing volumetric content such as point clouds based on projections from 3D to 2D have been standardized. This method, also known as V3C (Visual Volumetric Video - based Compression), maps 3D volumetric data onto several 2D patches, then further composes these patches into an atlas image, and then encodes it with a video encoder. The atlas image corresponds to the geometry of the points, their respective textures, and an occupancy map indicating which positions should be considered for point cloud reconstruction.

[0004] In 2017, MPEG issued a call for proposals (CfP) for point cloud compression. Currently, after evaluating several proposals, MPEG is considering two different point cloud compression techniques: a 3D native encoding technique (based on octrees and similar encoding methods) or one that performs conventional video encoding after 3D-to-2D projection. For dynamic 3D scenes, MPEG uses a test model software (TMC2) based on patch surface modeling, projection of patches from 3D to 2D images, and encoding of the 2D images using a video encoder such as HEVC. This method has been shown to be more efficient than native 3D encoding and to achieve competitive bitrates with acceptable quality. [Overview of the project] [Problems that the invention aims to solve]

[0005] Following the success of projection-based 3D point cloud coding (also known as video-based methods or V-PCC), this standard is expected to include further 3D data, such as 3D meshes, in future versions. However, the current version of this standard is only suitable for transmitting a series of unconnected points and therefore lacks a mechanism for transmitting the point connectivity required for 3D mesh compression.

[0006] Methods have also been proposed to extend the functionality of V-PCC to meshes. One possible method is to encode vertices using V-PCC and then encode connectivity using a mesh compression method such as TFAN or Edgebreaker. The limitation of this method is that the original mesh must be dense so that the point cloud generated from the vertices can be efficiently encoded after projection without becoming sparse. Furthermore, since the order of vertices affects the encoding of connectivity, different methods have been proposed to reorganize mesh connectivity. Another method for encoding sparse meshes is to encode vertex positions in 3D using RAW patch data. Since RAW patches directly encode (x,y,z), in this method all vertices are encoded as RAW data, while connectivity is encoded by a similar mesh compression method as described above. Note that RAW patches can transmit vertices in any preferred order, and therefore the order resulting from connectivity encoding can be used. While this method can encode sparse point clouds, RAW patches are inefficient at encoding 3D data, and further data such as triangular face attributes may be lost from this method. [Means for solving the problem]

[0007] This specification describes a method for post-processing a decoded mesh to improve the mesh geometry by modifying the received triangles patch by patch. Since the transmitted geometry contains high-resolution surface information, this information can be applied to the mesh reconstruction operation to generate triangles aligned with the original surface. The method includes generating new triangles by subdividing the edges of the received triangles according to their size, inserting new vertices at the centroids of the triangles, subdividing vertices, and performing marching cubes within the surface defined by the geometry image.

[0008] In one embodiment, a method programmed into the device's non-temporary memory includes the steps of: receiving a face list and a vertex list; receiving a high-resolution depth map; implementing patch mesh subdivision to generate a new face list and a new vertex list; and implementing 3D reconstruction using the new face list and the new vertex list to generate a decoded mesh object. The step of implementing patch mesh subdivision to generate the new face list and the new vertex list includes a triangle centroid implementation by placing a point in the center of each triangle and using the point to draw lines from the point to each vertex of the triangle to generate a new triangle. The position of the point is obtained using the high-resolution depth map. The step of implementing patch mesh subdivision to generate the new face list and the new vertex list includes an edge midpoint implementation by placing a point in the center of each edge of a triangle and drawing lines from each point to another midpoint of the triangle to generate four triangles. The 3D position of each point is obtained using the high-resolution depth map. The step of implementing patch mesh subdivision to generate the new face list and the new vertex list includes a vertex split implementation by removing edges, adding vertices, and drawing lines from existing vertices to the added vertices. The added vertices are positioned based on 3D position information from the high-resolution depth map. The step of implementing patch mesh subdivision to generate the new face list and the new vertex list includes a marching cubes implementation by generating points between boundary triangles using marching cubes. Voxel information in 3D space is obtained from the high-resolution depth map.

[0009] In another embodiment, the device comprises non-temporary memory for storing an application for receiving a face list and a vertex list, receiving a high-resolution depth map, implementing patch mesh refinement to generate a new face list and a new vertex list, and implementing 3D reconstruction using the new face list and the new vertex list to generate a decoded mesh object; and a processor coupled to the memory and configured to process the application. Implementing patch mesh refinement to generate the new face list and the new vertex list includes implementing the centroid of a triangle by placing a point in the center of each triangle and generating a new triangle by drawing lines from the point to each vertex of the triangle using the point. The position of the point is obtained using the high-resolution depth map. Implementing patch mesh refinement to generate the new face list and the new vertex list includes implementing edge midpoints by placing a point in the center of each edge of a triangle and generating four triangles by drawing lines from each point to another midpoint of the triangle. The 3D position of each point is obtained using the high-resolution depth map. Implementing patch mesh refinement to generate the new face list and the new vertex list includes implementing vertex subdivision by removing edges, adding vertices, and drawing lines from existing vertices to the added vertices. The added vertices are positioned based on 3D position information from the high-resolution depth map. Implementing patch mesh refinement to generate the new face list and the new vertex list includes implementing marching cubes by generating points between boundary triangles using marching cubes. Voxel information in 3D space is obtained from the high-resolution depth map.

[0010] In another embodiment, the system comprises an encoder configured to encode content including a list of faces and a list of vertices, and a decoder configured to receive the list of faces and the list of vertices, receive a high-resolution depth map, implement patch mesh subdivision to generate a new list of faces and a new list of vertices, and implement 3D reconstruction using the new list of faces and the new list of vertices to generate a decoded mesh object. Implementing patch mesh subdivision to generate the new list of faces and the new list of vertices includes implementing the centroid of a triangle by placing a point in the center of each triangle and generating a new triangle by drawing lines from the point to each vertex of the triangle using the point. The position of the point is obtained using the high-resolution depth map. Implementing patch mesh subdivision to generate the new list of faces and the new list of vertices includes implementing edge midpoints by placing a point in the center of each edge of a triangle and generating four triangles by drawing lines from each point to another midpoint of the triangle. The 3D position of each point is obtained using the high-resolution depth map. Implementing patch mesh refinement to generate the new face list and the new vertex list includes implementing vertex subdivision by removing edges, adding vertices, and drawing lines from existing vertices to the added vertices. The added vertices are positioned based on 3D position information from the high-resolution depth map. Implementing patch mesh refinement to generate the new face list and the new vertex list includes implementing marching cubes by generating points between boundary triangles using marching cubes. Voxel information in 3D space is obtained from the high-resolution depth map. [Brief explanation of the drawing]

[0011] [Figure 1] This is a flowchart for decoding content using several embodiments. [Figure 2] This diagram shows the implementation of the centroid of a triangle in several embodiments. [Figure 3]This diagram shows the implementation of edge midpoints in several embodiments. [Figure 4] This is a diagram illustrating the implementation of vertex decomposition according to several embodiments. [Figure 5] This is a diagram illustrating the implementation of a marching cube according to several embodiments. [Figure 6] This is a block diagram of an exemplary computer device configured to implement a mesh patch subdivision method according to several embodiments. [Modes for carrying out the invention]

[0012] This specification describes a method for post-processing a decoded mesh to improve the mesh geometry by modifying the received triangles patch by patch. Since the transmitted geometry contains high-resolution surface information, this information can be applied to the mesh reconstruction operation to generate triangles aligned with the original surface. The method includes generating new triangles by subdividing the edges of the received triangles according to their size, inserting new vertices at the centroids of the triangles, subdividing vertices, and performing marching cubes within the surface defined by the geometry image.

[0013] Figure 1 shows flowcharts for decoding content according to several embodiments. The decoder receives a face list and a vertex list 110. The decoder also receives a high-resolution depth map 112. The high-resolution depth map 112 can be used in step 100 to generate a new face list and a new vertex list 114 based on the received face list and vertex list 110 using patch mesh subdivision. Using the high-resolution depth map 112, the new face list and the new vertex list 114, a decoded mesh object 116 can be generated in step 102 using 3D reconstruction. In some embodiments, fewer or additional steps are implemented. In some embodiments, the order of the steps is changed.

[0014] Figure 2 shows diagrams of implementations of the centroid of a triangle according to several embodiments. As shown in Image 200, a list of triangles (e.g., a list of faces and vertices) is received. As shown in Image 202, a point is generated / placed within the triangles (e.g., at the center of each triangle so as to be equidistant from the vertices of the triangles). Using the point placed in each triangle, a new triangle can be generated by generating / drawing lines from that point to each vertex of the triangle. Thus, each triangle with a point placed inside is divided into three new triangles. Edge triangles remain unchanged (e.g., the centroid is used only for non-edge triangles). The 3D position of each point (centroid) is obtained using a high-resolution depth map. For example, the depth of the centroid can be used to determine whether the point is at the same depth or a different depth compared to the vertices of the triangles. A new list of faces and vertices is generated using the new triangles. The mesh object can be reconstructed using the new list of faces and vertices based on the implementation of the centroid of a triangle.

[0015] Figure 3 shows diagrams of edge midpoint implementations according to several embodiments. A list of triangles is received, as shown in Image 300. Points (e.g., vertices) are generated / placed at the center (or some other location) of each edge of several triangles, as shown in Image 302. Each edge (with some exceptions) is split (at the center), and lines are generated / drawn from one (center) point to another, so that each triangle becomes four triangles. Edges at patch boundaries are not allowed to be split. For example, the light dots 304 represent new vertices after edge splitting, and the dark dots 306 represent vertices that are not allowed. The 3D position of each point is obtained using a high-resolution depth map. For example, a high-resolution depth map can be used to determine whether a point is at the same depth or a different depth when compared to a triangle vertex. New face lists and vertex lists are generated using the new triangles. The mesh object can be reconstructed using the new face lists and vertex lists based on the edge midpoint implementation.

[0016] Figure 4 shows diagrams of vertex decomposition implementations according to several embodiments. As shown in Image 400, a list of triangles is received. As shown in Image 402, edges are split or removed, and then new edges are generated for some triangles. For example, two edges 410 of a triangle are removed, and then a new vertex 404 is placed based on 3D position information from a high-resolution depth map. Edges are generated / drawn from the initial vertex 406 to the new vertex 404 to generate a new triangle. A new list of faces and vertices is generated using the new list of faces and vertices based on the vertex decomposition implementation.

[0017] Figure 5 shows diagrams of implementations of the marching cube according to several embodiments. The marching cube is a technique used for surface reconstruction. When only boundary triangles are transmitted (as shown in Figure 500), the marching cube can be used to generate a central point, as shown in Figure 502. 3D position information from a high-resolution depth map is also used to determine the position of new vertices. In the case of the marching cube, voxel information in 3D space is obtained from the high-resolution depth map. New face lists and vertex lists are generated using the new triangles. The mesh object can be reconstructed using the new face lists and vertex lists based on the implementation of the marching cube.

[0018] Figure 6 shows a block diagram of an exemplary computer device configured to implement a mesh patch subdivision method according to several embodiments. The computer device 600 can be used to acquire, store, compute, process, communicate, and / or display information such as images and videos, including 3D content. The computer device 600 can implement any form of encoding / decoding. Generally, a suitable hardware structure for implementing the computer device 600 includes a network interface 602, memory 604, a processor 606, (one or multiple) I / O devices 608, a bus 610, and a storage device 612. The choice of processor is not critical as long as a suitable processor of sufficient speed is selected. The memory 604 can be any conventional computer memory known in the art. The storage device 612 can include a hard drive, CD-ROM, CDRW, DVD, DVDRW, high-definition disk / drive, ultra-high-definition drive, flash memory card, or any other storage device. The computer device 600 can include one or more network interfaces 602. Examples of network interfaces include a network card connected to Ethernet or other types of LANs. The (single or duplicate) I / O devices 608 may include one or more of the following: a keyboard, mouse, monitor, screen, printer, modem, touchscreen, button interface, and other devices. The storage devices 612 and memory 604 store the (single or duplicate) mesh patch subdivision application 630 used to perform the implementation of mesh patch subdivision, and are likely to be processed as the application would normally be processed. The computer device 600 may also include more or fewer components than those shown in Figure 6. In some embodiments, mesh patch subdivision hardware 620 is included. The computer device 600 in Figure 6 includes the application 630 and hardware 620 for the implementation of mesh patch subdivision, but the mesh patch subdivision method may also be implemented on the computer device in hardware, firmware, software, or a combination of these.For example, in some embodiments, the mesh patch subdivision application 630 is programmed in memory and executed using a processor. As another example, in some embodiments, the mesh patch subdivision hardware 620 is programmed hardware logic including gates specially designed to implement the mesh patch subdivision method.

[0019] In some embodiments, the (single or plural) mesh patch subdivision application 630 includes a plurality of applications and / or modules. In some embodiments, a module also includes one or more sub-modules. In some embodiments, fewer or additional modules may also be included.

[0020] Examples of suitable computer devices include personal computers, laptop computers, computer workstations, servers, mainframe computers, handheld computers, personal digital assistants, cellular / mobile phones, smart home appliances, gaming consoles, digital cameras, digital camcorders, camera phones, smartphones, portable music players, tablet computers, mobile devices, video players, video disc recorders / players (e.g., DVD recorders / players, high-definition disc recorders / players, ultra-high-definition disc recorders / players), televisions, home entertainment systems, augmented reality devices, virtual reality devices, smart jewelry (e.g., smart watches), vehicles (e.g., autonomous vehicles), or any other suitable computer device.

[0021] To utilize the mesh patch subdivision method, the device acquires or receives 3D content (e.g., point cloud content). The mesh patch subdivision method can be implemented automatically with or without user assistance or user involvement.

[0022] In operation, the mesh patch subdivision method enables efficient and accurate 3D content decoding compared to previous implementations.

[0023] Some embodiments of mesh patch subdivision 1. A method programmed in a non - transient memory of a device, comprising: receiving a face list and a vertex list; receiving a high - resolution depth map; implementing patch mesh subdivision to generate a new face list and a new vertex list; implementing 3D reconstruction using the new face list and the new vertex list to generate a decoded mesh object. A method as described above.

[0024] 2. The method according to claim 1, wherein the step of implementing patch mesh subdivision to generate the new face list and the new vertex list includes implementing the centroid of a triangle by placing a point at the center of each triangle and drawing lines from the point to each vertex of the triangle to generate new triangles.

[0025] 3. The method according to claim 2, wherein the position of the point is obtained using the high - resolution depth map.

[0026] 4. The method according to claim 1, wherein the step of implementing patch mesh subdivision to generate the new face list and the new vertex list includes implementing the edge mid - point by placing points at the center of each edge of a triangle and drawing lines from each point to another center point of the triangle to generate four triangles.

[0027] 5. The method according to claim 4, wherein the 3D position of each point is obtained using the high - resolution depth map.

[0028] 6. The method according to claim 1, wherein the step of implementing patch mesh subdivision to generate the new face list and the new vertex list includes implementing vertex splitting by removing an edge, adding a vertex, and drawing a line from an existing vertex to the added vertex.

[0029] 7. The method according to paragraph 6, wherein the added vertices are positioned based on the three-dimensional positional information from the high-resolution depth map.

[0030] 8. The method of paragraph 1, wherein the step of implementing patch mesh subdivision to generate the new face list and the new vertex list includes implementing a marching cube by generating points between boundary triangles using a marching cube.

[0031] 9. The method described in paragraph 8, wherein voxel information in 3-dimensional space is obtained from the high-resolution depth map.

[0032] 10. Receive the face list and vertex list, Receive a high-resolution depth map, Implement patch mesh subdivision to generate a new face list and a new vertex list. Using the new face list and the new vertex list, a 3D reconstruction is implemented to generate a decoded mesh object. Non-temporary memory for storing applications, A processor coupled to the memory and configured to process the application, A device equipped with the following features.

[0033] 11. The apparatus described in paragraph 10, which implements patch mesh subdivision to generate the new face list and the new vertex list, including the implementation of the centroid of a triangle by placing a point in the center of each triangle and generating a new triangle by drawing lines from the point to each vertex of the triangle using the point.

[0034] 12. The method according to paragraph 11, wherein the position of the point is obtained using the high-resolution depth map.

[0035] 13. The apparatus described in paragraph 10, which implements patch mesh subdivision to generate the new face list and the new vertex list, including the implementation of edge midpoints by placing a point in the center of each edge of a triangle and drawing lines from each point to another midpoint of the triangle to generate four triangles.

[0036] 14. The apparatus described in paragraph 13, wherein the three-dimensional position of each point is obtained using the high-resolution depth map.

[0037] 15. The apparatus described in paragraph 10, which implements patch mesh subdivision to generate the new face list and the new vertex list, including the implementation of vertex subdivision by removing edges, adding vertices, and drawing lines from existing vertices to the added vertices.

[0038] 16. The apparatus according to paragraph 15, wherein the added vertices are positioned based on three-dimensional positional information from the high-resolution depth map.

[0039] 17. The apparatus described in Section 10, which implements patch mesh subdivision to generate the new face list and the new vertex list, including the implementation of a marching cube by generating points between boundary triangles using a marching cube.

[0040] 18. The apparatus described in Section 17, wherein voxel information in a three-dimensional space is obtained from the high-resolution depth map.

[0041] 19. Encode content including face lists and vertex lists. An encoder configured as follows, Receiving the face list and the vertex list, Receive a high-resolution depth map, Implement patch mesh subdivision to generate a new face list and a new vertex list. Using the new face list and the new vertex list, a 3D reconstruction is implemented to generate a decoded mesh object. A decoder configured as follows, A system equipped with these features.

[0042] 20. Implementing patch mesh subdivision to generate the new face list and the new vertex list is the system described in paragraph 19, which includes implementing the centroid of a triangle by placing a point in the center of each triangle and generating a new triangle by drawing lines from the point to each vertex of the triangle using the point.

[0043] 21. The position of the point is obtained using the high-resolution depth map, as described in Section 20.

[0044] 22. Implementing patch mesh subdivision to generate the new face list and the new vertex list is the system described in paragraph 19, which includes implementing edge midpoints by placing a point in the center of each edge of a triangle and drawing lines from each point to another midpoint of the triangle to generate four triangles.

[0045] 23. The system described in Section 22, wherein the three-dimensional position of each point is obtained using the high-resolution depth map.

[0046] 24. The system described in paragraph 19, which implements patch mesh subdivision to generate the new face list and the new vertex list, including the implementation of vertex subdivision by removing edges, adding vertices, and drawing lines from existing vertices to the added vertices.

[0047] 25. The system according to paragraph 24, wherein the added vertices are positioned based on the three-dimensional positional information from the high-resolution depth map.

[0048] 26. Implementing patch mesh subdivision to generate the new face list and the new vertex list is the system described in Section 19, which includes an implementation of a marching cube by generating points between boundary triangles using a marching cube.

[0049] 27. The system described in Section 26, wherein voxel information in 3D space is obtained from the high-resolution depth map.

[0050] The present invention has been described in relation to specific embodiments, including details, to facilitate understanding of its structure and operating principles. Such references to specific embodiments and their details herein are not intended to limit the claims appended herein. It will be readily apparent to those skilled in the art that various other modifications can be made to the embodiments selected for illustrative purposes without departing from the spirit and scope of the invention as defined by the claims. [Explanation of symbols]

[0051] 100 patch mesh subdivision 102 3D reconstruction 110 Face List and Vertex List 112 High-resolution depth map 114 New face list and new vertex list 116 Decoded Mesh Objects 200 images 202 images 300 images 302 images 304 Bright Dots 306 dark dots 400 images 402 Images 404 A New Peak 406 initial vertices 410 Edge 500 images 502 images 600 Computer devices 602 Network Interface 604 memory 606 Processor 608 I / O devices 610 Bus 612 Storage device 620 Mesh Patch Subdivision Hardware 630 Mesh Patch Subdivision Application

Claims

1. A method programmed into the device's non-temporary memory, Steps include receiving a list of faces and a list of vertices, The steps include receiving a high-resolution depth map, The steps include: implementing patch mesh subdivision to generate a new face list and a new vertex list; The steps include: implementing a three-dimensional reconstruction using the new face list and the new vertex list to generate a decoded mesh object; Includes, The step of implementing patch mesh subdivision to generate the new face list and the new vertex list includes triangle centroid implementation by placing a point in the center of each triangle and generating new triangles by drawing lines from the point to each vertex of the triangle using the point, The position of the aforementioned point is obtained using the high-resolution depth map. A method characterized by the following:

2. A method programmed into the non-temporary memory of the device, Steps include receiving a list of faces and a list of vertices, The steps include receiving a high-resolution depth map, The steps include: implementing patch mesh subdivision to generate a new face list and a new vertex list; The steps include: implementing a three-dimensional reconstruction using the new face list and the new vertex list to generate a decoded mesh object; Includes, The step of implementing patch mesh subdivision to generate the new face list and the new vertex list includes edge midpoint implementation by placing a point at the center of each edge of a triangle and drawing lines from each point to another midpoint of the triangle to generate four triangles, A method characterized in that the three-dimensional position of each point is obtained using the high-resolution depth map.

3. A method programmed into the non-temporary memory of the device, Steps include receiving a list of faces and a list of vertices, The steps include receiving a high-resolution depth map, The steps include: implementing patch mesh subdivision to generate a new face list and a new vertex list; The steps include: implementing a three-dimensional reconstruction using the new face list and the new vertex list to generate a decoded mesh object; Includes, The step of implementing patch mesh subdivision to generate the new face list and the new vertex list includes vertex split implementation by removing edges, adding vertices, and drawing lines from existing vertices to the added vertices, A method characterized in that the added vertices are positioned based on three-dimensional positional information from the high-resolution depth map.

4. A method programmed into the non-temporary memory of the device, Steps include receiving a list of faces and a list of vertices, The steps include receiving a high-resolution depth map, The steps include: implementing patch mesh subdivision to generate a new face list and a new vertex list; The steps include: implementing a three-dimensional reconstruction using the new face list and the new vertex list to generate a decoded mesh object; Includes, The step of implementing patch mesh subdivision to generate the new face list and the new vertex list includes a marching cube implementation by generating points between boundary triangles using marching cubes, A method characterized in that voxel information in a three-dimensional space is obtained from the high-resolution depth map.

5. It receives a list of faces and a list of vertices, Receive a high-resolution depth map, Implement patch mesh subdivision to generate a new face list and a new vertex list. Using the new face list and the new vertex list, a 3D reconstruction is implemented to generate a decoded mesh object. Non-temporary memory for storing applications, A processor coupled to the memory and configured to process the application, Equipped with, Implementing patch mesh subdivision to generate the new face list and the new vertex list includes implementing the centroid of a triangle by placing a point in the center of each triangle and generating a new triangle by drawing lines from the point to each vertex of the triangle using the point, The apparatus is characterized in that the position of the point is obtained using the high-resolution depth map.

6. A face list and a vertex list are received, Receive a high-resolution depth map, Implement patch mesh subdivision to generate a new face list and a new vertex list. Using the new face list and the new vertex list, a 3D reconstruction is implemented to generate a decoded mesh object. Non-temporary memory for storing applications, A processor coupled to the memory and configured to process the application, Equipped with, Implementing patch mesh subdivision to generate the new face list and the new vertex list includes implementing edge midpoints by placing a point in the center of each edge of a triangle and drawing lines from each point to another midpoint of the triangle to generate four triangles, The apparatus is characterized in that the three-dimensional position of each point is acquired using the high-resolution depth map.

7. A face list and a vertex list are received, Receive a high-resolution depth map, Implement patch mesh subdivision to generate a new face list and a new vertex list. Using the new face list and the new vertex list, a 3D reconstruction is implemented to generate a decoded mesh object. Non-temporary memory for storing applications, A processor coupled to the memory and configured to process the application, Equipped with, Implementing patch mesh subdivision to generate the new face list and the new vertex list includes implementing vertex subdivision by removing edges, adding vertices, and drawing lines from existing vertices to the added vertices, The apparatus is characterized in that the added vertices are arranged based on three-dimensional positional information from the high-resolution depth map.

8. A face list and a vertex list are received, Receive a high-resolution depth map, Implement patch mesh subdivision to generate a new face list and a new vertex list. Using the new face list and the new vertex list, a 3D reconstruction is implemented to generate a decoded mesh object. Non-temporary memory for storing applications, A processor coupled to the memory and configured to process the application, Equipped with, Implementing patch mesh subdivision to generate the new face list and the new vertex list includes implementing a marching cube by generating points between boundary triangles using a marching cube, An apparatus characterized in that voxel information in a three-dimensional space is obtained from the high-resolution depth map.

9. Encodes content including face lists and vertex lists. An encoder configured as follows, Receiving the face list and the vertex list, Receive a high-resolution depth map, Implement patch mesh subdivision to generate a new face list and a new vertex list. Using the new face list and the new vertex list, a 3D reconstruction is implemented to generate a decoded mesh object. A decoder configured as follows, Equipped with, Implementing patch mesh subdivision to generate the new face list and the new vertex list includes implementing the centroid of a triangle by placing a point in the center of each triangle and generating a new triangle by drawing lines from the point to each vertex of the triangle using the point, The system is characterized in that the position of the point is obtained using the high-resolution depth map.

10. Encoding content including a face list and a vertex list, An encoder configured as follows, Receiving the face list and the vertex list, Receive a high-resolution depth map, Implement patch mesh subdivision to generate a new face list and a new vertex list. Using the new face list and the new vertex list, a 3D reconstruction is implemented to generate a decoded mesh object. A decoder configured as follows, Equipped with, Implementing patch mesh subdivision to generate the new face list and the new vertex list includes implementing edge midpoints by placing a point in the center of each edge of a triangle and drawing lines from each point to another midpoint of the triangle to generate four triangles, The system is characterized in that the three-dimensional position of each point is obtained using the high-resolution depth map.

11. Encoding content including a list of faces and a list of vertices, An encoder configured as follows, Receiving the face list and the vertex list, Receive a high-resolution depth map, Implement patch mesh subdivision to generate a new face list and a new vertex list. Using the new face list and the new vertex list, a 3D reconstruction is implemented to generate a decoded mesh object. A decoder configured as follows, Equipped with, Implementing patch mesh subdivision to generate the new face list and the new vertex list includes implementing vertex subdivision by removing edges, adding vertices, and drawing lines from existing vertices to the added vertices, The system is characterized in that the added vertices are positioned based on three-dimensional positional information from the high-resolution depth map.

12. Encoding content including a face list and a vertex list, An encoder configured as follows, Receiving the face list and the vertex list, Receive a high-resolution depth map, Implement patch mesh subdivision to generate a new face list and a new vertex list. Using the new face list and the new vertex list, a 3D reconstruction is implemented to generate a decoded mesh object. A decoder configured as follows, Equipped with, Implementing patch mesh subdivision to generate the new face list and the new vertex list includes implementing a marching cube by generating points between boundary triangles using a marching cube, A system characterized in that voxel information in a three-dimensional space is obtained from the high-resolution depth map.

Images