Skin penetration repair method, system and computer equipment

Abstract

The embodiment of the present application provides a skin interlacing repair method, system and computer device. For each target animation frame in which an interlacing area is detected in a three-dimensional animation, the first model data of the first skin model and the second model data of the second skin model of the target virtual character in the target animation frame are obtained, and then the interlacing area between the first skin model and the second skin model in each of the target animation frames is detected according to the first model data and the second model data, and a vertex set consisting of skin vertices in the interlacing area is obtained. Finally, each skin vertex in the vertex set is weighted and optimized to achieve skin interlacing repair of the three-dimensional animation. In this way, automatic repair of skin interlacing problems can be achieved, which can greatly reduce the workload of manual repair and significantly reduce the binding workload of the target virtual character, so as to obtain a better skin driving effect and reduce the binding cost and threshold of the target virtual character.

Description

Technical Field

[0001] The present application relates to the technical fields of computer graphics, images, animation processing and three-dimensional virtual digital related fields, and in particular, to a skin penetration repair method, system and computer equipment. Background Art

[0002] In the three-dimensional animation design based on computer graphics and image technology or related application scenarios of three-dimensional virtual digital technology, skin binding is an extremely important and critical link. Taking the animation character design of three-dimensional virtual digital characters as an example, the skin binding of three-dimensional virtual digital characters requires a lot of energy and time to obtain the animation effects that meet the requirements. Even professional artists cannot guarantee the binding effect. In particular, in the process of skin binding, the quality of skin binding will directly affect the effect of the animation, and in the process of skin binding, the problem of skin interlacing is a very common technical problem that affects the final animation effect. Based on this, how to effectively solve the problem of skin interlacing is a technical problem that technicians in this field urgently need to solve. Summary of the invention

[0003] Based on the above, in a first aspect, an embodiment of the present application provides a skin insertion repair method, the method comprising:

[0004] Determine a target animation frame for interlaced area detection from the three-dimensional animation;

[0005] For each of the target animation frames, obtaining first model data of a first skin model and second model data of a second skin model of a target virtual character in the target animation frame, wherein the first skin model and the second skin model are bound to form the target virtual character displayed in the three-dimensional animation;

[0006] Detecting an interlaced area between the first skin model and the second skin model in each of the target animation frames according to the first model data and the second model data;

[0007] According to the detected interleaving area between the first skin model and the second skin model in each of the target animation frames, a vertex set consisting of skin vertices in the interleaving area is obtained;

[0008] The weight of each skin vertex in the vertex set is optimized to achieve skin interlacing repair of the three-dimensional animation.

[0009] In an alternative implementation of the first aspect, detecting an interlaced area between the first skin model and the second skin model in each of the target animation frames according to the first model data and the second model data includes:

[0010] According to the first model data and the second model data, respectively, the mesh patches in the first skin model are converted into first triangular mesh patches, and the mesh patches in the second skin model are converted into second triangular mesh patches;

[0011] Detecting a pair of triangular mesh facets at which a first triangular mesh facet in the first skin model intersects with a second triangular mesh facet in the second skin model;

[0012] An interlaced region between the first skin model and the second skin model is obtained according to the detected intersecting triangular mesh facet pairs.

[0013] In an alternative implementation of the first aspect, detecting a triangular mesh face pair in which a first triangular mesh face in the first skin model and a second triangular mesh face in the second skin model intersect, includes:

[0014] Obtaining a first-level bounding volume corresponding to the first skin model according to the first triangular mesh surface patch of the first skin model, wherein the first-level bounding volume includes a plurality of levels of first bounding volumes, and each first bounding volume in each level includes at least one first triangular mesh surface patch;

[0015] Obtaining a second-level bounding volume corresponding to the second skin model according to the second triangular mesh surface patch of the second skin model, wherein the second-level bounding volume includes a plurality of levels of second bounding volumes, and each second bounding volume in each level includes at least one second triangular mesh surface patch;

[0016] According to the hierarchical relationship between the first-level bounding volume and the second-level bounding volume, respectively establish a first bounding volume topological structure corresponding to the first-level bounding volume and a second bounding volume topological structure corresponding to the second-level bounding volume;

[0017] Traversing each topological node in the first enclosing volume topological structure and the second enclosing volume topological structure in order from top to bottom, and comparing and analyzing the first enclosing volume corresponding to each topological node in the first enclosing volume topological structure with the second enclosing volume corresponding to the second enclosing volume topological structure;

[0018] For each traversal process, determine whether the first enclosing volume and the second enclosing volume in the current traversal process intersect. If they intersect, enter the comparison and analysis process of the next topological node until the intersecting first triangular mesh facets and the second triangular mesh facets are analyzed to obtain a pair of triangular mesh facets with intersection; if they do not intersect, end the traversal process of other topological nodes under the topological nodes corresponding to the first enclosing volume and the second enclosing volume currently traversed.

[0019] In an alternative implementation of the first aspect, detecting a triangular mesh face pair in which a first triangular mesh face in the first skin model and a second triangular mesh face in the second skin model intersect, includes:

[0020] According to the adjacency relationship between each first triangular mesh face in the first skin model and each second triangular mesh face in the second skin model, binding each first triangular mesh face with a corresponding second triangular mesh face to form a triangular mesh face pair;

[0021] Each of the triangular mesh face pairs is traversed in turn to detect whether a first triangular mesh face and a second triangular mesh face in the triangular mesh face pair have an intersection.

[0022] According to an alternative implementation of the first aspect, obtaining an interlaced region between the first skin model and the second skin model according to detected intersecting triangular mesh facet pairs includes:

[0023] Obtaining the intersection points of the first triangular mesh patch and the second triangular mesh patch in each detected triangular mesh patch pair as interlaced boundary points, wherein each interlaced boundary point is an intersection point of the boundary between a first triangular mesh patch and a corresponding second triangular mesh patch;

[0024] According to the adjacency relationship between each pair of triangular mesh faces, the interpenetration area between the first skin model and the second skin model is obtained according to each of the interpenetration boundary points obtained above.

[0025] In an alternative implementation of the first aspect, the step of weighting each skin vertex in the vertex set to implement skin interlacing repair of the three-dimensional animation includes:

[0026] For each target skin vertex in the vertex set, determine a target triangular mesh patch on the interpenetrating model corresponding to the target skin vertex, wherein when the target skin vertex is located in the first skin model, the interpenetrating model is the second skin model, and when the target skin vertex is located in the second skin model, the interpenetrating model is the first skin model;

[0027] Calculating a weight optimization coefficient of the target skin vertex according to a distance relationship between the target skin vertex and the target triangular mesh face;

[0028] The weight value of the target skin vertex is optimized and obtained according to the weight optimization coefficient and the weight of the skin vertex corresponding to the target triangular mesh face.

[0029] In an alternative implementation of the first aspect, the step of calculating the weight optimization coefficient of the target skin vertex according to the distance relationship between the target skin vertex and the target triangular mesh patch includes:

[0030] When the projection point of the target skin vertex on the plane where the target triangular mesh facet is located is within the target triangular mesh facet, determining the weight optimization coefficient of the target skin vertex according to the distance between the projection point and the target;

[0031] When the projection point of the target skin vertex on the plane where the target triangular mesh facet is located is outside the target triangular mesh facet, the weight optimization coefficient of the target skin vertex is determined according to the distances between the target skin vertex and each vertex of the target triangular mesh facet.

[0032] In an alternative implementation of the first aspect, when the projection point of the target skin vertex on the plane where the target triangular mesh face is located is located within the target triangular mesh face, the weight value of the target skin vertex is calculated according to the following formula:

[0033]

[0034] in, W i is the weight optimization coefficient, when i takes the value of 1, 2, or 3, P i Respectively represent the weight values ​​corresponding to the three skin vertices of the target triangular mesh patch, dist(a′A i ) is the skin vertex A corresponding to the projection point and the target triangular mesh patch i The distance between

[0035] When the projection point of the target skin vertex on the plane where the target triangular mesh patch is located is outside the target triangular mesh patch, the weight value of the target skin vertex is calculated according to the following formula:

[0036]

[0037] in, W i is the weight optimization coefficient, when i takes the value of 1, 2, or 3, P i Respectively represent the weight values ​​corresponding to the three skin vertices of the target triangular mesh patch, dist(aA i ) is the skin vertex A corresponding to the target skin vertex and the target triangular mesh patch i The distance between.

[0038] In a second aspect, the present application further provides a skin penetration repair system, the skin penetration repair system comprising:

[0039] Animation frame determination module, used to determine the target animation frame to be interlaced area detected from the three-dimensional animation;

[0040] A model data acquisition module, for acquiring, for each target animation frame, first model data of a first skin model and second model data of a second skin model of a target virtual character in the target animation frame, wherein the first skin model and the second skin model are bound to form the target virtual character displayed in the three-dimensional animation;

[0041] An interlaced region detection module, configured to detect an interlaced region between the first skin model and the second skin model in each of the target animation frames according to the first model data and the second model data;

[0042] A vertex set obtaining module, for obtaining a vertex set consisting of skin vertices in an interlaced area between the first skin model and the second skin model according to the detected interlaced area between the first skin model and the second skin model in each of the target animation frames;

[0043] The vertex weight optimization module is used to optimize the weight of each skin vertex in the vertex set to achieve skin interlacing repair of the three-dimensional animation.

[0044] In a third aspect, the present application also provides a computer device, comprising a machine-readable storage medium and one or more processors, wherein the machine-readable storage medium stores machine-executable instructions, and when the machine-executable instructions are executed by the one or more processors, the above-mentioned method is implemented.

[0045] Based on the above content of the embodiment of the present application, relative to the prior art, the skin interlacing repair method, system and computer device provided by the embodiment of the present application, for each target animation frame in which the interlacing area is detected in the three-dimensional animation, obtain the first model data of the first skin model of the target virtual character in the target animation frame and the second model data of the second skin model, then detect the interlacing area between the first skin model and the second skin model in each of the target animation frames according to the first model data and the second model data, obtain the vertex set consisting of the skin vertices in the interlacing area, and finally optimize the weight of each skin vertex in the vertex set to achieve the skin interlacing repair of the three-dimensional animation. In this way, when the skin model of the target virtual character in the three-dimensional animation is detected to have skin interlacing, the skin vertices in the skin interlacing area can be automatically weighted optimized to achieve the automatic repair of the skin interlacing problem, which can greatly reduce the workload of manual repair, and significantly reduce the binding workload of the target virtual character, obtain a better skin driving effect, and reduce the binding cost and threshold of the target virtual character. BRIEF DESCRIPTION OF THE DRAWINGS

[0046] In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings required for use in the embodiments will be briefly introduced below. It should be understood that the following drawings only show certain embodiments of the present application and therefore should not be regarded as limiting the scope. For ordinary technicians in this field, other related drawings can be obtained based on these drawings without paying creative work.

[0047] Figure 1 It is a flow chart of the skin penetration repair method provided in the embodiment of the present application.

[0048] Figure 2 yes Figure 1 Schematic diagram of the sub-step flow chart of step S300.

[0049] Figure 3 yes Figure 2 Schematic diagram of the sub-step flow chart of step S320.

[0050] Figure 4 It is a schematic diagram of a hierarchical structure of a first-level enclosing volume provided in an embodiment of the present application.

[0051] Figure 5 It is a schematic diagram of a hierarchical structure of a second-level bounding volume provided by this embodiment.

[0052] Figure 6 It is an exemplary schematic diagram of a first enclosure topology structure provided in this embodiment of the application.

[0053] Figure 7It is an exemplary schematic diagram of a second enclosure topology structure provided in this embodiment of the application.

[0054] Figure 8 A partial schematic diagram of a model patch of a detected interpenetration area provided in an embodiment of the present application.

[0055] Fig. 9 It is a schematic diagram of a computer device for implementing the above-mentioned skin penetration repair method provided in an embodiment of the present application.

[0056] Fig.10 It is a schematic diagram of the functional modules of the skin penetration repair system provided in an embodiment of the present application. DETAILED DESCRIPTION

[0057] In order to make the purpose, technical solution and advantages of the embodiments of the present application clearer, the technical solution in the embodiments of the present application will be clearly and completely 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, rather than all the embodiments. The components of the embodiments of the present application described and shown in the drawings here can be arranged and designed in various different configurations.

[0058] Therefore, the following detailed description of the embodiments of the present application provided in the accompanying drawings is not intended to limit the scope of the present application for which protection is sought, but merely represents selected embodiments of the present application. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in the field without creative work are within the scope of protection of the present application.

[0059] It should be noted that similar reference numerals and letters denote similar items in the following drawings, and therefore, once an item is defined in one drawing, further definition and explanation thereof is not required in subsequent drawings.

[0060] In the description of the present application, the terms “first”, “second”, “third”, etc. are only used to distinguish the descriptions and should not be understood as indicating or implying relative importance.

[0061] In the description of this application, it should also be noted that, unless otherwise clearly specified and limited, the terms "set", "install", "connect", and "connect" should be understood in a broad sense, for example, it can be a fixed connection, a detachable connection, or an integral connection; it can be a mechanical connection or an electrical connection; it can be a direct connection, or it can be indirectly connected through an intermediate medium, or it can be the internal communication of two elements. For ordinary technicians in this field, the specific meanings of the above terms in this application can be understood according to specific circumstances.

[0062] In some specific application scenarios, three-dimensional virtual digital technology has unique advantages and is well used in the industry. For example, in the case of the spread of epidemics caused by infectious diseases, three-dimensional virtual digital technology has gradually been favored by all walks of life. Using virtual customer service to reduce contact between people and improve service quality and teaching level in non-contact scenarios is the focus of attention in every field. For example, in the traditional clothing industry, it is also exploring how to combine virtual digital people with the service content in this field to create a unique virtual image and high-quality service experience. The replicability and customizability of virtual digital people have greatly improved the service level and business experience, simplified the service process, and thus reduced the cost of service. In the future, digital people can be used as a quick carrier to combine artificial intelligence and virtual reality technology to give the industry more personalized and intelligent service content. However, to create a virtual digital image, it takes complex steps, such as modeling of three-dimensional virtual images, manual binding of three-dimensional skeletons, animation of three-dimensional characters, and planning and rendering of scenes. Among them, three-dimensional virtual image skeleton binding and animation are essential links in the production process of virtual digital people. For example, in real-time virtual live broadcast scenarios, skinning and binding are one of the essential links in virtual character animation. With the personalized needs of users for clothing styles and virtual anchor images, skinning and binding of multi-layer clothing or limbs has become a rigid requirement.

[0063] Based on the problems mentioned in the above background technology, the inventor has found through research that skinning binding methods usually include manual binding and automatic skinning. Manual binding is generally done by professional animators manually adjusting the influence range and weight of the bones to achieve good animation effects. Automatic skinning usually processes skin weights with the help of voxels or heat maps. For scenes with relatively high requirements for animation quality, manual binding is generally used, such as film and television special effects. Automatic skinning is generally used in scenes with low requirements for animation quality, such as games. Regardless of the above two methods, the problem of skin interlacing caused by inconsistent skin weights will be encountered, which seriously affects the animation effect. Most of the existing skin interlacing problems need to be solved by manual repair, and the manual repair method requires a lot of manpower and material resources to ensure the repair effect, and it takes a lot of repair time.

[0064] Based on the discovery of the above problems, in order to solve the technical problem of skin interpenetration, the embodiment of the present application provides a method for skin interpenetration detection to detect the skin interpenetration area, and determine the set of skin vertices that need to be optimized and adjusted according to the interpenetration area. Finally, for the set of vertices that need skin adjustment, the skin weight is uniformly adjusted.

[0065] like Figure 1Shown is a flow chart of the skin interlacing repair method provided in an embodiment of the present application. In this embodiment, the method can be executed and implemented by a computer device. The computer device can be a personal computer for implementing three-dimensional animation design, or a background server, etc. For example, as an example, the computer device can be a live broadcast server for providing live broadcast interaction through virtual characters. Alternatively, the computer device can be a personal computer of an animation engineering designer, who designs the corresponding animation character model and uploads it to the live broadcast server, so that the live broadcast server can implement the corresponding virtual character live broadcast service based on the animation character model.

[0066] In detail, Figure 1 As shown, the skin interlacing repair method may include the following steps S100 to S500. Figure 1 The specific content of each step is introduced exemplarily.

[0067] Step S100, determining a target animation frame for interlaced area detection from the three-dimensional animation.

[0068] In this embodiment, the three-dimensional animation can be any type of three-dimensional animation with a three-dimensional virtual character that needs to be skinned and bound. For example, the three-dimensional animation can be a three-dimensional animation for a specific virtual game character, or a three-dimensional animation for a three-dimensional virtual digital person with virtual clothing simulation, or a three-dimensional animation with a three-dimensional virtual animal character. The present application does not limit the specific presentation method of the three-dimensional animation and the specific content included. Further, the target animation frame can be at least one animation frame that is determined in advance and needs to be detected for the interlaced area. As an example, considering that the appearance of the skin interlacing problem is basically generated when the relevant target virtual character in the three-dimensional animation performs a relatively large action, therefore, the target animation frame can be a predetermined animation frame corresponding to the target virtual character performing a specific action. For example, the target animation frame can be an animation frame corresponding to the target virtual character performing kicking, jumping, raising hands, etc. in the three-dimensional animation.

[0069] Step S200: for each target animation frame, obtaining first model data of a first skin model and second model data of a second skin model of a target virtual character in the target animation frame.

[0070] In detail, in this embodiment, the first skin model and the second skin model are bound to form the target virtual character displayed in the three-dimensional animation. Among them, the first model data may include, but is not limited to, vertex data of each skin vertex in the first skin model (such as vertex weight, topological order between vertices), mesh face data (such as skin vertices corresponding to mesh face and topological data corresponding to mesh face), etc. Further, the first skin model and the second skin model can be skin models of different layers covered on the skeleton model of the target virtual character in the three-dimensional animation. For example, as an example, the target virtual character can be a three-dimensional virtual character, the first skin model can be a three-dimensional mesh model of human clothing of the three-dimensional virtual character, and the second skin model can be a three-dimensional mesh model of human skin of the virtual character. The three-dimensional mesh model of human skin can be bound to the human skeleton model, and the three-dimensional mesh model of human clothing can be bound to the three-dimensional mesh model of human skin. In this way, the three-dimensional animation model of the target virtual character can be formed by the human skeleton model, the three-dimensional mesh model of human skin and the three-dimensional mesh model of human clothing.

[0071] Step S300: Detecting an interlaced area between the first skin model and the second skin model in each of the target animation frames according to the first model data and the second model data.

[0072] In a possible implementation of the embodiment of the present application, the interpenetration area may include a first interpenetration area on the first skin model and / or a second interpenetration area on the second skin model. Alternatively, the interpenetration area may be a related patch area detected on either the first skin model or the second skin model where skin interpenetration occurs.

[0073] like Figure 2 As shown, in an alternative implementation of this embodiment, step S300 can be specifically implemented through the following steps S310-S330.

[0074] Step S310: converting mesh patches in the first skin model into first triangular mesh patches and converting mesh patches in the second skin model into second triangular mesh patches according to the first model data and the second model data respectively.

[0075] In detail, in this embodiment, after the first skin model and the second skin model are digitized, they are generally represented by polygonal mesh patches (such as triangular mesh patches, quadrilateral mesh patches, pentagonal mesh patches, etc.). In this embodiment, the mesh patches in the first skin model and the second skin model can be first converted into corresponding triangular mesh patches. It should be understood that if the corresponding mesh patches are already triangular mesh patches, no conversion is performed. If the corresponding mesh patches are polygonal mesh patches including four or more edges, they can be converted into corresponding triangular mesh patches according to the topological order of each skin vertex and each mesh patch in the first skin model and the second skin model.

[0076] Step S320: Detecting triangle mesh face pairs where a first triangle mesh face in the first skin model intersects with a second triangle mesh face in the second skin model.

[0077] Specifically, in this embodiment, in order to improve the detection speed of each triangular mesh face pair, a hierarchical bounding volume can be used to realize the detection of triangular mesh face pairs where the first triangular mesh face in the first skin model and the second triangular mesh face in the second skin model intersect.

[0078] In detail, Figure 3 As shown, the step S320 may include the following contents of S3201-S3207, which are exemplarily described below.

[0079] Step S3201, obtaining a first-level bounding volume corresponding to the first skin model according to the first triangular mesh surface of the first skin model, wherein the first-level bounding volume includes multiple levels of first bounding volumes, and each first bounding volume in each level includes at least one first triangular mesh surface.

[0080] In this embodiment, Figure 4 As shown, it is a schematic diagram of a hierarchical structure of a first-level bounding volume provided by the present embodiment. The first skin model for an animation frame can be represented by a bounding volume A, and the bounding volume A can include multiple different bounding volumes of the next level, such as bounding volumes A1 and A2. Correspondingly, A1 and A2 can respectively include bounding volumes of the next level located at the level where A1 and A2 are located, such as A11, A12, A21, A22, etc. In general, there is an inclusion relationship between the bounding volume of the previous level and the bounding volume of the next level, that is, the bounding volume of the previous level is larger than the bounding volume of the next level. As an example, it can be set in advance that the first bounding volume located at the previous level can only contain a set number (such as 2) of first bounding volumes of the next level, and the first bounding volume of the last level can include a first triangular mesh facet.

[0081] Step S3202: Obtain a second level bounding volume corresponding to the second skin model according to the second triangular mesh facet of the second skin model, wherein the second level bounding volume includes a plurality of levels of second bounding volumes, and each second bounding volume in each level includes at least one second triangular mesh facet.

[0082] In this embodiment, Figure 5 As shown, it is a schematic diagram of a hierarchical structure of a second-level bounding volume provided by this embodiment. In this embodiment, the second skin model for an animation frame can be represented by a bounding volume B, and the bounding volume B can include multiple different bounding volumes of the next level, such as bounding volumes B1 and B2. Correspondingly, B1 and B2 can respectively include bounding volumes of the next level of the level where B1 and B2 are located, such as B11, B12, B21, B22, etc. Similar to the first-level bounding volume, it can also be set in advance that the second bounding volume at the previous level can only contain a set number (such as 2) of second bounding volumes at the next level, and the second bounding volume of the last level can include a second triangular mesh face.

[0083] Step S3203: establishing a first bounding volume topology structure corresponding to the first-level bounding volume and a second bounding volume topology structure corresponding to the second-level bounding volume respectively according to the hierarchical relationship between the first-level bounding volume and the second-level bounding volume.

[0084] In this embodiment, Figure 6 FIG. 1 is an exemplary schematic diagram of a first enclosure topology structure provided in this embodiment. Figure 4 The hierarchical structure of the first-level bounding volume shown can establish a first bounding volume topological structure corresponding to the first-level bounding volume of the first skin model according to the different levels where each first bounding volume is located. For example, the first bounding volume topological structure may include multiple topological nodes, and the node corresponding to the first bounding volume of the non-last level has at least one leaf node, each leaf node corresponds to a first bounding volume of the last level, and the first bounding volume of the last level may include a first triangular mesh face. Furthermore, the first bounding volume may be a hierarchical bounding box (such as a regular polyhedron structure) or a hierarchical bounding sphere with a specific shape, which is not specifically limited.

[0085] Correspondingly, in this embodiment, if Figure 7 FIG. 1 is an exemplary schematic diagram of a second enclosure topology structure provided in this embodiment. Figure 5The hierarchical structure of the second-level bounding volume shown can establish a second bounding volume topological structure corresponding to the second-level bounding volume of the second skin model according to the different levels where each second bounding volume is located. For example, the second bounding volume topological structure may include multiple topological nodes, and the nodes corresponding to the second bounding volumes of the non-last level have at least one leaf node, and each leaf node corresponds to a second bounding volume of the last level, and the second bounding volume of the last level may include a second triangular mesh face. Furthermore, the second bounding volume may be a hierarchical bounding box (such as a regular polyhedron structure) or a hierarchical bounding sphere with a specific shape, which is not specifically limited.

[0086] Exemplarily, the first bounding volume and the second bounding volume may be, but not limited to, an axis-aligned bounding box (AABB) or an oriented bounding volume (OBB).

[0087] Step S3024, traverse each topological node in the first bounding volume topological structure and the second bounding volume topological structure in order from top to bottom, and compare and analyze the first bounding volume corresponding to each topological node in the first bounding volume topological structure with the corresponding second bounding volume in the second bounding volume topological structure.

[0088] Step S3205, for each traversal process, determine whether the first enclosing volume and the second enclosing volume in the current traversal process intersect. If they intersect, enter step S3206 and perform the comparison and analysis process of the next topological node until the intersecting first triangular mesh facets and the second triangular mesh facets are analyzed to obtain a pair of triangular mesh facets with intersection; if they do not intersect, enter step S3207 and end the traversal process of other topological nodes under the topological nodes corresponding to the first enclosing volume and the second enclosing volume currently traversed.

[0089] For example, Figure 6 and Figure 7Take the first bounding volume topological structure and the second bounding volume topological structure shown as an example. When traversing the topological nodes, first, compare and analyze the bounding volume A with the bounding volume B to determine whether the bounding volume A and the bounding volume B intersect. If they do not intersect, it indicates that there is no intersection between the first skin model and the second skin model, and there is no interlacing problem, so the traversal process can be ended directly. If the bounding volume A and the bounding volume B intersect, it indicates that there may be an interlacing problem between the first skin model and the second skin model, then further compare the bounding volume A1 with the bounding volume B1, and compare the bounding volume A2 with the bounding volume B2. If the bounding volume A1 and the bounding volume B1 have an intersection, then the bounding volume of the next level of the bounding volume A1 is further compared with the bounding volume of the next level of the bounding volume B1, and this is performed in sequence until the bounding volume of the leaf node is traversed and the first bounding volume and the second bounding volume of the last level with an intersection (for example, the bounding volume A111 and the bounding volume B111, and the bounding volume A112 and the bounding volume B112, etc.) are determined, and then the triangular mesh facet pairs corresponding to the bounding volumes with an intersection can be determined, for example, the first triangular mesh facet located in the bounding volume A111 and the second triangular mesh facet located in the bounding volume B111 are a triangular mesh facet pair. If the bounding volume A1 and the bounding volume B1 do not have an intersection, the traversal process of all levels of the bounding volumes after the bounding volume A1 and the bounding volume B1 is terminated. Similarly, the processing process between the bounding volume A2 and the bounding volume B2 is the same as the processing process between the bounding volume A1 and the bounding volume B2, and will not be repeated here. Thus, by introducing the hierarchical bounding volume method through the above process, the process of determining the interlaced area can be accelerated, the interlaced detection time of the triangular mesh facets can be greatly reduced, and the computing resources of the computer equipment can be saved.

[0090] Furthermore, in another alternative implementation, step S320 may also be implemented by the following method.

[0091] First, according to the adjacency relationship between each first triangular mesh face in the first skin model and each second triangular mesh face in the second skin model, each of the first triangular mesh faces is respectively bound to a corresponding second triangular mesh face to form a triangular mesh face pair; then, each of the triangular mesh face pairs is traversed in turn to detect whether there is an intersection between the first triangular mesh face and the second triangular mesh face in the triangular mesh face pair.

[0092] Step S330: obtaining an interlaced region between the first skin model and the second skin model according to the detected intersecting triangular mesh facet pairs.

[0093] In this embodiment, the interlaced area may be an area where the first skin model is interlaced into the second skin model, or an area where the second skin model is interlaced into the first skin model, or may include both an area where the first skin model is interlaced into the second skin model and an area where the second skin model is interlaced into the first skin model. In this embodiment, the interlaced area may be one area or multiple areas. For example, Figure 8 , which is a partial schematic diagram of a model facet of an interpenetrating area detected by the present embodiment. In the present embodiment, the interpenetrating area may include an area between a first triangular mesh facet and a second triangular mesh facet that interpenetrate each other, and may also include an area where no triangular mesh facets interpenetrate each other, for example Figure 8 As shown, the interlaced boundary is formed by connecting the boundary points of the interlaced triangular mesh facets. The corresponding interlaced boundary ( Figure 8 The interpenetration area defined by the dotted box in the figure may also include triangular mesh faces that are not interpenetrated.

[0094] As an example, the intersection points of the first triangular mesh patch and the second triangular mesh patch in each detected triangular mesh patch pair can be first obtained as interlaced boundary points, wherein each interlaced boundary point is the intersection point of the boundary between a first triangular mesh patch and a corresponding second triangular mesh patch; then, according to the adjacency relationship between each triangular mesh patch pair, the interlaced area between the first skin model and the second skin model is obtained based on each of the interlaced boundary points obtained above, for example, the interlaced boundary points can be connected end to end to obtain the interlaced area.

[0095] Step S400: obtaining a vertex set consisting of skin vertices in the interlaced area between the first skin model and the second skin model in each of the target animation frames detected.

[0096] In this embodiment, the skin vertices in the interpenetration area may include skin vertices that have interpenetrated, and may also include skin vertices that have not interpenetrated. In this embodiment of the application, in order to facilitate the skin weight repair of the interpenetration area, all skin vertices located in the interpenetration area are added to the vertex set, so as to facilitate the subsequent unified skin vertex optimization for the interpenetration area, so as to achieve skin interpenetration repair for the three-dimensional animation. Figure 8 As shown, when the interpenetrating region is determined to be CR, all skin vertices (such as ABCDEF, etc.) within the interpenetrating region CR may be added to the vertex set to perform subsequent weight optimization of the skin vertices.

[0097] Step S500, weight optimization is performed on each skin vertex in the vertex set to achieve skin interlacing repair of the three-dimensional animation.

[0098] In detail, for step S500, the embodiment of the present application can use Euclidean distance or geodesic method to determine the optimization ratio of weights to achieve weight optimization of each skin vertex in the vertex set. In this way, after the embodiment detects the corresponding interpenetration area through the above-mentioned interpenetration area determination method, the weights of each model vertex within the interpenetration area are uniformly optimized and adjusted, which can make the optimization process of vertex weights faster and at the same time make the repair effect of skin interpenetration problem better.

[0099] Furthermore, in this embodiment, a unified weight optimization is performed for each skin vertex in the interpenetration area. Since there is a connection relationship between the skin vertices on the surface of the three-dimensional model, compared with the traditional weight optimization for a single interpenetration point, ignoring this connection relationship will cause discontinuity in the weights of adjacent interpenetration points, affecting the quality and effect of the skin animation. In this embodiment, all skin vertices in the interpenetration area are uniformly optimized in weight, and the connection relationship between the vertices to be optimized is utilized, so that a smoother skin weight value can be obtained.

[0100] In this embodiment, the weight of the skin vertex may refer to a quantitative parameter of the degree to which the skin vertex of the target virtual character is influenced by each bone of the target virtual character. In terms of distance, if the target virtual character includes multiple bones such as B1, B2, ..., Bn, the weight of the skin vertex may be expressed as W={W1, W2, ..., Wn}, wherein W1, W2, ..., Wn represent the quantitative parameter values ​​of the degree of influence of the skin vertex bones B1, B2, ..., Bn, respectively.

[0101] In a possible implementation of this embodiment, step S500 may be implemented through the following steps S510 - S530 .

[0102] Step S510, for each target skin vertex in the vertex set, determine the target triangular mesh face on the interleaved model corresponding to the target skin vertex. In this embodiment, when the target skin vertex is located in the first skin model, the interleaved model is the second skin model, and when the target skin vertex is located in the second skin model, the interleaved model is the first skin model. The target triangular mesh face can be a triangular mesh face on the interleaved model that is closest to the skin vertex or a triangular mesh face that intersects with the triangular mesh face where the skin vertex is located.

[0103] Step S520: Calculate the weight optimization coefficient of the target skin vertex according to the distance relationship between the target skin vertex and the target triangular mesh patch.

[0104] As an example, in this embodiment, the weight optimization coefficient of the target skin vertex can be calculated according to the projection relationship between the target skin vertex and the target triangular mesh facet.

[0105] For example, when the projection point of the target skin vertex on the plane where the target triangular mesh facet is located is located within the target triangular mesh facet, the weight optimization coefficient of the target skin vertex can be determined according to the distance between the projection point and the vertex of the target triangular mesh facet respectively;

[0106] When the projection point of the target skin vertex on the plane where the target triangular mesh patch is located is outside the target triangular mesh patch, the weight optimization coefficient of the target skin vertex can be determined according to the distance between the target skin vertex and the vertices of the target triangular mesh patch.

[0107] Step S530, optimizing and obtaining the weight value of the target skin vertex according to the weight optimization coefficient and the weight of the skin vertex corresponding to the target triangular mesh face.

[0108] In detail, in a possible implementation, when the projection point of the target skin vertex on the plane where the target triangular mesh face is located is located within the target triangular mesh face, the weight value of the target skin vertex is calculated according to the following formula:

[0109]

[0110] in, W i is the weight optimization coefficient, when i takes the value of 1, 2, or 3, P i Respectively represent the weight values ​​corresponding to the three skin vertices of the target triangular mesh patch, dist(a′A i ) is the skin vertex A corresponding to the projection point and the target triangular mesh patch i When i is 1, 2, or 3, A1, A2, and A3 represent the three skin vertices corresponding to the target triangular mesh patch.

[0111] When the projection point of the target skin vertex on the plane where the target triangular mesh patch is located is outside the target triangular mesh patch, the weight value of the target skin vertex is calculated according to the following formula:

[0112]

[0113] in, W i is the weight optimization coefficient, when i takes the value of 1, 2, or 3, P i Respectively represent the weight values ​​corresponding to the three skin vertices of the target triangular mesh patch, dist(aA i ) is the skin vertex A corresponding to the target skin vertex and the target triangular mesh patch i When i is 1, 2, or 3, A1, A2, and A3 represent the three skin vertices corresponding to the target triangular mesh patch.

[0114] In addition, in this embodiment, after weight optimization is performed on each of the skin vertices to obtain the corresponding optimized weight value, weight smoothing processing can also be performed on each of the skin vertices. For example, the adjacent vertices of each skin vertex in the interlaced area are calculated by using the adjacent relationship between the triangular mesh facets. In this embodiment, other skin vertices that have common edges with the skin vertex can be used as adjacent vertices. For example, weight smoothing for skin vertex P can be achieved through the weight Adj(P) of the adjacent vertices. For example, weight smoothing processing for each of the skin vertices can be achieved through the following formula:

[0115]

[0116] Among them, ω i =||P-Adj i (P)|| -1 , Laplacian (P) uses a combination of weight coefficients for weighted averaging, and U (P) keeps the weight coefficients of all skin vertices in the interlaced area consistent.

[0117] See also Fig. 9 As shown, Fig. 9 1 is a schematic diagram of a computer device for implementing the above-mentioned skin penetration repair method provided by an embodiment of the present application. In detail, the computer device may include one or more processors 110, a machine-readable storage medium 120, and a skin penetration repair system 130. The processor 110 and the machine-readable storage medium 120 may be communicatively connected via a system bus. The machine-readable storage medium 120 stores machine-executable instructions, and the processor 110 implements the above-described skin penetration repair method by reading and executing the machine-executable instructions in the machine-readable storage medium 120.

[0118] The machine-readable storage medium 120 may be, but is not limited to, a random access memory (RAM), a read only memory (ROM), a programmable read-only memory (PROM), an erasable programmable read-only memory (EPROM), an electrically erasable read-only memory (EEPROM), etc. The machine-readable storage medium 120 is used to store a program, and the processor 110 executes the program after receiving an execution instruction.

[0119] The processor 110 may be an integrated circuit chip with signal processing capability. The processor may be, but is not limited to, a general-purpose processor, including a central processing unit (CPU), a network processor (NP), a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field programmable gate array (FPGA), etc.

[0120] Please refer to Fig.10 , is a functional module diagram of the skin penetration repair system 130. In this embodiment, the skin penetration repair system 130 may include one or more software function modules running on the computer device, and these software function modules may be stored in the machine-readable storage medium 120 in the form of computer programs, so that when these software function modules are called and executed by the processor 130, the skin penetration repair method described in the embodiment of the present application can be implemented.

[0121] In detail, the skin penetration repair system 130 includes an animation frame determination module 131 , a model data acquisition module 132 , an penetration area detection module 133 , a vertex set acquisition module 134 , and a vertex weight optimization module 135 .

[0122] The animation frame determination module 131 is used to determine the target animation frame to be interlaced with the region detection from the three-dimensional animation. In this embodiment, the animation frame determination module 131 is used to execute step S100 in the above method embodiment. For details of the animation frame determination module 131, please refer to the above description of the specific content of step S100, which will not be repeated here.

[0123] The model data acquisition module 132 is used to acquire, for each target animation frame, first model data of a first skin model and second model data of a second skin model of a target virtual character in the target animation frame, wherein the first skin model and the second skin model are bound to form the target virtual character displayed in the three-dimensional animation. In this embodiment, the model data acquisition module 132 is used to execute step S200 in the above method embodiment. For details of the model data acquisition module 132, reference can be made to the above description of the specific contents of step S200, which will not be repeated here.

[0124] The interlaced region detection module 133 is used to detect the interlaced region between the first skin model and the second skin model in each of the target animation frames according to the first model data and the second model data. In this embodiment, the interlaced region detection module 133 is used to execute step S300 in the above method embodiment. For details of the interlaced region detection module 133, reference can be made to the above description of the specific content of step S300, which will not be repeated here.

[0125] The vertex set acquisition module 134 is used to obtain a vertex set consisting of skin vertices in the interlaced area between the first skin model and the second skin model in each of the target animation frames detected. In this embodiment, the vertex set acquisition module 134 is used to execute step S400 in the above method embodiment. For details of the vertex set acquisition module 134, please refer to the above description of the specific content of step S400, which will not be repeated here.

[0126] The vertex weight optimization module 135 is used to optimize the weight of each skin vertex in the vertex set to achieve skin interlacing repair of the three-dimensional animation. In this embodiment, the vertex weight optimization module 135 is used to execute step S500 in the above method embodiment. For details of the vertex weight optimization module 135, reference can be made to the above-mentioned specific description of the step S500, which will not be repeated here.

[0127] In summary, the skin interlacing repair method, system and computer device provided in the embodiment of the present application obtain the first model data of the first skin model and the second model data of the second skin model of the target virtual character in the target animation frame for each target animation frame in which the interlacing area is detected, and then detect the interlacing area between the first skin model and the second skin model in each target animation frame according to the first model data and the second model data, and obtain a vertex set consisting of skin vertices in the interlacing area, and finally optimize the weight of each skin vertex in the vertex set to achieve skin interlacing repair of the three-dimensional animation. In this way, when it is detected that the skin model of the target virtual character in the three-dimensional animation has skin interlacing, the skin vertices in the skin interlacing area can be automatically weighted optimized to achieve automatic repair of the skin interlacing problem, which can greatly reduce the workload of manual repair and significantly reduce the workload of binding the target virtual character, obtain a better skin driving effect, and reduce the binding cost and threshold of the target virtual character.

[0128] In the embodiments provided in the present application, it should be understood that the disclosed devices and methods can also be implemented in other ways. The device embodiments described above are merely schematic. For example, the flowcharts and block diagrams in the accompanying drawings show the possible architecture, functions and operations of the devices, methods and computer program products according to the multiple embodiments of the present application. In this regard, each box in the flowchart or block diagram can represent a module, a program segment or a part of a code, and the module, a program segment or a part of a code contains one or more executable instructions for implementing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the box can also occur in a different order from the order marked in the accompanying drawings. For example, two consecutive boxes can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each box in the block diagram and / or the flowchart, and the combination of boxes in the block diagram and / or the flowchart can be implemented with a dedicated hardware-based system that performs a specified function or action, or can be implemented with a combination of dedicated hardware and computer instructions.

[0129] In addition, the functional modules in the various embodiments of the present application may be integrated together to form an independent part, or each module may exist separately, or two or more modules may be integrated to form an independent part.

[0130] If the functions are implemented in the form of software function modules and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application can be essentially or partly embodied in the form of a software product that contributes to the prior art. The computer software product is stored in a storage medium, including several instructions to enable a computer device (which can be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the methods described in each embodiment of the present application. The aforementioned storage medium includes: various media that can store program codes, such as a USB flash drive, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk.

[0131] It should be noted that, in this article, relational terms such as first and second, etc. are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the terms "include", "comprise" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, the elements defined by the sentence "comprise a ..." do not exclude the existence of other identical elements in the process, method, article or device including the elements.

[0132] The above are only various implementations of the present application, but the protection scope of the present application is not limited thereto. Any person skilled in the art who is familiar with the present technical field can easily think of changes or substitutions within the technical scope disclosed in the present application, which should be included in the protection scope of the present application. Therefore, the protection scope of the present application should be based on the protection scope of the claims.

Claims

1. A skin interlacing repair method, characterized in that: The method comprises: Determine a target animation frame for interlaced area detection from the three-dimensional animation; For each of the target animation frames, obtaining first model data of a first skin model and second model data of a second skin model of a target virtual character in the target animation frame, wherein the first skin model and the second skin model are bound to form the target virtual character displayed in the three-dimensional animation; Detecting an interlaced area between the first skin model and the second skin model in each of the target animation frames according to the first model data and the second model data; According to the detected interleaving area between the first skin model and the second skin model in each of the target animation frames, a vertex set consisting of skin vertices in the interleaving area is obtained; Performing weight optimization on each skin vertex in the vertex set to achieve skin interlacing repair of the three-dimensional animation; The step of detecting the interlaced area between the first skin model and the second skin model in each of the target animation frames according to the first model data and the second model data includes: According to the first model data and the second model data, respectively, the mesh patches in the first skin model are converted into first triangular mesh patches, and the mesh patches in the second skin model are converted into second triangular mesh patches; Detecting a pair of triangular mesh facets at which a first triangular mesh facet in the first skin model intersects with a second triangular mesh facet in the second skin model; An interlaced region between the first skin model and the second skin model is obtained according to the detected intersecting triangular mesh facet pairs.

2. The skin penetration repair method according to claim 1, characterized in that: Detecting a triangular mesh patch pair in which a first triangular mesh patch in the first skin model and a second triangular mesh patch in the second skin model intersect, comprising: Obtaining a first-level bounding volume corresponding to the first skin model according to the first triangular mesh surface patch of the first skin model, wherein the first-level bounding volume includes a plurality of levels of first bounding volumes, and each first bounding volume in each level includes at least one first triangular mesh surface patch; Obtaining a second-level bounding volume corresponding to the second skin model according to the second triangular mesh surface patch of the second skin model, wherein the second-level bounding volume includes a plurality of levels of second bounding volumes, and each second bounding volume in each level includes at least one second triangular mesh surface patch; According to the hierarchical relationship between the first-level bounding volume and the second-level bounding volume, respectively establish a first bounding volume topological structure corresponding to the first-level bounding volume and a second bounding volume topological structure corresponding to the second-level bounding volume; Traversing each topological node in the first enclosing volume topological structure and the second enclosing volume topological structure in order from top to bottom, and comparing and analyzing the first enclosing volume corresponding to each topological node in the first enclosing volume topological structure with the second enclosing volume corresponding to the second enclosing volume topological structure; For each traversal process, determine whether the first enclosing volume and the second enclosing volume in the current traversal process intersect. If they intersect, enter the comparison and analysis process of the next topological node until the intersecting first triangular mesh facets and the second triangular mesh facets are analyzed to obtain a pair of triangular mesh facets with intersection; if they do not intersect, end the traversal process of other topological nodes under the topological nodes corresponding to the first enclosing volume and the second enclosing volume currently traversed.

3. The skin penetration repair method according to claim 2, characterized in that: Detecting a triangular mesh patch pair in which a first triangular mesh patch in the first skin model and a second triangular mesh patch in the second skin model intersect, comprising: According to the adjacency relationship between each first triangular mesh face in the first skin model and each second triangular mesh face in the second skin model, binding each first triangular mesh face with a corresponding second triangular mesh face to form a triangular mesh face pair; Each of the triangular mesh face pairs is traversed in turn to detect whether a first triangular mesh face and a second triangular mesh face in the triangular mesh face pair have an intersection.

4. The skin penetration repair method according to any one of claims 2-3, characterized in that: Obtaining an interlaced area between the first skin model and the second skin model according to the detected intersecting triangular mesh facet pairs, comprising: Obtaining the intersection points of the first triangular mesh patch and the second triangular mesh patch in each detected triangular mesh patch pair as interlaced boundary points, wherein each interlaced boundary point is an intersection point of the boundary between a first triangular mesh patch and a corresponding second triangular mesh patch; According to the adjacency relationship between each pair of triangular mesh faces, the interpenetration area between the first skin model and the second skin model is obtained according to each of the interpenetration boundary points obtained above.

5. The skin penetration repair method according to any one of claims 1 to 3, characterized in that: The step of weighting each skin vertex in the vertex set to achieve skin interlacing repair of the three-dimensional animation includes: For each target skin vertex in the vertex set, determine a target triangular mesh patch on the interpenetrating model corresponding to the target skin vertex, wherein when the target skin vertex is located in the first skin model, the interpenetrating model is the second skin model, and when the target skin vertex is located in the second skin model, the interpenetrating model is the first skin model; Calculating a weight optimization coefficient of the target skin vertex according to a distance relationship between the target skin vertex and the target triangular mesh face; The weight value of the target skin vertex is optimized and obtained according to the weight optimization coefficient and the weight of the skin vertex corresponding to the target triangular mesh face.

6. The skin penetration repair method according to claim 5, characterized in that: The step of calculating the weight optimization coefficient of the target skin vertex according to the distance relationship between the target skin vertex and the target triangular mesh patch includes: When the projection point of the target skin vertex on the plane where the target triangular mesh facet is located is within the target triangular mesh facet, determining the weight optimization coefficient of the target skin vertex according to the distance between the projection point and the target; When the projection point of the target skin vertex on the plane where the target triangular mesh facet is located is outside the target triangular mesh facet, the weight optimization coefficient of the target skin vertex is determined according to the distances between the target skin vertex and each vertex of the target triangular mesh facet.

7. The skin penetration repair method according to claim 6, characterized in that: When the projection point of the target skin vertex on the plane where the target triangular mesh patch is located is within the target triangular mesh patch, the weight value of the target skin vertex is calculated according to the following formula: in, W i is the weight optimization coefficient, when i takes the value of 1, 2, or 3, P i Respectively represent the weight values ​​corresponding to the three skin vertices of the target triangular mesh patch, dist(a′A i ) is the skin vertex A corresponding to the projection point and the target triangular mesh patch i The distance between When the projection point of the target skin vertex on the plane where the target triangular mesh patch is located is outside the target triangular mesh patch, the weight value of the target skin vertex is calculated according to the following formula: in, W i is the weight optimization coefficient, when i takes the value of 1, 2, or 3, P i Respectively represent the weight values ​​corresponding to the three skin vertices of the target triangular mesh patch, dist(aA i ) is the skin vertex A corresponding to the target skin vertex and the target triangular mesh patch i The distance between.

8. A skin penetration repair system, characterized in that: The skin penetration repair system comprises: Animation frame determination module, used to determine the target animation frame to be interlaced area detected from the three-dimensional animation; A model data acquisition module, for acquiring, for each target animation frame, first model data of a first skin model and second model data of a second skin model of a target virtual character in the target animation frame, wherein the first skin model and the second skin model are bound to form the target virtual character displayed in the three-dimensional animation; An interlaced region detection module, configured to detect an interlaced region between the first skin model and the second skin model in each of the target animation frames according to the first model data and the second model data; A vertex set obtaining module, for obtaining a vertex set consisting of skin vertices in an interlaced area between the first skin model and the second skin model according to the detected interlaced area between the first skin model and the second skin model in each of the target animation frames; A vertex weight optimization module, used for weight optimization of each skin vertex in the vertex set, so as to achieve skin interlacing repair of the three-dimensional animation; Among them, the interlaced area detection module is specifically used to convert the mesh patches in the first skin model into first triangular mesh patches and convert the mesh patches in the second skin model into second triangular mesh patches according to the first model data and the second model data respectively; detect the triangular mesh patch pairs that have intersections between the first triangular mesh patch in the first skin model and the second triangular mesh patch in the second skin model; and obtain the interlaced area between the first skin model and the second skin model based on the detected triangular mesh patch pairs that have intersections.

9. A computer device, characterized in that: The method comprises a machine-readable storage medium and one or more processors, wherein the machine-readable storage medium stores machine-executable instructions, and when the machine-executable instructions are executed by the one or more processors, the method according to any one of claims 1 to 7 is implemented.

Images