Target object processing method and device, electronic equipment, storage medium and product

Abstract

The invention discloses a target object processing method and device, electronic equipment, a storage medium and a product. The target object processing method comprises the steps that a target object model is acquired, the target object model comprises a plurality of segmented target objects, the target objects are formed by segmenting adjacent initial objects according to a single initial object, the adjacent initial objects are overlapped, the target objects have missing adjacent surfaces, and the adjacent surfaces are adjacent to each other; the form of the missing adjacent surface comprises a semi-open area; for each target object, determining a to-be-repaired area in the semi-open area of the target object; filling the to-be-repaired area to obtain a filled area; and based on the quality attribute of the target object, adjusting the quality attribute of the filled area to obtain an adjusted area. The missing data in the to-be-repaired area in the missing adjacent surface is repaired. After the filling area is obtained, the quality attribute of the filled area is adjusted based on the quality attribute of the target object, so that the quality of the filled area is ensured.

Description

Technical Field

[0001] The present invention relates to the technical field of data processing, and in particular, to a method, device, electronic device, storage medium and product for processing an object. Background Art

[0002] When performing three-dimensional scanning, the adjacent surfaces between objects are often not scanned by the scanning device due to occlusion, resulting in missing data of the adjacent surfaces. For example, after separating a single tooth from the scanned dental model, the adjacent surfaces of adjacent teeth are often not scanned during scanning due to occlusion, so the data of this part is missing.

[0003] However, the loss of data of the adjacent surface will affect the subsequent data processing. Therefore, how to repair the missing data of the adjacent surfaces of adjacent objects is a technical problem that needs to be solved urgently at present. Summary of the Invention

[0004] The present invention provides a method, device, electronic device, storage medium and product for processing an object to repair the missing data of the adjacent surfaces of adjacent objects.

[0005] According to one aspect of the present invention, there is provided a method for processing an object, including:

[0006] Obtaining an object model, where the object model includes a plurality of segmented objects, the object is formed by segmenting adjacent initial objects according to a single initial object, there is an overlap between the adjacent initial objects, the object has a missing adjacent surface, and the form of the missing adjacent surface includes a semi-open area;

[0007] For each object, determining a region to be repaired in the semi-open area of the object;

[0008] Filling the region to be repaired to obtain a filled region;

[0009] Based on the quality attribute of the object, adjusting the quality attribute of the filled region to obtain an adjusted region.

[0010] According to another aspect of the present invention, there is provided a device for processing an object, characterized by including:

[0011] An obtaining module, configured to obtain an object model, where the object model includes a plurality of segmented objects, the object is formed by segmenting adjacent initial objects according to a single initial object, there is an overlap between the adjacent initial objects, the object has a missing adjacent surface, and the form of the missing adjacent surface includes a semi-open area;

[0012] A determining module, configured to determine a region to be repaired in the semi-open area of each object;

[0013] A filling module, configured to fill the area to be repaired to obtain a filled area.

[0014] An adjustment module, configured to adjust the quality attribute of the filled area based on the quality attribute of the target object to obtain an adjusted area.

[0015] According to another aspect of the present invention, there is provided an electronic device, including:

[0016] At least one processor; and

[0017] A memory communicatively connected to the at least one processor; wherein,

[0018] The memory stores a computer program executable by the at least one processor, and when the computer program is executed by the at least one processor, the at least one processor is enabled to execute the method according to any embodiment of the present invention.

[0019] According to another aspect of the present invention, there is provided a computer-readable storage medium storing computer instructions for causing a processor to implement the method according to any embodiment of the present invention when executed.

[0020] According to another aspect of the present invention, there is provided a computer program product, characterized in that the computer program product includes a computer program, and when the computer program is executed by a processor, it implements the method according to any embodiment of the present invention.

[0021] The technical solution of the embodiment of the present invention fills the area to be repaired of each segmented target object in the target object model to obtain a filled area, thereby realizing the repair of the missing data in the area to be repaired in the missing adjacent surface. After obtaining the filled area, the quality attribute of the filled area is adjusted based on the quality attribute of the target object, ensuring the quality of the filled area.

[0022] It should be understood that the content described in this part is not intended to identify the key or important features of the embodiments of the present invention, nor is it used to limit the scope of the present invention. Other features of the present invention will become easily understood through the following description. Description of the Drawings

[0023] In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the following will briefly introduce the drawings required for the description of the embodiments. Obviously, the following drawings are only some embodiments of the present invention. For those of ordinary skill in the art, other drawings can be obtained based on these drawings without creative efforts.

[0024] Figure 1 is a flowchart of a method for processing an object according to Embodiment 1 of the present invention;

[0025] Figure 2 is a flowchart of another method for processing an object according to Embodiment 2 of the present invention;

[0026] Figure 3 is a schematic diagram of an object model after determining boundary information provided in this embodiment;

[0027] Figure 4 is a schematic diagram of an object model after determining a common boundary region provided in this embodiment;

[0028] Figure 5 is an exemplary model of an object model after determining a sealing region provided in Embodiment of the present invention;

[0029] Figure 6 is a schematic diagram of a first region to be repaired provided in Embodiment of the present invention;

[0030] Figure 7 is a schematic diagram after filling the first region to be repaired provided in Embodiment of the present invention;

[0031] Figure 8 is a schematic diagram of a second region to be repaired provided in Embodiment of the present invention;

[0032] Figure 9 is a schematic diagram of the filled second region to be repaired provided in Embodiment of the present invention;

[0033] Figure 10 is a schematic diagram of grid subdivision provided in Embodiment of the present invention;

[0034] Figure 11 is a schematic diagram for determining whether to perform edge swapping provided in Embodiment of the present invention;

[0035] Figure 12 is another schematic diagram for determining edge swapping provided in Embodiment of the present invention;

[0036] Figure 13 is a schematic diagram of a tooth model after grid subdivision provided in Embodiment of the present invention;

[0037] Figure 14 is a schematic diagram of the result after Laplacian smoothing provided in Embodiment of the present invention;

[0038] Figure 15 is a schematic diagram of a final object formed based on the repaired object provided in Embodiment of the present invention;

[0039] Figure 16 It is a schematic diagram of a vertex and its neighboring points provided by an embodiment of the present invention;

[0040] Figure 17 It is a schematic diagram of a smoothed area provided by an embodiment of the present invention;

[0041] Figure 18 It is a schematic structural diagram of an object processing device provided by an embodiment of the present invention;

[0042] Figure 19 It is a schematic structural diagram of an electronic device for implementing the object processing method of an embodiment of the present invention. Detailed implementation manners

[0043] In order to enable those skilled in the art to better understand the solution of the present invention, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only a part of the embodiments of the present invention, rather than all the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative efforts shall fall within the protection scope of the present invention.

[0044] It should be noted that the terms "first", "second", etc. in the specification and claims of the present invention and the above-mentioned drawings are used to distinguish similar objects, and do not necessarily need to describe a specific order or sequence. It should be understood that such data used in appropriate cases can be interchanged so that the embodiments of the present invention described herein can be implemented in an order other than those illustrated or described herein. In addition, the terms "comprising" and "having" and any variations thereof are intended to cover non-exclusive inclusion. For example, a process, method, system, product or device including a series of steps or units does not necessarily have to be limited to those steps or units clearly listed, but may include other steps or units not clearly listed or inherent to these processes, methods, products or devices.

[0045] The present disclosure provides an object processing method, which can be considered as a method for repairing the missing part of the adjacent surface of an object. Taking the object as a tooth as an example. Due to the arrangement structure of the teeth themselves and the limitations of the dental model acquisition technology, effective data cannot be obtained for the adjacent parts between adjacent teeth by traditional methods. The present invention reasonably repairs the missing data in this part, so as to form a smooth transition with the original effective data, and keep the contact relationship between adjacent teeth as being in contact without penetration and seamless.

[0046] Among them, the dental and maxillofacial model can be a digital model. The present invention can obtain dental and maxillofacial data through three-dimensional scanning technology. The dental and maxillofacial data can include an information set of oral structures such as teeth, dental arches, and jaws. The present invention can also obtain a dental and maxillofacial model by simulation means.

[0047] Embodiment 1

[0048] Figure 1 FIG. 7 is a flowchart of a method for processing a target object according to Embodiment 1 of the present invention. This embodiment is applicable to the situation of repairing adjacent surfaces determined in each segmented target object in the target object model. This method can be executed by a target object processing device, which can be implemented in the form of hardware and / or software, and the target object processing device can be configured in an electronic device.

[0049] As Figure 1 shown, the method includes:

[0050] S110. Obtain a target object model.

[0051] The target object model includes a plurality of segmented target objects. The target object is formed by segmenting adjacent initial objects according to a single initial object. There is an overlap between adjacent initial objects, and there is a missing adjacent surface in the target object. The form of the missing adjacent surface includes a semi-open area.

[0052] The initial object can be any object, as long as the number of initial objects is multiple, there is an overlap between adjacent initial objects, there is a missing adjacent surface on the target object, and the form of this adjacent surface is a semi-open area.

[0053] At least a part of the boundary in the semi-open area of the adjacent surface is clear and definite, and it can be a partially visible area due to occlusion.

[0054] Since there is an overlap between adjacent initial objects, after segmenting adjacent initial objects according to a single initial object, each target object will have a missing adjacent surface.

[0055] Taking the target object model as an adjacent tooth model and the target object as a tooth model as an example, the adjacent tooth model can be a model formed by separating a single tooth from the dental and maxillofacial model. Each tooth in the adjacent tooth model has been segmented into a single tooth. Due to occlusion, the adjacent part of adjacent teeth cannot be scanned during scanning, so the data of this part is missing. The present invention is not limited to adjacent tooth models and can be applied to any target object that meets the requirements of the target object model, such as the target object model being an adjacent orthopedic model.

[0056] The number of objects in the object model is multiple. Taking the adjacent tooth model as an example. One adjacent tooth model may include a row of tooth models, which may be an upper dental arch model; or a lower dental arch model. One adjacent tooth model may also include an upper dental arch model and a lower dental arch model.

[0057] S120. For each object, determine the area to be repaired in the semi-open area of the object.

[0058] The area to be repaired can be considered as the area in the semi-open area where data needs to be supplemented.

[0059] This operation traverses each object. For the currently traversed object, determine the area to be repaired in the semi-open area of this object. The order of determining the areas to be repaired for each object is not limited. It can be determined sequentially in a certain order, or determined in parallel.

[0060] In one embodiment, when this operation determines the area to be repaired, it can be determined based on the distance between the boundary points between adjacent objects. For example, in determining the semi-open area of an object, traverse all boundary points and determine the distance from the traversed boundary points to the object adjacent to this adjacent surface. When this distance meets the set threshold, this boundary point can be retained. The area formed by all the retained boundary points is determined as the area to be repaired.

[0061] In one embodiment, when this operation determines the area to be repaired, the semi-open area can be directly determined as the area to be repaired.

[0062] S130. Fill the area to be repaired to obtain the filled area.

[0063] The filled area can be considered as the area obtained after data filling of the area to be repaired.

[0064] After determining the area to be repaired, this operation can fill the area to be repaired. The means of filling is not limited here. For example, the area to be repaired can be geometrically dissected. Such as triangulation.

[0065] Geometric dissection can be considered as a method of dividing the area to be repaired into a series of non-overlapping geometric figures. Taking triangulation as an example, the area to be repaired is divided into a series of non-overlapping triangular patches. Triangulation starts with a series of ordered points (original set) on the boundary of the area to be repaired, and forms non-overlapping triangles by connecting these points, so that the entire area is completely covered by these triangles. The vertices of each triangle contain points in the original set, and the triangles only intersect at edges or vertices.

[0066] The filling method used in this operation can be determined based on the original digital form of the target object. When the original target object is in a grid shape, the filling method can also be to achieve grid-shaped filling.

[0067] S140. Based on the quality attribute of the target object, adjust the quality attribute of the filled area to obtain an adjusted area.

[0068] The quality attribute can be considered as an attribute representing quality. For different digital forms of the target object, the parameters representing the quality attribute are different. When the form of the target object is a grid structure, the quality parameter can be a geometric parameter, such as the side length of the grid. The grid structure can be composed of multiple basic units, and the basic units can be the same geometric shape, such as a square, rectangle, triangle, hexagon, etc., or can be an irregular shape.

[0069] After obtaining the filled area, in order to improve the quality of the filling, this operation can take the quality attribute of the target object as a standard and adjust the quality attribute of the filled area. The end condition of the adjustment is not limited here, and it can be related to the number of times of adjusting the filled area, or can be related to the quality attribute of the adjusted filled area.

[0070] In one embodiment, this operation can determine whether the average side length of the grids in the filled area is less than or equal to the average side length of the target object. If so, it indicates that the quality attribute of the filled area matches the quality attribute of the target object. If not, all the grids in the filled area can be traversed and the grids can be split; or grids that need to be split can be selected from the filled area and split. After splitting, it can be verified whether the splitting method needs to be adjusted. If so, adjust the splitting method, and the adjusted splitting method will split out grids different from those before adjustment. This embodiment can also loop and iterate the above steps until the average side length of all the grids in the filled area is less than or equal to the average side length of the target object.

[0071] The technical solution of the embodiment of the present invention fills the to-be-repaired area of each segmented target object in the target object model to obtain a filled area, realizing the repair of the missing data in the to-be-repaired area of the missing adjacent surface. After obtaining the filled area, based on the quality attribute of the target object, adjust the quality attribute of the filled area to ensure the quality of the filled area.

[0072] Embodiment Two

[0073] Figure 2 It is a flowchart of another target object processing method provided according to Embodiment Two of the present invention, and this embodiment details the operation of adjusting the quality attribute. As Figure 2 shown, the method includes:

[0074] S210. Obtain a target object model.

[0075] S220: For each target object, determine a region to be repaired in a semi-open region of the target object.

[0076] S230, filling the area to be repaired to obtain a filled area.

[0077] S240: Determine the average side length of the original grid of the target object.

[0078] The shape of the target object is a grid-like structure, and the mass attribute includes an average side length.

[0079] In the process of adjusting the filled area in this embodiment, the average side length of the original mesh of the target object can be determined. The original mesh can be the mesh of the target object with missing adjacent faces.

[0080] This operation can traverse all edges of all meshes in the original mesh, and determine the average of all traversed edges as the average side length of the target object, so as to adjust the average side length of the filled area.

[0081] S250, performing grid subdivision on the filled area to obtain an adjusted area.

[0082] The adjusted region can be considered as a region obtained by meshing the filled region. The data in the adjusted region and the filled region are filled in different ways, and the granularity of the data filled in the adjusted region is smaller than the granularity of the data filled in the filled region.

[0083] Mesh subdivision can be considered as further dividing each element in the mesh (such as triangles, quadrilaterals, tetrahedrons, etc.) into smaller elements to obtain a more detailed mesh structure.

[0084] The average side length of the grid in the adjusted area is less than or equal to the average side length of the original grid.

[0085] When performing mesh subdivision on the filled area, this operation can traverse all meshes in the filled area and select meshes that need to be subdivided.

[0086] After selecting the mesh that needs to be subdivided, traverse all the meshes that need to be subdivided, select a point from the mesh, and divide the mesh based on the point. The selected point is not limited here, and can be the centroid, incenter, and geometric center of the mesh.

[0087] In this embodiment, the quality of the filled area can be adjusted based on the average side length. During the adjustment based on the average side length, the effect of reducing the average side length can be achieved by subdividing the filled area into grids. The average side length of the adjusted area obtained after subdivision is less than or equal to the average side length of the target object, so that the quality of the adjusted area matches the original quality of the target object. The consistency of the quality of the repaired target object is improved.

[0088] Based on the above embodiment, a variant embodiment of the above embodiment is proposed. Here, it should be noted that for the sake of brevity of description, only the differences from the above embodiment are described in the variant embodiment.

[0089] In one embodiment, the filled area includes a plurality of filled geometric figures. Subdividing the filled area into grids to obtain an adjusted area includes:

[0090] Iteratively perform the following operations in a loop until the average side length of all geometric figures in the filled area is less than or equal to the average side length of the original grid:

[0091] Select a geometric figure from the filled area as the current geometric figure, and determine the average side length of the current geometric figure;

[0092] Determine whether the average side length of the current geometric figure is greater than the average side length of the original grid;

[0093] If so, based on the geometric center coordinates of the current geometric figure, split the current geometric figure to form a plurality of updated geometric figures, and return to the determination operation of the current geometric figure until all geometric figures in the filled area are selected.

[0094] If not, return to the determination operation of the current geometric figure until all geometric figures in the filled area are selected.

[0095] In this embodiment, the filling method is filling with geometric figures. The filled area includes a plurality of filled geometric figures, and each geometric figure intersects through vertices and edges.

[0096] Grid subdivision can be to iteratively perform a single subdivision operation in a loop until the average side length of all geometric figures in the filled area is less than or equal to the average side length of the original grid.

[0097] Among them, the single subdivision operation can be to traverse each geometric figure in the filled area and select the geometric figure to be split; for the selected geometric figure, perform a split operation.

[0098] The split operation can be to split the geometric figure based on the geometric center point coordinates of the geometric figure.

[0099] The traversal method is described as follows:

[0100] First, randomly select a geometric figure from the filled area and use this geometric figure as the current geometric figure; then determine the average side length of the current geometric figure. Determine whether the average side length of the current geometric figure is greater than the average side length of the original grid, that is, taking a single geometric figure as the granularity, determine whether the granularity of this geometric figure meets the requirements of the original grid.

[0101] When the average side length of the current geometric figure is greater than the average side length of the original grid, the current geometric figure can be split. When the average side length of the current geometric figure is less than or equal to the average side length of the original grid, the determination operation of the current geometric figure can be returned, that is, re-select the next geometric figure as the new current geometric figure and continue to execute the subsequent operations until all geometric figures are selected. Each selected geometric figure is a different geometric figure.

[0102] In one example, splitting the current grid may include the following operations:

[0103] Determine the geometric center coordinates of the current geometric figure, and perform dissection based on the vertices and geometric center coordinates of the current geometric figure to form the replaced geometric figure. Among them, the geometric center point coordinates can be the coordinates of the geometric center point of the current geometric figure.

[0104] Through the subdivision method of this embodiment, the geometric figure that needs to be subdivided can be accurately subdivided, improving the subdivision efficiency.

[0105] In one embodiment, the geometric figure includes a triangular patch. After one round of traversal of the geometric figures in the filled area, it further includes:

[0106] Select an updated geometric figure from the updated geometric figures as the geometric figure to be analyzed, and determine whether to perform an edge swap between the geometric figure to be analyzed and the adjacent geometric figures. The adjacent geometric figures include the geometric figures that have a common edge with the geometric figure to be analyzed;

[0107] If so, replace the common edge with the target edge, and return the determination operation of the geometric figure to be analyzed until all the updated geometric figures are selected. The target edge includes the diagonal of the figure formed by the geometric figure to be analyzed and the adjacent geometric figure, and the diagonal is a line segment other than the common edge;

[0108] If not, return the determination operation of the geometric figure to be analyzed until all the updated geometric figures are selected.

[0109] This embodiment is executed after each round of traversing the geometric figures in the filled area. Edge swapping can be considered as an operation of replacing a certain edge of a geometric figure with another edge. A shared edge can be considered as an edge shared in common. There can be the same edge between adjacent geometric figures and the geometric figure to be analyzed.

[0110] This embodiment traverses all the updated geometric figures. For each updated geometric figure traversed, it is determined whether the updated geometric figure needs to perform edge swapping to further ensure that the average side length is as small as possible. Through the operation of edge swapping, the splitting of geometric figures can use shorter edges as much as possible.

[0111] If the updated geometric figure needs to perform edge swapping, then perform the edge swapping operation.

[0112] The following expands the specific operations of traversing:

[0113] Randomly select an updated geometric figure from the updated geometric figures, and use the selected updated geometric figure as the geometric figure to be analyzed. Determine the adjacent geometric figures of the geometric figure to be analyzed. Based on the geometric figure to be analyzed and the adjacent geometric figures, determine whether to perform edge swapping.

[0114] This embodiment can traverse all adjacent geometric figures to determine whether the adjacent geometric figure and the geometric figure to be analyzed need to perform edge swapping. If so, replace the shared edge between the adjacent geometric figure and the geometric figure to be analyzed with the target edge. The target edge is the diagonal of the figure formed by the geometric figure to be analyzed and the adjacent geometric figure, excluding the common edge.

[0115] In one embodiment, determining whether to perform edge swapping between the geometric figure to be analyzed and the adjacent geometric figure includes:

[0116] Select an adjacent geometric figure from the adjacent geometric figures of the geometric figure to be analyzed as the geometric figure to be processed, and determine whether the opposite vertex of the corresponding shared edge is inside the circumcircle of the original geometric figure, where the original geometric figure is the geometric figure before the geometric figure to be analyzed is split;

[0117] If so, determine to perform edge swapping; otherwise, return to the determination operation of the geometric figure to be processed until it is determined to perform edge swapping or all adjacent geometric figures of the geometric figure to be analyzed have been selected.

[0118] When this embodiment determines whether to perform edge swapping, it traverses all adjacent geometric figures in the geometric figure to be analyzed until an adjacent geometric figure that meets the edge swapping condition is found. The edge swapping condition can be that the opposite vertex of the shared edge between the adjacent geometric figure and the geometric figure to be analyzed is inside the circumcircle of the original geometric figure.

[0119] The opposite vertex of the shared edge can be considered as the vertex of the angle corresponding to the shared edge.

[0120] The following are the specific operations for expanding and traversing:

[0121] Select an adjacent geometric figure from all the adjacent geometric figures of the geometric figure to be analyzed as the geometric figure to be analyzed. The number of adjacent geometric figures of the geometric figure to be analyzed can be the same as the number of sides of the geometric figure to be analyzed.

[0122] For the geometric figure to be analyzed and the geometric figure to be processed, determine the pair of vertices of the common side between the two. Then determine whether the pair of vertices is located inside the circumcircle of the geometric figure before the geometric figure to be analyzed is split.

[0123] If so, determine that edge swapping needs to be performed, that is, perform edge swapping based on the geometric figure to be processed and the geometric figure to be analyzed. For example, replace the common side of the geometric figure to be processed and the geometric figure to be processed with a target edge.

[0124] In one embodiment, in this embodiment, determining the area to be repaired in the semi-open area of each target object includes:

[0125] For each target object, determine the boundary information of the target object;

[0126] Determine the common boundary area in the boundary information. The common boundary area includes the area formed by the first boundary points of the target object, and the shortest distance from the first boundary point to the upper boundary point of the adjacent object is less than the first set threshold, and the adjacent object is a target object adjacent to the target object;

[0127] Select the area to be repaired within the common boundary area.

[0128] The boundary information can be considered as the information of all the boundaries of the target object. In this embodiment, all target objects are traversed to determine the boundary information of the target object.

[0129] Taking the target object model as the adjacent tooth model as an example, in this embodiment, the boundaries of each tooth model can be identified. Figure 3 This is a schematic model diagram of the target object model after determining the boundary information provided by this embodiment. Figure 3 The green curve in it can be considered as the boundary information of the target object.

[0130] This embodiment does not limit the means for determining the boundary information. For example, the boundary of the target object can be determined by image recognition to obtain the boundary information. The boundary information can include information such as the coordinates of the boundary.

[0131] After determining the boundary information, this embodiment can determine the common boundary information in the boundary information. The common boundary information can be regarded as the common boundary information between the target object and the adjacent target object. The common boundary information can be determined based on the distance from the boundary points in the target object to the boundary of the adjacent object.

[0132] This embodiment can traverse the boundary points at the missing surface position of the target object. For each boundary point, determine the closest distance from this boundary point to the boundary point of the adjacent object. If the closest distance is less than the first set threshold, it can be considered that this boundary point is a point closer to the adjacent object. The first set threshold can be a threshold preset for determining whether it is a common boundary area. The value is not limited here and can be determined based on the size of the target object.

[0133] Taking the target object model as a tooth model as an example, identify and mark the common boundary area of the adjacent tooth model. Figure 4 is a schematic model diagram of the target object model after determining the common boundary area. See Figure 4 , in the figure, the red curve can be regarded as the common boundary area of the left tooth model, and the blue curve can be regarded as the common boundary area of the right tooth model. The left tooth model can be the target object, and the right tooth model can be the adjacent object.

[0134] After determining the common boundary area, this embodiment can select the area to be repaired from within the common boundary area.

[0135] This embodiment can directly use all the common boundary areas as the areas to be repaired, or use some areas in the common boundary area as the repaired areas. When using some areas as the repaired areas, some areas can be selected based on the distance from the inner boundary points in the common boundary area to the adjacent object.

[0136] Before this embodiment selects the area to be repaired from within the common boundary area, it can first align the start and end points of the common boundary area. Specifically, taking the target object and the adjacent object as a group, align the start point in the common boundary area of the target object with the start point in the common boundary area of the adjacent object. Align the end point in the common boundary area of the target object with the end point in the common boundary area of the adjacent object.

[0137] In the tooth model, aligning the start and end points of the common boundary area involves identifying and processing the shared boundary between adjacent teeth, that is, the area where two adjacent teeth are in contact. The start and end points can be the two endpoints of the shared boundary, which are the starting point and the ending point of the contact area of the adjacent tooth model.

[0138] In one embodiment, the area to be repaired includes a first area to be repaired. Selecting the area to be repaired from within the common boundary area includes:

[0139] Select a second boundary point in the common boundary region, where the shortest distance from the second boundary point to the upper boundary point of the adjacent object is less than a second set threshold, and the second set threshold is less than the first set threshold;

[0140] Determine the fitting region formed by the second boundary points;

[0141] Determine the fitting line segment where the end point of the fitting region is located;

[0142] Determine the region enclosed by the fitting region and the fitting line segment as the first region to be repaired.

[0143] The second boundary point can be considered as the boundary point among the first boundary points that is closer to the adjacent object. The value of the second set threshold is not limited here and can be determined based on the size of the target object.

[0144] In this embodiment, the first boundary points corresponding to the shortest distances less than the second set threshold can be selected from the first boundary points as the second boundary points.

[0145] Take the region formed by the selected second boundary points as the fitting region. The fitting region can be considered as the region where the fitting degree between the target object and the adjacent object is higher than that of the common boundary region.

[0146] The fitting line segment can be a line segment formed by the end points of the fitting region. This line segment can be a straight line or a dotted line. The end point can be the end point of the fitting line segment.

[0147] Figure 5 This is an example of the model of the target object model after determining the fitting region provided by the embodiment of the present invention. See Figure 5 , the thick green line located in the common boundary region is the fitting region. The line width of the thick green line is thicker than that of the green line of the boundary.

[0148] Taking the target object model as an example of an adjacent tooth model, the common boundary region refers to a section of boundary points where the shortest distance from the points on the boundary of the crown model (i.e., the target object) to the boundary points of the adjacent crown model (i.e., the adjacent object) is within a specified threshold range (i.e., the shortest distance from the first boundary point to the upper boundary point of the adjacent object is less than the first set threshold).

[0149] The fitting region refers to a section of region within the common boundary region where the shortest distance from the points on the boundary of the crown model to the points on the boundary of the adjacent crown model is less than the specified threshold (i.e., the shortest distance from the second boundary point to the upper boundary point of the adjacent object is less than the second set threshold). The smaller the fitting region, the closer it is.

[0150] After determining the fitting region, this embodiment can continue to determine the fitting line segment formed by the end points of the fitting region. The end point can be the end point of the fitting region, that is, the point at the end.

[0151] The conforming line segment can be a line segment formed by linear interpolation based on the end points.

[0152] Figure 6 It is a schematic diagram of a first area to be repaired provided by an embodiment of the present invention. Refer to Figure 6 , connect the end points of the conforming area with a line segment for bridging. The points in the middle of the line segment are generated by the linear interpolation method. The linear interpolation formula: P = (1 - t)P 0 + tP 1 .

[0153] Among them, P 0 and P 1 are respectively known points, such as two end points. P is the interpolated point.

[0154] Figure 6 The blue dashed line in

[0155] is the conforming line segment. After determining the first area to be repaired, the first area to be repaired can be filled. That is, fill the area enclosed by the bridging and the conforming area. The filling method is to use a given space semi-closed boundary (i.e., the conforming area) and the boundary end interpolation sequence points (i.e., the conforming line segment), and perform triangulation on the area enclosed by the boundary and the sequence points, that is, the first area to be repaired, and record the newly added triangle patch set as T1.

[0156] In this embodiment, when filling the first area to be repaired, the conforming area can be represented by a series of ordered points. The boundary can be a series of ordered points that define the edge of the area. The sequence points of the conforming area and the sequence points interpolated on the conforming line segment are used for the area of triangulation.

[0157] Figure 7 It is a schematic diagram of the filled first area to be repaired provided by an embodiment of the present invention. Refer to Figure 7 , the first area to be repaired is triangulated into multiple triangle patches.

[0158] In one embodiment, the area to be repaired further includes a second area to be repaired. Selecting the area to be repaired within the common boundary area includes:

[0159] Determine whether there is a remaining area in the common boundary area except the first area to be repaired;

[0160] If so, determine the remaining line segment where the end points of the remaining area are located;

[0161] Determine the area formed by the remaining area, the conforming line segment, and the remaining line segment as the second area to be repaired.

[0162] In this embodiment, the area to be repaired includes a second area to be repaired and a first area to be repaired. The first area to be repaired and the second area to be repaired can be filled simultaneously or sequentially. For example, the first area to be repaired can be filled first, and then the second area to be repaired can be filled.

[0163] The remaining area can be the area in the common boundary area except the first area to be repaired. The method for determining the remaining line segments can refer to the method for determining the fitting line segments.

[0164] Figure 8 is a schematic diagram of a second area to be repaired provided by an embodiment of the present invention. Refer to Figure 8 , the line segment below the fitting line segment is the remaining line segment 1. The area formed by the remaining area, the fitting line segment and the remaining line segment is denoted as the second area to be repaired 2.

[0165] Figure 9 is a schematic diagram of the second area to be repaired after filling provided by an embodiment of the present invention. Refer to Figure 9 , the second area to be repaired after filling is the area below the first area to be repaired.

[0166] In one example, if there is no coincidence between the end of the fitting area and the end of the common boundary, a bridging connection is made with a line segment at the end of the common boundary to obtain the remaining line segment, and the points in the middle of the line segment are generated by the linear interpolation method. Triangulation is performed on the formed second area to be filled, and the newly added set of triangular patches is denoted as T2. The results of the two triangulations are merged, that is, T1 and T2 are merged, and denoted as sumT. In this embodiment, the set of triangular patches can include the vertices and directions of the triangular patches.

[0167] After filling by triangulation, the filled area can be adjusted, such as performing mesh subdivision. The following is an exemplary description of the subdivision:

[0168] 1. Calculate the average side length according to the original mesh, that is, the average side length of the original mesh, denoted as aveE;

[0169] 2. Perform mesh subdivision operations on all triangular patches of sumT so that the average side length of the subdivided triangles does not exceed aveE, that is, the average side length of the mesh in the adjusted area is less than or equal to the average side length of the original mesh.

[0170] Denote the newly generated vertex set in the subdivision operation as X (which can include the vertices and directions of the triangular patches). The mesh subdivision method is as follows:

[0171] Traverse each triangular patch in sumT and calculate the average side length of each triangular patch (that is, determine the average side length of the current geometric figure);

[0172] If the average side length is greater than aveE (i.e., the average side length of the current geometric figure is greater than that of the original grid), then calculate the geometric center coordinates of the triangular patch (i.e., the average of the three vertex coordinates), generate a new vertex with these geometric center coordinates and add it to the grid, and delete the original triangular patch, splitting it into three new triangular patches and adding them to the grid (i.e., based on the geometric center coordinates of the current geometric figure, split the current geometric figure to form multiple updated geometric figures).

[0173] After completing one round of traversal, check whether each newly added triangular patch (i.e., the updated geometric figure) and its adjacent triangular patches need to perform edge swapping (i.e., determine whether the geometric figure to be analyzed and the adjacent geometric figure perform edge swapping).

[0174] The condition for performing edge swapping is that if the opposite vertex of a certain edge of the original triangular patch falls inside the circumcircle of the original triangular patch (i.e., determine whether the opposite vertex corresponding to the common edge is inside the circumcircle of the original geometric figure), then perform edge swapping.

[0175] Loop and iterate the above steps until the average side length of all triangular patches in sumT does not exceed aveE, that is, the grid subdivision is completed.

[0176] Figure 10 is a schematic diagram of grid subdivision provided by an embodiment of the present invention. Refer to Figure 10 , the outer triangle is the current geometric figure. When updating the original triangular patch - T, that is, the current geometric figure, based on the geometric center point, that is, V - the newly added vertex, perform triangle splitting. Connect the geometric center point and all vertices of the current geometric figure respectively to obtain the updated geometric figures, that is, the split triangular patches T1, T2, and T3.

[0177] Figure 11 is a schematic diagram of determining whether to perform edge swapping provided by an embodiment of the present invention. Refer to Figure 11 , for the triangular patch split based on the newly added vertex, the opposite vertices of the common edge e with the adjacent geometric figure are A and T. Among them, A is outside the circumcircle of the original geometric figure, so no edge swapping is required.

[0178] Figure 12 is another schematic diagram of determining edge swapping provided by an embodiment of the present invention. Refer to Figure 12 , for the triangular patch split based on the newly added vertex, the opposite vertices of the common edge e with the adjacent geometric figure are B and T. Among them, both opposite vertices B and T fall inside the circumcircle of the original geometric figure, so edge swapping is performed. Replace it with another diagonal. That is, the common edge is replaced with the target edge.

[0179] When determining whether the opposite vertex corresponding to the common edge is inside the circumcircle of the original geometric figure, if both opposite vertices fall inside, perform edge swapping, otherwise do not perform.

[0180] Figure 13 It is a schematic diagram of a tooth model after grid subdivision provided by an embodiment of the present invention. For the adjusted area after grid subdivision, see Figure 13 .

[0181] In one embodiment, denote the fitting line segment and the remaining line segment as target line segments, and denote the fitting area and the remaining area as target areas.

[0182] Determining the target line segment where the end point of the target area is located includes:

[0183] Determine the end point of the target area as the target end point of the target line segment;

[0184] Based on the target end point, perform linear interpolation to obtain the intermediate point in the target line segment.

[0185] In this embodiment, the means of obtaining the remaining line segment and the fitting line segment are the same. The means of interpolation is defined by taking the target line segment and the target area as examples.

[0186] In this embodiment, take the end point as the end point of the target line segment, that is, the target end point. Then perform linear interpolation on the target end point to obtain the intermediate point in the target end point. For example, first perform linear interpolation based on the end point to obtain an intermediate point, and then take the end point and the intermediate point as a set of points, and perform linear interpolation on adjacent points. Iterate until the interpolation end condition is met, such as obtaining a set number of points.

[0187] In one embodiment, after adjusting the quality attribute of the filled area based on the mass attribute of the target object to obtain the adjusted area, it further includes:

[0188] Perform Laplacian smoothing on the common boundary area and the neighborhood points of the common boundary area to obtain the repaired target object.

[0189] In this embodiment, after obtaining the adjusted area, smoothing processing can be performed, that is, perform Laplacian smoothing on the common boundary area and the neighborhood points of the common boundary area. The smoothed area and the original target object form the repaired target object.

[0190] Among them, the neighborhood points can be the points adjacent to the common boundary. Adjacency can be determined by distance, and the distance is not limited here.

[0191] In one example, perform Laplacian smoothing on the common boundary area and its extended neighborhood points. Laplacian smoothing formula: Where N i (p) refers to the set of neighborhood points of vertex p.

[0192] In this embodiment, when performing Laplace smoothing, it is not limited to the common boundary area, but can be extended to the points of the common boundary and its neighborhood. Laplace smoothing is performed on these points and the neighborhood points of these points. For a vertex in the tooth model mesh, its extended neighborhood points refer to the set of other vertices related to it within a certain range of the point.

[0193] Figure 14 is a schematic diagram of a Laplace smoothing result provided by an embodiment of the present invention, see Figure 14 , the smoothed area 4 and the original target object form a repaired target object.

[0194] Figure 15 is a schematic diagram of a final target object formed based on a repaired target object provided by an embodiment of the present invention. Figure 15 , the quality of the final target object is consistent with the quality of the original target object. The conversion between the repaired target object and the final target object is not limited here, and can be determined based on the simulation tool of the target object model. The final target object can be a target object with a solid surface.

[0195] In one embodiment, after adjusting the mass attribute of the filled region to obtain the adjusted region based on the mass attribute of the target object, the method further includes:

[0196] Each mesh vertex in the adjusted area is traversed, and a smoothing operation is performed on the vertex and the mesh area adjacent to the vertex to obtain a smoothed area, wherein the target object model includes a tooth model.

[0197] This embodiment traverses the vertex of each mesh in the adjusted area, and smoothes the vertex and the adjacent mesh area. After all meshes are traversed, the adjusted area is smoothed to become a smoothed area.

[0198] A tooth model is a three-dimensional digital model used to simulate and replicate teeth.

[0199] In one example, a smoothing operation is performed on a vertex set X and its adjacent triangle area (i.e., an adjacent mesh area). Here, the smoothing operation can use a minimum film energy constraint to ensure that the smoothed mesh can remain completely fitted. The principle is the minimal surface principle: a minimal surface can refer to a surface with an average curvature of zero, which is geometrically expressed as a surface with the smallest area that satisfies certain boundary constraints. The surface exists and is unique, that is, for a given identical closed curve in space, the minimum surface it encloses is the same.

[0200] Figure 16 It is a schematic diagram of a vertex and its neighborhood points provided by an embodiment of the present invention.

[0201] The following is an expression for the discretization of a very small plane, called the minimum film energy constraint formula:

[0202]

[0203] See Figure 16 , where v represents the coordinates of the current point, v i represents a certain point in the 1-ring neighborhood of vertex v, ω(v, v i ) = cot∠(v, v k1 , v i ) + cot∠(v, v k2 , v i ) represents the sum of the cosine values of the opposite angles in the two adjacent triangles of the edge (v, v i ), which is called the weight of the edge (v, v i ). represents the sum of the weights of the 1-ring neighborhood edges of vertex v, represents the cumulative sum of the products of the weights of the 1-ring neighborhood edges of vertex v and the coordinates of the corresponding 1-ring neighborhood vertices.

[0204] Among them, the 1-ring neighborhood points of a vertex generally refer to all other vertices directly connected to that vertex. These neighborhood points form the directly adjacent area of the vertex.

[0205] Figure 17 is a schematic diagram of a smoothed area provided by an embodiment of the present invention. See Figure 17 The smoothed area 5 is the result of smoothing the newly added vertices of the filled area, and it can be further Laplacian smoothed to achieve the smoothing of the common boundary area and its extended points.

[0206] In the present invention Figures 3 - 5 can be a view of an adjacent tooth model from the root to the crown perspective. Figures 6 - 9 , Figures 13 - 15 and Figure 17 is a side view of the tooth model, showing the missing adjacent surface.

[0207] The target object processing method provided by the embodiment of the present invention can input an adjacent tooth model and output a tooth model with the adjacent surface repaired. Through this method, the missing data in the adjacent part of adjacent teeth is reasonably repaired.

[0208] Embodiment III

[0209] Figure 18 is a schematic structural diagram of a target object processing device provided by an embodiment of the present invention. As Figure 18 shown, the device includes:

[0210] An acquisition module 1810, configured to acquire a target object model, where the target object model includes a plurality of segmented target objects, the target object is formed by segmenting adjacent initial objects into individual initial objects, there is an overlap between the adjacent initial objects, the target object has a missing adjacent surface, and the form of the missing adjacent surface includes a semi-open area;

[0211] A determination module 1820, configured to determine, for each target object, a to-be-repaired area in the semi-open area of the target object;

[0212] A filling module 1830, configured to fill the to-be-repaired area to obtain a filled area;

[0213] An adjustment module 1840, configured to adjust the quality attribute of the filled area based on the quality attribute of the target object to obtain an adjusted area.

[0214] In one embodiment, the form of the target object is a grid-like structure, the quality attribute includes an average side length, and the adjustment module 1840 includes:

[0215] An adjustment unit, configured to adjust the average side length of the grid;

[0216] A subdivision unit, configured to perform grid subdivision on the filled area to obtain an adjusted area;

[0217] Wherein, the average side length of the grids in the adjusted area is less than or equal to the average side length of the original grid.

[0218] In one embodiment, the filled area includes a plurality of filled geometric figures, and the subdivision unit is specifically configured to:

[0219] Loop and iterate the following operations until the average side length of all geometric figures in the filled area is less than or equal to the average side length of the original grid:

[0220] Select a geometric figure from the filled area as the current geometric figure, and determine the average side length of the current geometric figure;

[0221] Determine whether the average side length of the current geometric figure is greater than the average side length of the original grid;

[0222] If so, based on the geometric center coordinates of the current geometric figure, split the current geometric figure to form a plurality of updated geometric figures, and return to the determination operation of the current geometric figure until all geometric figures in the filled area are selected;

[0223] If not, return to the determination operation of the current geometric figure until all geometric figures in the filled area are selected.

[0224] In one embodiment, the geometric figure includes triangular pieces, and the target object processing device further includes: an edge exchange unit, including:

[0225] A determination subunit, configured to, after a round of traversal of the geometric figure in the filled area is completed, select an updated geometric figure from the updated geometric figures as the geometric figure to be analyzed, and determine whether to perform edge exchange between the geometric figure to be analyzed and an adjacent geometric figure, where the adjacent geometric figure includes a geometric figure having a common edge with the geometric figure to be analyzed;

[0226] A replacement subunit, configured to, if so, replace the common edge with a target edge, and return to the geometric figure to be analyzed determination operation until the selection of the updated geometric figures is completed, where the target edge includes a diagonal of the figure enclosed by the geometric figure to be analyzed and the adjacent geometric figure, and the diagonal is a line segment other than the common edge;

[0227] A return subunit, configured to, if not, return to the geometric figure to be analyzed determination operation until the selection of the updated geometric figures is completed.

[0228] In one embodiment, the determination subunit is specifically configured to:

[0229] Select an adjacent geometric figure from the adjacent geometric figures of the geometric figure to be analyzed as the geometric figure to be processed, and determine whether the opposite vertex of the corresponding common edge is inside the circumcircle of the original geometric figure, where the original geometric figure is the geometric figure before the geometric figure to be analyzed is split;

[0230] If so, determine to perform edge exchange; otherwise, return to the determination operation of the geometric figure to be processed until it is determined to perform edge exchange or all the adjacent geometric figures of the geometric figure to be analyzed are selected.

[0231] In one embodiment, the determination module 1820 includes:

[0232] A first determination unit, configured to determine the boundary information of each target object;

[0233] A second determination unit, configured to determine the common boundary area in the boundary information, where the common boundary area includes the area formed by the first boundary points of the target object, and the shortest distance from the first boundary point to the upper boundary point of the adjacent object is less than a first set threshold, and the adjacent object is a target object adjacent to the target object;

[0234] A selection unit, configured to select a region to be repaired in the common boundary area.

[0235] In one embodiment, the region to be repaired includes a first region to be repaired, and the selection unit is specifically configured to:

[0236] Select a second boundary point in the common boundary region, where the shortest distance from the second boundary point to the upper boundary point of the adjacent object is less than a second set threshold, and the second set threshold is less than the first set threshold;

[0237] Determine the fitting region formed by the second boundary points;

[0238] Determine the fitting line segment where the end point of the fitting region is located;

[0239] Determine the region enclosed by the fitting region and the fitting line segment as the first region to be repaired.

[0240] In one embodiment, the region to be repaired further includes a second region to be repaired. The selection unit is specifically configured to:

[0241] Determine whether there is a remaining region in the common boundary region except the first region to be repaired;

[0242] If so, determine the remaining line segment where the end point of the remaining region is located;

[0243] Determine the region formed by the remaining region, the fitting line segment and the remaining line segment as the second region to be repaired.

[0244] In one embodiment, denote the fitting line segment and the remaining line segment as target line segments, and denote the fitting region and the remaining region as target regions.

[0245] The selection unit determines the target line segment where the end point of the target region is located, including:

[0246] Determine the end point of the target region as the target end point of the target line segment;

[0247] Perform linear interpolation based on the target end point to obtain an intermediate point in the target line segment.

[0248] In one embodiment, the device further includes a first smoothing module, configured to: after adjusting the quality attribute of the filled region based on the quality attribute of the target object to obtain an adjusted region, perform Laplace smoothing on the common boundary region and the neighborhood points of the common boundary region to obtain a repaired target object.

[0249] In one embodiment, the device further includes a second smoothing module, configured to: after adjusting the quality attribute of the filled region based on the quality attribute of the target object to obtain an adjusted region, traverse the vertices of each grid in the adjusted region, and perform a smoothing operation on the vertices and the grid regions adjacent to the vertices to obtain a smoothed region, and the target object model includes a tooth model.

[0250] The target object processing device provided by the embodiments of the present invention can execute the target object processing method provided by any embodiment of the present invention, and has the corresponding functional modules and beneficial effects for executing the method.

[0251] Embodiment 4

[0252] Figure 19 It is a schematic structural diagram of an electronic device for implementing the target object processing method of the embodiments of the present invention. The electronic device is intended to represent various forms of digital computers, such as, laptop computers, desktop computers, workstations, personal digital assistants, servers, blade servers, mainframe computers, and other suitable computers. The electronic device can also represent various forms of mobile devices, such as, personal digital processors, cellular phones, smart phones, wearable devices (such as helmets, glasses, watches, etc.) and other similar computing devices. The components shown herein, their connections and relationships, and their functions are merely illustrative and are not intended to limit the implementation of the present invention described and / or claimed herein.

[0253] As Figure 19 shown, the electronic device 10 includes at least one processor 11, and a memory communicatively connected to the at least one processor 11, such as a read-only memory (ROM) 12, a random access memory (RAM) 13, etc. Among them, the memory stores a computer program executable by the at least one processor 11, and the computer program is executed by the at least one processor 11 so that the at least one processor 11 can execute the method provided by the present invention.

[0254] The processor 11 can execute various appropriate actions and processes according to the computer program stored in the read-only memory (ROM) 12 or the computer program loaded from the storage unit 18 into the random access memory (RAM) 13. In the RAM 13, various programs and data required for the operation of the electronic device 10 can also be stored. The processor 11, the ROM 12, and the RAM 13 are connected to each other through a bus 14. The input / output (I / O) interface 15 is also connected to the bus 14.

[0255] Multiple components in the electronic device 10 are connected to the I / O interface 15, including: an input unit 16, such as a keyboard, a mouse, etc.; an output unit 17, such as various types of displays, speakers, etc.; a storage unit 18, such as a disk, an optical disc, etc.; and a communication unit 19, such as a network card, a modem, a wireless communication transceiver, etc. The communication unit 19 allows the electronic device 10 to exchange information / data with other devices through a computer network such as the Internet and / or various telecommunication networks.

[0256] The processor 11 may be various general-purpose and / or special-purpose processing components with processing and computing capabilities. Some examples of the processor 11 include, but are not limited to, a central processing unit (CPU), a graphics processing unit (GPU), various dedicated artificial intelligence (AI) computing chips, various processors running machine learning model algorithms, a digital signal processor (DSP), and any suitable processor, controller, microcontroller, etc. The processor 11 executes the various methods and processes described above, such as the target object processing method.

[0257] In some embodiments, the target object processing method may be implemented as a computer program tangibly embodied in a computer-readable storage medium, such as the storage unit 18. In some embodiments, part or all of the computer program may be loaded and / or installed onto the electronic device 10 via the ROM 12 and / or the communication unit 19. When the computer program is loaded into the RAM 13 and executed by the processor 11, one or more steps of the target object processing method described above may be executed. Alternatively, in other embodiments, the processor 11 may be configured to execute the target object processing method by any other suitable means (e.g., by means of firmware).

[0258] Herein, the various embodiments of the systems and techniques described above may be implemented in digital electronic circuit systems, integrated circuit systems, field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard parts (ASSPs), system on chip (SOC) systems, complex programmable logic devices (CPLDs), computer hardware, firmware, software, and / or combinations thereof. These various embodiments may include: being implemented in one or more computer programs that may be executed and / or interpreted on a programmable system including at least one programmable processor, which may be a dedicated or general-purpose programmable processor that receives data and instructions from a storage system, at least one input device, and at least one output device, and transmits the data and instructions to the storage system, the at least one input device, and the at least one output device.

[0259] A computer program for implementing the method of the present invention can be written in any combination of one or more programming languages. These computer programs can be provided to a processor of a general-purpose computer, a special-purpose computer, or other programmable data processing devices, such that when the computer programs are executed by the processor, the functions / operations specified in the flowchart and / or block diagram are implemented. The computer programs can be executed entirely on the machine, partially on the machine, executed partially on the machine and partially on a remote machine as an independent software package, or executed entirely on a remote machine or server.

[0260] In the context of the present invention, a computer-readable storage medium stores computer instructions for causing a processor to implement the target object processing method provided by the present invention when executed.

[0261] The computer-readable storage medium can be a tangible medium that can contain or store a computer program for use by or in connection with an instruction execution system, apparatus, or device. The computer-readable storage medium can include, but is not limited to, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, apparatus, or devices, or any suitable combination of the foregoing. Alternatively, the computer-readable storage medium can be a machine-readable signal medium. More specific examples of the machine-readable storage medium would include an electrical connection based on one or more wires, a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

[0262] To provide interaction with a user, the systems and techniques described herein can be implemented on an electronic device having: a display device for displaying information to the user (e.g., a cathode ray tube (CRT) or a liquid crystal display (LCD) monitor); and a keyboard and a pointing device (e.g., a mouse or a trackball) through which the user can provide input to the electronic device. Other kinds of devices can also be used to provide interaction with the user; for example, the feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user can be received in any form (including acoustic input, voice input, or tactile input).

[0263] The systems and techniques described herein can be implemented in a computing system that includes backend components (e.g., as a data server), or a computing system that includes middleware components (e.g., an application server), or a computing system that includes frontend components (e.g., a user computer having a graphical user interface or a web browser through which a user can interact with an implementation of the systems and techniques described herein), or a computing system that includes any combination of such backend components, middleware components, or frontend components. The components of the system can be interconnected to each other by digital data communication in any form or medium (e.g., a communication network). Examples of communication networks include: Local Area Network (LAN), Wide Area Network (WAN), blockchain network, and the Internet.

[0264] A computing system can include a client and a server. The client and the server are generally remote from each other and typically interact through a communication network. The client-server relationship is created by computer programs that run on respective computers and have a client-server relationship with each other. The server can be a cloud server, also known as a cloud computing server or a cloud host, which is a host product in the cloud computing service system, and solves the defects of difficult management and weak business scalability existing in traditional physical hosts and Virtual Private Server (VPS) services.

[0265] This embodiment also provides a computer program product, which includes a computer program that, when executed by a processor, implements the target object processing method provided by the embodiment of the present invention.

[0266] It should be understood that various forms of the processes shown above can be used, steps can be reordered, added, or deleted. For example, the steps recited in the present invention can be executed in parallel, sequentially, or in a different order, as long as the desired results of the technical solution of the present invention can be achieved, and no limitation is imposed herein.

[0267] The above specific embodiments do not constitute a limitation on the protection scope of the present invention. Those skilled in the art should understand that various modifications, combinations, sub-combinations, and substitutions can be made according to design requirements and other factors. Any modifications, equivalent substitutions, and improvements made within the spirit and principle of the present invention shall be included within the protection scope of the present invention.

Claims

1. A method for processing a target object, characterized in that: include: Acquire a target object model, wherein the target object model includes a plurality of segmented target objects, wherein the target objects are formed by segmenting adjacent initial objects according to a single initial object, wherein there is overlap between the adjacent initial objects, and wherein the target object has a missing adjacent surface, wherein the shape of the missing adjacent surface includes a semi-open area; For each target object, determining a region to be repaired in a semi-open region of the target object; Fill the area to be repaired to obtain a filled area; Based on the mass attribute of the target object, the mass attribute of the filled region is adjusted to obtain an adjusted region.

2. The method according to claim 1, characterized in that The target object is in a grid-like structure, the mass attribute includes an average side length, and based on the mass attribute of the target object, the mass attribute of the filled region is adjusted to obtain the adjusted region, including: Determine the average side length of the original grid of the target object; Subdividing the filled area into a grid to obtain an adjusted area; The average side length of the grids in the adjusted area is less than or equal to the average side length of the original grids.

3. The method according to claim 2, characterized in that The filled region includes a plurality of filled geometric figures, and the filled region is meshed to obtain an adjusted region, including: The following operations are iterated in a loop until the average side length of all geometric figures in the filled area is less than or equal to the average side length of the original mesh: Select a geometric figure from the filled area as the current geometric figure, and determine the average side length of the current geometric figure; Determining whether the average side length of the current geometric figure is greater than the average side length of the original mesh; If yes, split the current geometric figure based on the geometric center coordinates of the current geometric figure to form multiple updated geometric figures, and return to the determination operation of the current geometric figure until all geometric figures in the filling area are selected; If not, return to the confirmation operation of the current geometric figure until all geometric figures in the fill area are selected.

4. The method according to claim 3, characterized in that The geometric figure includes a triangle piece, and after a round of traversal of the geometric figure in the filled area is completed, the following further includes: Select an updated geometric figure from the updated geometric figures as the geometric figure to be analyzed, and determine whether the geometric figure to be analyzed and an adjacent geometric figure perform edge exchange, wherein the adjacent geometric figure includes a geometric figure having a common edge with the geometric figure to be analyzed; If yes, replace the shared edge with the target edge, and return to the operation of determining the geometry to be analyzed until the updated geometry selection is completed, the target edge includes the diagonal of the figure enclosed by the geometry to be analyzed and the adjacent geometry, and the diagonal is a line segment other than the shared edge; If not, return to the operation of determining the geometry to be analyzed until the updated geometry selection is completed.

5. The method according to claim 4, characterized in that Determining whether the geometric figure to be analyzed and the adjacent geometric figure perform edge exchange, including: Select an adjacent geometric figure from the adjacent geometric figures of the geometric figure to be analyzed as the geometric figure to be processed, and determine whether the opposite vertices of the corresponding shared edge are inside the circumscribed circle of the original geometric figure, wherein the original geometric figure is the geometric figure before the geometric figure to be analyzed is split; If so, determine to execute edge exchange; otherwise, return to the determination operation of the geometric figure to be processed until it is determined to execute edge exchange or all adjacent geometric figures of the geometric figure to be analyzed are selected.

6. The method according to claim 1, characterized in that For each target object, determining a region to be repaired in a semi-open region of the target object includes: For each target object, determining boundary information of the target object; Determine a common boundary area in the boundary information, the common boundary area includes an area formed by a first boundary point of the target object, a closest distance from the first boundary point to a boundary point on a neighboring object is less than a first set threshold, and the neighboring object is a target object adjacent to the target object; A region to be repaired is selected within the common boundary region.

7. The method according to claim 6, characterized in that The area to be repaired includes a first area to be repaired, and selecting an area to be repaired in the common boundary area includes: Selecting a second boundary point in the common boundary area, the closest distance from the second boundary point to the boundary point on the adjacent object is less than a second set threshold, and the second set threshold is less than the first set threshold; determining a close fitting area formed by the second boundary points; Determine the close fitting line segment where the end point of the close fitting area is located; The area enclosed by the close fitting area and the close fitting line segment is determined as the first area to be repaired.

8. The method according to claim 7, characterized in that The area to be repaired also includes a second area to be repaired, and selecting an area to be repaired in the common boundary area includes: Determine whether there is a remaining area in the common boundary area except the first area to be repaired; If yes, determine the remaining line segment where the end point of the remaining area is located; The area formed by the remaining area, the close-fitting line segment and the remaining line segment is determined as the second area to be repaired.

9. The method according to claim 8, characterized in that The close fitting line segment and the remaining line segment are recorded as target line segments, and the close fitting area and the remaining area are recorded as target areas. Determining the target line segment where the end point of the target area is located includes: Determine the end point of the target area as the target endpoint of the target line segment; Linear interpolation is performed based on the target endpoint to obtain an intermediate point in the target line segment.

10. The method according to claim 6, characterized in that After adjusting the mass attribute of the filled region based on the mass attribute of the target object to obtain the adjusted region, the method further includes: Laplace smoothing is performed on the common boundary area and the neighborhood points of the common boundary area to obtain a repaired target object.

11. The method according to claim 1, characterized in that: After adjusting the mass attribute of the filled region based on the mass attribute of the target object to obtain the adjusted region, the method further includes: Each mesh vertex in the adjusted area is traversed, and a smoothing operation is performed on the vertex and the mesh area adjacent to the vertex to obtain a smoothed area, wherein the target object model includes a tooth model.

12. A target object processing device, characterized in that: include: An acquisition module, used for acquiring a target object model, wherein the target object model includes a plurality of segmented target objects, wherein the target objects are formed by segmenting adjacent initial objects according to a single initial object, wherein there are overlaps between the adjacent initial objects, and wherein the target object has a missing adjacent surface, wherein the shape of the missing adjacent surface includes a semi-open area; A determination module, for determining, for each target object, an area to be repaired in a semi-open area of ​​the target object; A filling module is used to fill the area to be repaired to obtain a filled area; The adjustment module is used to adjust the quality attribute of the filled area based on the quality attribute of the target object to obtain an adjusted area.

13. An electronic device, characterized in that: The electronic device comprises: at least one processor; and a memory communicatively connected to the at least one processor; wherein, The memory stores a computer program executable by the at least one processor, and the computer program is executed by the at least one processor so that the at least one processor can perform the method according to any one of claims 1 to 11.

14. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer instructions, and the computer instructions are used to enable a processor to implement the method according to any one of claims 1 to 11 when executed.

15. A computer program product, characterized in that The computer program product comprises a computer program which, when executed by a processor, implements the method according to any one of claims 1-11.

Images