US20230298237A1 - Data processing method, apparatus, and device and storage medium - Google Patents

Data processing method, apparatus, and device and storage medium Download PDF

Info

Publication number
US20230298237A1
US20230298237A1 US18/201,640 US202318201640A US2023298237A1 US 20230298237 A1 US20230298237 A1 US 20230298237A1 US 202318201640 A US202318201640 A US 202318201640A US 2023298237 A1 US2023298237 A1 US 2023298237A1
Authority
US
United States
Prior art keywords
graphs
graph
placement
scaling
graphic
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
US18/201,640
Other languages
English (en)
Inventor
Mengqi Peng
Shuhuai Huang
Kaimo HU
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Tencent Technology Shenzhen Co Ltd
Original Assignee
Tencent Technology Shenzhen Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Tencent Technology Shenzhen Co Ltd filed Critical Tencent Technology Shenzhen Co Ltd
Publication of US20230298237A1 publication Critical patent/US20230298237A1/en
Pending legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T3/00—Geometric image transformations in the plane of the image
    • G06T3/06—Topological mapping of higher dimensional structures onto lower dimensional surfaces
    • G06T3/067—Reshaping or unfolding 3D tree structures onto 2D planes
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T11/00—2D [Two Dimensional] image generation
    • G06T11/60—Editing figures and text; Combining figures or text
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F30/00—Computer-aided design [CAD]
    • G06F30/10—Geometric CAD
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T11/00—2D [Two Dimensional] image generation
    • G06T11/20—Drawing from basic elements, e.g. lines or circles
    • G06T11/203—Drawing of straight lines or curves
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T3/00—Geometric image transformations in the plane of the image
    • G06T3/40—Scaling of whole images or parts thereof, e.g. expanding or contracting

Definitions

  • This application relates to the field of computer technologies, and in particular, to a data processing method, apparatus, and device and a storage medium.
  • Generalized boxing refers to: providing some to-be-placed polygons and a container with a certain size and shape, and placing the to-be-placed polygons in the container, while ensuring that the polygons do not overlap and have a stable spacing and that a container filling rate is extremely utilized.
  • common boxing methods include NFP-based and lowest center-of-gravity methods, specifically including: sequentially determining a plurality of candidate angles for each to-be-placed polygon, determining a plurality of candidate positions according to the candidate angles, and placing the corresponding polygons according to the candidate positions with maximum center-of-gravity. It is found in practical studies that the container filling rate is low after placement according to the boxing method. Therefore, how to realize boxing with a higher container filling rate is one of hot issues studied at present.
  • An embodiment of this application provides a data processing method, apparatus, and device and a storage medium.
  • this embodiment of this application provides a data processing method performed by a computer device includes:
  • this embodiment of this application provides a computer device, including: a processor, adapted to implement one or more computer-readable instructions; and a computer storage medium, the computer storage medium storing one or more computer-readable instructions, the one or more computer-readable instructions being loaded and executed by the processor and causing the computer device to:
  • this embodiment of this application provides a non-transitory computer storage medium.
  • the computer storage medium stores one or more computer-readable instructions.
  • the computer-readable instructions when executed by a processor of a computer device, causes the computer device to:
  • FIG. 1 is a schematic diagram of a setting window in automatic 2uv expansion according to an embodiment of this application.
  • FIG. 2 is a schematic flowchart of a data processing method according to an embodiment of this application.
  • FIG. 3 a is a schematic diagram of N graphs according to an embodiment of this application.
  • FIG. 3 b is a schematic diagram of a container according to an embodiment of this application.
  • FIG. 4 a is a schematic diagram of placement of N graphs in a container according to an embodiment of this application.
  • FIG. 4 b is another schematic diagram of placement of N graphs in a container according to an embodiment of this application.
  • FIG. 5 is a schematic flowchart of another data processing method according to an embodiment of this application.
  • FIG. 6 a is another schematic diagram of placement of N graphs in a container according to an embodiment of this application.
  • FIG. 6 b is yet another schematic diagram of placement of N graphs in a container according to an embodiment of this application.
  • FIG. 7 is a schematic structural diagram of a data processing apparatus according to an embodiment of this application.
  • FIG. 8 is a schematic structural diagram of a data processing device according to an embodiment of this application.
  • This application provides a data processing scheme for solving the problem of graph boxing (placing graphs in a container).
  • a suitable placement rule is determined for the N graphs, and then the N graphs are placed in a container according to the determined placement rule, thereby realizing targeted provision of the placement rule for the N graphs.
  • placement of the N graphs using the targeted placement rule can improve a container filling rate.
  • the data processing scheme may be performed by a data processing device.
  • the data processing device may be a terminal device such as a smartphone, a tablet computer, a laptop computer, a desktop computer, a smart voice interaction device, a smart appliance, a smartwatch, a vehicle-mounted terminal, or an aircraft.
  • the data processing device may also be a server such as an independent physical server, a server cluster or distributed system composed of a plurality of physical servers, and a cloud server providing cloud computing services.
  • the data processing scheme provided by this embodiment of this application may be applied in automatic light texture mapping (2UV or Light Mapping) expanded item
  • automatic 2UV is a game art resource automated production tool for replacing a 2UV manual manufacture process of a scene model in a game item.
  • the three-dimensional model may be a three-dimensional model in any scene, such as a game prop in a game scene, or a game character.
  • the three-dimensional model may be any virtual item in a virtual space scene, such as a cup or a chair.
  • the three-dimensional model is three-dimensional and textures for characterizing the texture details are two-dimensional, 3D meshes in the three-dimensional model need to be transferred to a 2D space in order to add textures to the three-dimensional model, the process is referred to as UV mapping.
  • texture mapping also referred to as texture mapping 1 UV
  • light texture mapping also referred to as 2UV/Light Mapping
  • the texture mapping is the process of mapping texture pixels in a texture space to pixels in the 2D space.
  • 2UV is a general term of light textures and UV mapping.
  • the light textures also referred to as light maps
  • the light maps are light intensity data of a three-dimensional engine that contains light information. The light maps are precomputed for static targets, and the amount of computation is less than real-time lighting computation.
  • FIG. 1 shows a setting window in automatic 2UV expansion according to an embodiment of this application.
  • the setting window may include global parameters required for automatic 2UV expansion as shown in a region 101 of FIG. 1 , such as coordinate system direction, light texture resolution, and number of pixels on an edge of a UV island.
  • Each parameter may correspond to a setting option, and the corresponding parameter may be set by triggering any setting option.
  • the parameter of coordinate system direction corresponds to a setting option 110 , and the coordinate system direction may be set by triggering the setting option 110 . It is assumed that the coordinate system direction is z-axis upward in FIG. 1 .
  • the setting option corresponding to the parameter of light texture resolution is 111 , and the light texture resolution may be set by triggering the setting option 111 .
  • the light texture resolution is set to 1024 in this embodiment of this application.
  • the setting window in automatic 2UV expansion may also include execution steps of automatic 2UV expansion, as shown in a region 102 of FIG. 1 .
  • Each execution step may set corresponding input and output names, and a corresponding execution rule may be set for each execution step.
  • the set execution rule may be fewer cutting lines.
  • the data processing scheme in this embodiment of this application may be imported to achieve compact boxing in the case of a high filling rate.
  • Each execution step may be executed separately.
  • each execution step corresponds to an “execute” button.
  • the execution step corresponding to the execute button will be executed.
  • the above three steps may be initiated and executed at the same time, and the three steps are executed sequentially in the order shown in FIG. 1 .
  • the setting window includes a “one-click execute” button. By triggering the “one-click execute” button, the three steps may be initiated at the same time, whereby the three steps are executed sequentially.
  • N to-be-placed graphs refer to N UV islands.
  • a reference UV island is determined from the N UV islands based on a graphic attribute of each UV island.
  • a placement rule applicable to the N UV islands is determined from at least one placement rule according to a relationship between a graphic attribute of the reference UV island and an attribute threshold, and the N UV islands are placed in a container according to the determined placement rule.
  • FIG. 2 is a schematic flowchart of a data processing method according to an embodiment of this application.
  • the data processing method in FIG. 2 may be performed by a data processing device, and may specifically be performed by a processor of the data processing device.
  • the data processing method in FIG. 2 may include the following steps:
  • Step S 201 Obtain N graphs and a container for placing the N graphs.
  • the N graphs may be graphs of any shape.
  • the N graphs may be polygons of a regular shape, such as rectangles, triangles, or circles.
  • the N graphs may also be polygons of an irregular shape.
  • Each graph in the N graphs may be an independent polygon, or a graph spliced from a plurality of polygons.
  • the N graphs may include some identical graphs.
  • FIG. 3 a is a schematic diagram of N graphs according to an embodiment of this application.
  • N graphs shown in FIG. 3 a may include independent polygons 301 and 302 of a regular shape, and may also include spliced polygons 303 and 304 of an irregular shape.
  • the N graphs may include some identical graphs such as three polygons 301 , two polygons 302 , and two polygons 303 .
  • a container for placing the N graphs refers to a graph capable of placing other graphs therein.
  • the container may be a graph of a regular shape or a graph of an irregular shape.
  • FIG. 3 b is a schematic diagram of a container according to an embodiment of this application. 31 represents a container of an irregular shape, and 32 represents a container of a regular shape.
  • the N graphs and the container for placing the N graphs may be stored in a local storage of a data processing device.
  • the data processing device loads the N graphs and the container from the local storage.
  • the N graphs and the container for placing the N graphs may be stored in other devices.
  • the data processing device receives the N graphs and the container for placing the N graphs, which are transmitted by the other devices, through interaction with the other devices.
  • Step S 202 Determine a reference graph from the N graphs based on a graphic attribute of each graph.
  • the graphic attribute of each graph may include a graphic area.
  • the operation of determining a reference graph from the N graphs based on a graphic attribute of each graph may refer to: determining the reference graph from the N graphs based on the graphic area of each graph.
  • a total area of the N graphs is determined based on the graphic area of each graph.
  • An area difference between the graphic area of each graph and the total area is determined.
  • a first graph in the N graphs is determined as the reference graph. The area difference between the graphic area of the first graph and the total area satisfies a first area difference threshold.
  • the area difference between the graphic area of each graph and the total area of the N graphs is calculated, and a graph in which the area difference between the graphic area and the total area satisfies the first area difference threshold is determined as the reference graph in the N graphs.
  • the N graphs include graph 1 and graph 2 . If the area difference between graph 1 and the total area satisfies the first area difference threshold, graph 1 is a reference graph. Similarly, if the area difference between graph 2 and the total area satisfies the first area difference threshold, graph 2 is also a reference graph.
  • the N graphs include one or more reference graphs.
  • the area difference between the graphic area of each graph and the total area may be represented by a ratio.
  • the ratio between the graphic area of the first graph and the total area is the area difference between the graphic area of the first graph and the total area.
  • the first area difference threshold is a preset ratio set in advance. The situation that the area difference between the graphic area of the first graph and the total area satisfies the first area difference threshold refers to that: a proportion between the graphic area of the first graph and the total area is greater than or equal to the preset ratio.
  • the above-mentioned ratio may be represented by percentage.
  • the first area difference threshold may be 5%.
  • the first graph is determined as the reference graph. In other words, a graph having the graphic area greater than 5% of the total area in the N graphs is determined as the reference graph.
  • the first area difference threshold is used for determining the reference graph.
  • the area difference between the graphic area of the reference graph and the total area satisfies the first area difference threshold.
  • the reference graph has a larger graphic area than other graphs in the N graphs, and has a greater influence on a container filling rate.
  • a placement rule corresponding to the N graphs is determined according to a relationship between the graphic attribute of the reference graph and the attribute threshold, which helps to improve the reliability of the placement rule determined finally.
  • the graphic attribute of each graph may further include a graphic long-side length of each graph.
  • the operation of determining a reference graph from the N graphs based on a graphic attribute of each graph may refer to: determining the reference graph from the N graphs based on the graphic long-side length of each graph.
  • a plurality of candidate graphs are determined from the N graphs. determining a length difference between the graphic long-side length of each graph in the plurality of candidate graphs and a long-side length of the container; and determining a second graph in the plurality of candidate graphs as the reference graph, the length difference between the graphic long-side length of the second graph and the long-side length of the container satisfying a length difference threshold.
  • the plurality of candidate graphs include N graphs. That is to say, the reference graph is selected from the N graphs according to the graphic long-side length of each graph.
  • the plurality of candidate graphs may further include: remaining graphs other than the first graph in the N graphs. That is to say, if the reference graph has been selected from the N graphs according to the graphic area of each graph, some reference graphs may also be selected from remaining images other than the selected reference graph in the N graphs according to the graphic long-side length. In this way, in the N graphs, the length difference between the graphic long-side length and the long-side length of the container satisfies the length difference threshold. Alternatively, the graph in which the area difference between the graphic area and the total area satisfies the first area difference threshold may be selected as the reference graph.
  • the length difference between the graphic long-side length of each graph and the long-side length of the container may be represented by a ratio.
  • the ratio between the graphic long-side length of the second graph and the long-side length of the container is the length difference between the graphic long-side length of the second graph and the long-side length of the container.
  • the length difference threshold is a preset ratio set in advance.
  • the condition that the length difference between the graphic long-side length of the second graph and the long-side length of the container satisfies the length difference threshold refers to that: a proportion between the graphic long-side length of the second graph and the long-side length of the container is greater than or equal to the preset ratio.
  • the above-mentioned ratio may be represented by percentage.
  • the length difference threshold may be 55%. If the ratio between the graphic long-side length of the second graph in the N graphs and the long-side length of the container is greater than 55%, the second graph is determined as the reference graph. In other words, a graph having the graphic long-side length greater than 55% of the long-side length of the container in the N graphs is determined as the reference graph.
  • the length difference between the graphic long-side length of the reference graph and the long-side length of the container satisfies the length difference threshold.
  • the reference graph has a larger graphic long-side length than other graphs in the N graphs, and has a greater influence on a container filling rate.
  • a placement rule corresponding to the N graphs is determined according to a relationship between the graphic attribute of the reference graph and the attribute threshold, which helps to improve the reliability of the placement rule determined finally.
  • Step S 203 Determine a placement rule corresponding to the N graphs from at least one placement rule according to a relationship between a graphic attribute of the reference graph and an attribute threshold.
  • the at least one placement rule includes a global scaling placement rule and a mixed scaling placement rule.
  • the operation of determining a placement rule corresponding to the N graphs from at least one placement rule according to a relationship between a graphic attribute of the reference graph and an attribute threshold may include: determining the mixed scaling placement rule as the placement rule corresponding to the N graphs in response to a first numerical relationship between the graphic attribute of the reference graph and the attribute threshold; and determining the global scaling placement rule as the placement rule corresponding to the N graphs in response to a second numerical relationship between the graphic attribute of the reference graph and the attribute threshold.
  • the graphic attribute of the reference graph mentioned here refers to a graphic area attribute of the reference graph.
  • the graphic area attributes of the reference graphs are the result of adding the graphic areas of the plurality of reference graphs.
  • the attribute threshold may be determined based on the total area of the N graphs and a second area difference threshold. Specifically, the total area of the graphs and the second area difference threshold may be multiplied to obtain a result serving as the attribute threshold.
  • the second area difference threshold is a preset ratio set in advance, which may be represented by percentage. For example, the second area difference threshold may be 55%.
  • the attribute threshold may also be a value that is pre-executed based on experience. The second area difference threshold is used for determining the attribute threshold.
  • the first numerical relationship between the graphic attribute of the reference graph and the attribute threshold refers to that: the graphic area of the reference graph is greater than the attribute threshold.
  • the second numerical relationship between the graphic attribute of the reference graph and the attribute threshold refers to that: the graphic area of the reference graph is less than or equal to the attribute threshold.
  • Step S 204 Place the N graphs in the container according to the placement rule corresponding to the N graphs.
  • the operation of placing the N graphs in the container according to the placement rule corresponding to the N graphs may refer to: performing independent scaling placement on the reference graph according to the independent scaling placement rule, and placing the reference graph in the container according to an independent scaling placement result; and performing global scaling placement on remaining graphs other than the reference graph in the N graphs according to the global scaling placement rule, and placing the remaining graphs in the container according to a global scaling placement result.
  • the operation of placing the N graphs in the container according to the mixed placement rule refers to: processing the reference graph and remaining graphs other than the reference graph in the N graphs according to difference placement rules in the mixed placement rule, respectively.
  • the operation of placing the N graphs in the container according to the placement rule corresponding to the N graphs refers to: performing global scaling placement on each graph in the N graphs according to the global scaling placement rule, and placing each graph in the N graphs in the container according to a global scaling placement result. That is to say, if it is determined, based on the relationship between the graphic attribute of the reference graph and the attribute threshold, that the placement rule corresponding to the N graphs is a global scaling placement rule, all the graphs in the N graphs are processed according to the global scaling placement rule to place the N graphs in the container.
  • the N graphs are placed in the container using different placement rules. This is because if there is a first numerical relationship between the graphic attribute of the reference graph and the attribute threshold, the reference graph has a larger graphic area or a larger graphic long-side length than other graphs in the N graphs, and there will be certain restrictions on a global scaling proportion when scaling globally. That is to say, it cannot be scaled to a small size. If the reference graph and other graphs are subjected together to global scaling placement without considering this, the overall global scaling proportion will be affected, thereby affecting the container filling rate.
  • FIG. 4 a is a schematic diagram of placement of N graphs in a container according to an embodiment of this application.
  • FIG. 4 b is another schematic diagram of placement of N graphs in a container according to an embodiment of this application.
  • 401 represents a placement result of placing each graph in the N graph in the container after performing global scaling placement according to the global scaling placement rule
  • 404 represents a placement result of placing the N graphs in the container using the mixed scaling placement rule.
  • the N graphs in 401 and 402 are identical, and the N graphs in 403 and 404 are identical.
  • the N graphs are placed in the container using the mixed scaling placement rule when the graphic data of the reference graph is greater than the attribute threshold.
  • a higher container filling rate is achieved compared with placement of the N graphs in the container according to the global scaling placement rule.
  • the N graphs are placed according to different placement rules and the N graphs are placed in the container, thereby realizing targeted boxing.
  • the N graphs are boxed using a suitable placement rule. In this way, the container filling rate can be improved to some extent.
  • FIG. 5 is a schematic flowchart of another data processing method according to an embodiment of this application.
  • the data processing method in FIG. 5 may be performed by a data processing device, and may specifically be performed by a processor of the data processing device.
  • the data processing method in FIG. 5 may include the following steps:
  • Step S 501 Obtain N graphs and a container for placing the N graphs.
  • Step S 502 Determine a reference graph from the N graphs based on a graphic attribute of each graph.
  • step S 501 and step S 502 may be described with reference to step S 201 and step S 202 in the embodiment of FIG. 2 , and will not be described in detail herein.
  • Step S 503 Determine the mixed scaling placement rule as the placement rule corresponding to the N graphs in response to a first numerical relationship between the graphic attribute of the reference graph and the attribute threshold, and place the N graphs in the container according to the mixed scaling placement rule.
  • the operation of placing the N graphs in the container according to the mixed scaling placement rule refers to: performing independent scaling placement on the reference graph in the N graphs according to the independent scaling placement rule, and placing the reference graph in the container according to an independent scaling placement result; and performing global scaling placement on remaining graphs other than the reference graph in the N graphs according to the global scaling placement rule, and placing the remaining graphs in the container according to a global scaling placement result.
  • Step S 504 Determine the global scaling placement rule as the placement rule corresponding to the N graphs in response to a second numerical relationship between the graphic attribute of the reference graph and the attribute threshold, and place the N graphs in the container according to the global scaling placement rule.
  • the operation of placing the N graphs in the container according to the global scaling placement rule refers to: performing global scaling placement on each graph in the N graphs according to the global scaling placement rule, and placing each graph in the N graphs in the container according to a global scaling placement result.
  • the process of independent scaling placement and the process of global scaling placement are introduced below respectively.
  • the number of independent scaling placements is i, i being a positive integer.
  • the process of performing independent scaling placement on the reference graph according to the independent scaling placement rule includes:
  • the global scaling placement is involved in step S 503 and step S 504 but for different objects, and the process of the global scaling placement is the same. Therefore, for the convenience of description, a graph required for global scaling placement in the N graphs is added to the first to-be-placed graph set.
  • the graphs in the first to-be-placed graph set are objects subjected to global scaling placement.
  • the first to-be-placed graph set includes remaining graphs other than the reference graph in the N graphs.
  • the first to-be-placed graph set includes N graphs.
  • the number of global scaling placements is r, r being a positive integer.
  • the process of global scaling placement includes:
  • a first container filling rate is determined from container filling rates corresponding to first placement results determined in all cycles, and an independent scaling proportion when the first container filling rate is obtained is obtained.
  • the reference graph is scaled according to the obtained independent scaling proportion, and the scaled reference graph is placed in the container according to the first placement result corresponding to the first container filling rate.
  • the first container filling rate may be a maximum container filling rate in the container filling rates determined in all cycles. In this way, the reference graph is placed in the container according to the first placement result corresponding to the first container filling rate, thereby ensuring that the container filling rate of the container is the best.
  • step S 503 the reference graph and the remaining graphs other than the reference graph in the N graphs are subjected to scaling placement respectively and then placed in the container. How to place the reference graph in the container has been described above, and how to place the remaining graphs other than the reference graph in the N graphs in the container will be described below. Specifically, after performing global scaling placement on the remaining graphs according to the foregoing process of global scaling placement, a global scaling placement result is obtained, and then the remaining graphs are placed in the container according to the global scaling placement result.
  • the operation of placing the remaining graphs in the container according to a global scaling placement result may include: determining a second container filling rate from container filling rates corresponding to second placement results determined in all cycles in the process of global scaling placement, and obtaining a global scaling proportion when the second container filling rate is obtained; and scaling the remaining graphs according to the obtained global scaling proportion, and placing the scaled remaining graphs in the container according to the second placement result corresponding to the second container filling rate.
  • the second container filling rate may be a maximum container filling rate in the container filling rates corresponding to the second placement results determined in all cycles.
  • the remaining graphs are placed in the container according to the global scaling proportion corresponding to the maximum container filling rate, thereby ensuring the best container filling rate.
  • each graph in the N graphs is placed in the container according to the global scaling placement rule. That is, global scaling placement is performed on each graph in the N graphs, and then each graph is placed in the container according to the global scaling placement result.
  • the process of performing global scaling placement on each graph in the N graphs may be described as above.
  • the operation of placing each graph in the container according to a global scaling placement result may include: determining a second container filling rate from container filling rates corresponding to second placement results determined in all cycles in the process of global scaling placement, and obtaining a global scaling proportion when the second container filling rate is obtained; and scaling each graph in the N graphs according to the obtained global scaling proportion, and placing each scaled graph in the container according to the second placement result corresponding to the second container filling rate.
  • each graph in the N graphs can be placed in the container in a suitable manner through step S 503 and step S 504 , so as to ensure the best container filling rate.
  • a certain graph is placed in each cycle to obtain a placement result.
  • the independently scaled reference graph needs to be placed in each cycle to obtain a first placement result.
  • each globally scaled graph in the first to-be-placed graph set needs to be placed in each cycle to obtain a second placement result of the first to-be-placed graph set.
  • the placement processes for the independently scaled reference graph and the globally scaled graph in the first to-be-placed graph set are the same. Therefore, in order to introduce the placement process below, a graph to be placed is added to a second to-be-placed graph set.
  • the second to-be-placed graph set may include independently scaled reference graphs in all independent scaling placement processes, or globally scaled graphs in the first to-be-placed graph set in all global scaling placement processes.
  • the operation of placing the independently scaled reference graph to obtain a first placement result indicating that the independently scaled reference graph is placed in the container and placing each globally scaled graph in the first to-be-placed graph set to obtain a second placement result indicating that the first to-be-placed graph set is placed in the container refers to: placing the graphs in the second to-be-placed graph set to obtain a placement result indicating that the second to-be-placed graph set is placed in the container.
  • the operation of placing the graphs in the second to-be-placed graph set to obtain a placement result indicating that the second to-be-placed graph set is placed in the container includes: grouping the second to-be-placed graph set according to a graphic area of each graph in the second to-be-placed graph set to obtain P graph groups arranged sequentially, each graph group including one or more graphs belonging to the second to-be-placed graph set, the graphic area of each graph in the top-ranked graph groups being greater than the graphic area of each graph in the bottom-ranked graph groups, and the graphs in each graph group being ranked in descending order of the graphic area; placing each graph group to determine a placement result corresponding to each graph group; and combining the placement results corresponding to the graph groups into a placement result indicating that each graph in the second to-be-placed graph set is placed in the container.
  • the P graph groups include a graph group j and the graph group j includes Mj graphs.
  • the graph group j includes Mj graphs.
  • the operation of placing the graph group j to determine a placement result corresponding to the graph group j may include:
  • the situation that the average placement center-of-gravity satisfies the center-of-gravity condition may refer to that: the average placement center-of-gravity is minimal in the average placement centers-of-gravity corresponding to all candidate individuals.
  • the cross transformation processing of the graph group j may be implemented based on a genetic algorithm.
  • the genetic algorithm is a computational model that simulates the biological evolution process of natural selection and genetic mechanism of Darwin's theory of biological evolution, and is a method of searching for an optimal solution by simulating the natural evolution process.
  • the algorithm uses computer simulation operations to convert the problem solving process into a process similar to the cross and variation of chromosome genes in biological evolution. When solving more complex combinatorial optimization problems, better optimization results can usually be obtained quickly compared with some conventional optimization algorithms.
  • the data processing device may determine a placement result corresponding to any candidate individual using a boxing algorithm based on no fit polygon (NFP) and lowest center-of-gravity principle.
  • NFP refers to a polygon formed by a trajectory of a reference point on a boundary when a polygon (referring to a graph in this application) along an internal boundary of another polygon (referring to a container in this application).
  • NFP defines a feasible region when placing a polygon into the container.
  • the operation that the data processing device determines a placement result corresponding to any candidate individual using the boxing algorithm based on NFP and lowest center-of-gravity principle may include: sequentially taking out each graph from any candidate individual in the plurality of candidate individuals, and calculating a candidate placement angle of each graph; and determining a placement position of each graph in the container based on a lowest center-of-gravity principle and the candidate placement angle of each graph, and placing each graph in the container according to the determined placement position to obtain the placement result corresponding to the candidate individual.
  • the boxing algorithm based on NFP and lowest center-of-gravity principle is also used for filling the N graphs into the container.
  • practice has proved that although the boxing algorithm may obtain reasonable placement results, the boxing algorithm has a long calculation time and a low container filling rate.
  • this application takes into account that in most scenes such as a game art production 2UV scene, graphs are allowed to be deformed, and the inputted graphs may be enlarged or reduced on the basis of satisfying an original relative proportion, so as to make the ultimate use of the space of the container. Therefore, a data processing method in FIG. 5 is provided. The data processing method in FIG. 5 is used for placing N graphs in a container to ensure a high container filling rate.
  • the identical symmetric graphs are grouped in a same graph group, the identical symmetric graphs correspond to identical scaling proportions during scaling, and the identical symmetric graphs are gathered and placed during placement.
  • a symmetrical graph is an image that is symmetrical in shape, for example, an axisymmetric image or a center-symmetrical image.
  • the same symmetrical graphs are graphs that are not only consistent in shape, but also symmetrical.
  • FIG. 6 a and FIG. 6 b are two schematic diagrams of placement of N graphs in a container according to an embodiment of this application.
  • graphs in a region 601 are symmetrical, the graphs tend to converge together, and the graphs maintain the same scaling proportion.
  • graphs in a region 602 are symmetrical.
  • graphs in 603 are symmetrical to each other and graphs in 604 are symmetrical to each other. Since each graph group is placed separately, in order to place the same symmetrical graphs together and maintain a consistent scaling proportion, when grouping, the same symmetrical graphs may be divided into the same graph group, whereby the same symmetrical graphs may be placed in the same space region, so as to ensure a high container filling rate while ensuring the neatness of filling.
  • the step of placing the graphs in the second to-be-placed graph set to obtain a placement result indicating that the second to-be-placed graph set is placed in the container will be performed repeatedly in either the process of independent scaling placement or the process of global scaling placement.
  • this application introduces the technique of snap rounding in robust geometric calculation when performing the step.
  • snap rounding may be classified as a finite precision approximation technology, which is a method for converting an arbitrary precision arrangement of line segments into a fixed-precision representation.
  • the application of snap rounding in this application is mainly used for constraining the number of decimal places in vertex data of any graph. For example, when placing any graph in the container, it is calculated that vertex coordinates of any graph are n decimal places. The n decimal places need to consume more calculation time when calculating a placement position of any graph or other information.
  • the snap rounding techniques are introduced to specify that the decimal places of the vertex coordinates are m, m is much less than n, and the calculation time can be saved.
  • a graph A 2 obtained by snap rounding is required to be less than any graph A 1 .
  • the data processing method in this embodiment of this application may be implemented based on software, such as integrating a boxing algorithm in a data processing device, and the data processing device executes the boxing algorithm to realize placement of N graphs in a container.
  • the input of the boxing algorithm is N graphs and a container for placing N graphs.
  • N to-be-placed graphs are first arranged in descending order of a graphic area.
  • a graph having the graphic area greater than 5% of a total area of the N graphs or a long side of an oriented bounding box (long-side length of the graph) greater than 55% of a long-side length of the container is selected as a reference graph.
  • the selected reference graph is also referred to as a big island.
  • the boxing algorithm may include three algorithm modules: a basic public algorithm module, an independent scaling algorithm module, and a global scaling algorithm module.
  • the basic public algorithm module is shared by the independent scaling algorithm module and the global scaling algorithm module, and is designed based on the genetic algorithm, NFP and global lowest center-of-gravity principle.
  • the algorithm process of the basic public algorithm module is as follows.
  • To-be-placed scaled graphs (the to-be-placed scaled graphs include an independently scaled reference graph, N globally scaled graphs, and remaining graphs other than the reference graph in the N graphs, where the to-be-placed scaled graphs are equivalent to the above-mentioned second to-be-placed graph set) are arranged in descending order of a graphic area, the first m graphs are taken as basic individuals, and n candidate individuals of a population are generated according to basic operations such as cross, variation, and exchange of a genetic algorithm. Each candidate individual is a sequence composed of m graphs. In different candidate individuals, the m graphs are arranged in different orders.
  • the n candidate individuals of the population may be represented as [ ⁇ S 1 ⁇ , ⁇ S 2 ⁇ , . . . , ⁇ S n ⁇ ], where S i represents an i th candidate individual in the n candidate individuals, and i is greater than or equal to 1, and less than or equal to n.
  • a plurality of graphs in each candidate individual S i of the population are sequentially taken out based on NFP and lowest center-of-gravity principle, a candidate angle of each graph is calculated, a placement position of each graph is calculated according to NFP and the space of the container is updated until each graph in S i is placed in the container. If it is found that a valid placement result cannot be obtained according to the arrangement order of the graphs in the sequence, this candidate individual is skipped, and a next candidate individual S i+1 is processed.
  • a plurality of valid placement results may be obtained by step 2), and a candidate individual with the lowest center-of-gravity is selected from the plurality of valid placement results as the best candidate individual of the population, namely the best boxing result for the m graphs. Then the remaining container space and to-be-boxed scaled graphs are updated. If there are scaled graphs that are not boxed, the process skips to step 1). Otherwise, the algorithm process of the basic public algorithm module is ended.
  • the valid placement result refers to that the graphs may be successfully placed in the container without overlapping each other.
  • the algorithm process of the independent scaling algorithm module is as follows.
  • the independent scaling proportion combination is obtained by combining the independent scaling proportions of the reference graphs together.
  • the independent scaling proportion combination may be represented as ⁇ scale 1 , scale 2 , . . . scale w ⁇ .
  • the basic public algorithm module is used for the current independently scaled w reference graphs.
  • a container filling rate (equivalent to the above-mentioned container filling rate corresponding to the first placement result) corresponding to the current independent scaling proportion combination is calculated, a global optimal container filling rate is updated, and the process skips to step 2).
  • a placement result corresponding to the global optimal container filling rate is outputted (equivalent to the above-mentioned operation of obtaining a first container filling rate in the container filling rates corresponding to the first placement result and placing the reference graph according to the first placement result corresponding to the first container filling rate).
  • the algorithm process of the global scaling algorithm module is as follows.
  • the remaining to-be-placed graphs are updated according to the placed reference graph, and the remaining graphs are taken as execution objects of the global scaling algorithm module. If the independent scaling algorithm module is not executed, the N to-be-placed graphs are taken as execution objects of the global scaling algorithm module. The remaining space of the container is updated, and an upper limit of attempts for a global scaling proportion is set.
  • step 5 If the number of attempts for the global scaling proportion reaches the upper limit, the process skips to step 5), otherwise a current global scaling proportion is updated as scale g , and the execution objects are uniformly scaled according to the global scaling proportion.
  • the basic public algorithm module is used for the execution objects scaled according to scale g .
  • a container filling rate corresponding to the current global scaling proportion is calculated, a global optimal container filling rate is updated, and the process skips to step 2).
  • a placement result corresponding to the global optimal container filling rate is outputted (equivalent to the above-mentioned operation of obtaining a second container filling rate in the container filling rates corresponding to the second placement result and placing the remaining graphs in the N graphs or the N graphs according to the second placement result corresponding to the second container filling rate).
  • the data processing device places the N graphs in the container using the boxing algorithm.
  • the N graphs are placed according to different placement rules and the N graphs are placed in the container, thereby realizing targeted boxing.
  • the N graphs are boxed using a suitable placement rule. In this way, the container filling rate can be improved to some extent.
  • FIG. 7 is a schematic structural diagram of a data processing apparatus according to an embodiment of this application.
  • the data processing apparatus in FIG. 7 may include the following units:
  • the at least one placement rule includes a mixed scaling placement rule and a global scaling placement rule.
  • the determination unit 702 when determining a placement rule corresponding to the N graphs from at least one placement rule according to a relationship between a graphic attribute of the reference graph and an attribute threshold, performs the following steps:
  • the graphic attribute of each graph includes a graphic area of each graph.
  • the determination unit 702 when determining a reference graph from the N graphs based on a graphic attribute of each graph, performs the following steps:
  • the graphic attribute of each graph includes a graphic long-side length of each graph.
  • the determination unit 702 when determining a reference graph from the N graphs based on a graphic attribute of each graph, performs the following steps:
  • the attribute threshold is determined based on the total area of the N graphs and a second area difference threshold.
  • the determination unit 702 is further configured to:
  • the N graphs are required to be processed by global scaling placement.
  • the graphs required to be processed by global scaling placement are added in a first to-be-placed graph set, and the number of global scaling placements is r, r being positive integer.
  • the process of global scaling placement includes:
  • the placement unit 703 in response to the placement rule corresponding to the N graphs including a mixed scaling placement rule and the mixed scaling placement rule including an independent scaling placement rule and a global scaling placement rule, performs the following steps:
  • the placement unit 703 in response to the placement rule corresponding to the N graphs being a global scaling placement rule, performs the following steps:
  • the number of independent scaling placements is i, i being a positive integer.
  • the process of performing independent scaling placement on the reference graph according to the independent scaling placement rule includes:
  • the placement unit 703 when placing the reference graph in the container according to an independent scaling placement result, performs the following steps:
  • the placement unit 703 when placing the remaining graphs in the container according to a global scaling placement result, performs the following steps:
  • graphs required to be placed are added in a second to-be-placed graph set.
  • the second to-be-placed graph set includes the independently scaled reference graph in the process of each independent scaling placement.
  • the second to-be-placed graph set includes the globally scaled graphs in the first to-be-placed graph set in the process of each global scaling placement.
  • the placement unit 703 when placing the graphs in the second to-be-placed graph set to obtain a placement result indicating that the second to-be-placed graph set is placed in the container, performs the following steps:
  • the placement unit 703 when placing the graph group j to determine a placement result corresponding to the graph group j, performs the following steps:
  • the placement unit 703 when placing the Mj graphs according to the arrangement order of the Mj graphs in each candidate individual to obtain a placement result corresponding to each candidate individual, performs the following steps:
  • the identical symmetric graphs are grouped in a same graph group, the identical symmetric graphs correspond to identical scaling proportions during scaling, and the identical symmetric graphs are gathered and placed during placement.
  • step S 202 and step S 203 in FIG. 2 may be performed by the determination unit 702 in the data processing apparatus shown in FIG. 7
  • step S 201 may be performed by the obtaining unit 701 in the data processing apparatus shown in FIG. 7
  • step S 204 may be performed by the placement unit 703 in the data processing apparatus shown in FIG. 7
  • step S 501 in FIG. 5 may be performed by the obtaining unit 701 in the data processing apparatus shown in FIG. 7
  • step S 502 may be performed by the determination unit 702 in the data processing apparatus shown in FIG. 7
  • step S 503 and step S 504 may be performed by the determination unit 702 and the placement unit 703 in the data processing apparatus shown in FIG. 7 .
  • the units in the data processing apparatus shown in FIG. 7 may be respectively or completely combined into one or more other units to constitute the apparatus, or some unit(s) therein may be further divided into a plurality of functionally smaller units, and the same operation may be realized without affecting the achievement of the technical effects of this embodiment of this application.
  • the foregoing units are divided based on logical functions. In practice, a function of one unit may be realized by a plurality of units, or functions of a plurality of units are realized by one unit. In other embodiments of this application, the data processing apparatus may also include other units. In practice, the functions may also be realized with the aid of other units, and may be realized in cooperation by a plurality of units.
  • the data processing apparatus shown in FIG. 7 may be constructed and the data processing method according to this embodiment of this application may be implemented by running computer-readable instructions (including program codes) capable of performing the steps of the corresponding method shown in FIG. 2 and FIG. 5 on processing elements and storage elements including a central processing unit (CPU), a random access memory (RAM), a read-only memory (ROM), and so on, for example, general computer devices of computers.
  • the computer-readable instructions may be recorded in, for example, a computer-readable storage medium, may be loaded into a data processing device by using the computer-readable storage medium, and run in the data processing device.
  • a reference graph is first determined from the N graphs based on a graphic attribute of each graph. Then a placement rule suitable for the N graphs is determined from at least one placement rule according to a relationship between a graphic attribute of the reference graph and an attribute threshold. Finally, the N graphs are placed in the container according to the determined placement rule. It is to be understood that N graphs are placed using a suitable placement rule, thereby implementing targeted placement processing and effectively improving a container filling rate.
  • FIG. 8 is a schematic structural diagram of a data processing device according to an embodiment of this application.
  • the data processing device shown in FIG. 8 may include a processor 801 , an input interface 802 , an output interface 803 , and a computer storage medium 804 .
  • the processor 801 , the input interface 802 , the output interface 803 , and the computer storage medium 804 may be connected by a bus or in other manners.
  • the computer storage medium 804 may be stored in a memory of a message processing device.
  • the computer storage medium 804 is configured to store computer-readable instructions.
  • the processor 801 is configured to execute the computer-readable instructions stored in the computer storage medium 804 .
  • the processor 801 (or referred to as a CPU) is a computing core and a control core of the data processing device, is adapted to implement one or more computer-readable instructions, and is specifically loaded and adapted to:
  • a reference graph is first determined from the N graphs based on a graphic attribute of each graph. Then a placement rule suitable for the N graphs is determined from at least one placement rule according to a relationship between a graphic attribute of the reference graph and an attribute threshold. Finally, the N graphs are placed in the container according to the determined placement rule. It is to be understood that N graphs are placed using a suitable placement rule, thereby implementing targeted placement processing and effectively improving a container filling rate.
  • the memory is a memory device of a data processing device for storing programs and data. It is to be understood that the memory here may include an internal memory of the data processing device, and may also include an expanded memory supported by the data processing device.
  • the memory provides a storage space. The storage space stores an operating system of the data processing device. Moreover, one or more computer-readable instructions loaded and executed by the processor 801 are also stored in the storage space.
  • the memory here may be a high-speed RAM, or a non-volatile memory, for example, at least one magnetic disk storage. In some embodiments, the memory may be at least one memory that is located far away from the foregoing processor.
  • the one or more computer-readable instructions stored in the memory may be loaded and executed by the processor 801 to:
  • the at least one placement rule includes a mixed scaling placement rule and a global scaling placement rule.
  • the processor 801 when determining a placement rule corresponding to the N graphs from at least one placement rule according to a relationship between a graphic attribute of the reference graph and an attribute threshold, performs the following steps:
  • the graphic attribute of each graph includes a graphic area of each graph.
  • the processor 801 when determining a reference graph from the N graphs based on a graphic attribute of each graph, performs the following steps:
  • the graphic attribute of each graph includes a graphic long-side length of each graph.
  • the processor 801 when determining a reference graph from the N graphs based on a graphic attribute of each graph, performs the following steps:
  • the attribute threshold is determined based on the total area of the N graphs and a second area difference threshold.
  • the processor 801 is further configured to:
  • the N graphs are required to be processed by global scaling placement.
  • the graphs required to be processed by global scaling placement are added in a first to-be-placed graph set, and the number of global scaling placements is r, r being positive integer.
  • the process of global scaling placement includes:
  • the processor 801 in response to the placement rule corresponding to the N graphs including a mixed scaling placement rule and the mixed scaling placement rule including an independent scaling placement rule and a global scaling placement rule, performs the following steps:
  • the processor 801 in response to the placement rule corresponding to the N graphs being a global scaling placement rule, performs the following steps:
  • the number of independent scaling placements is i, i being a positive integer.
  • the process of performing independent scaling placement on the reference graph according to the independent scaling placement rule includes:
  • the processor 801 when placing the reference graph in the container according to an independent scaling placement result, performs the following steps:
  • the processor 801 when placing the remaining graphs in the container according to a global scaling placement result, performs the following steps:
  • graphs required to be placed are added in a second to-be-placed graph set.
  • the second to-be-placed graph set includes the independently scaled reference graph in the process of each independent scaling placement.
  • the second to-be-placed graph set includes the globally scaled graphs in the first to-be-placed graph set in the process of each global scaling placement.
  • the processor 801 when placing the graphs in the second to-be-placed graph set to obtain a placement result indicating that the second to-be-placed graph set is placed in the container, performs the following steps:
  • the processor 801 in response to the P graph groups including a graph group j, the graph group j including Mj graphs, and Mj being a positive integer, performs the following steps:
  • the processor 801 when placing the Mj graphs according to the arrangement order of the Mj graphs in each candidate individual to obtain a placement result corresponding to each candidate individual, performs the following steps:
  • the identical symmetric graphs are grouped in a same graph group, the identical symmetric graphs correspond to identical scaling proportions during scaling, and the identical symmetric graphs are gathered and placed during placement.
  • a reference graph is first determined from the N graphs based on a graphic attribute of each graph. Then a placement rule suitable for the N graphs is determined from at least one placement rule according to a relationship between a graphic attribute of the reference graph and an attribute threshold. Finally, the N graphs are placed in the container according to the determined placement rule. It is to be understood that N graphs are placed using a suitable placement rule, thereby implementing targeted placement processing and effectively improving a container filling rate.
  • This embodiment of this application also provides a computer program product or a computer-readable instruction.
  • the computer program product includes the computer-readable instruction.
  • the computer-readable instruction is stored in a computer storage medium.
  • the computer-readable instruction is loaded and executed by the processor 801 to:
  • a reference graph is first determined from the N graphs based on a graphic attribute of each graph. Then a placement rule suitable for the N graphs is determined from at least one placement rule according to a relationship between a graphic attribute of the reference graph and an attribute threshold. Finally, the N graphs are placed in the container according to the determined placement rule. It is to be understood that N graphs are placed using a suitable placement rule, thereby implementing targeted placement processing and effectively improving a container filling rate.
  • a data processing device including a memory and a processor.
  • the memory stores a computer-readable instruction.
  • the processor when executing the computer-readable instruction, implements the steps in the foregoing method embodiments.
  • a computer-readable storage medium stores a computer-readable instruction.
  • the computer-readable instruction when executed by a processor, implements the steps in the foregoing method embodiments.
  • a computer program product includes a computer-readable instruction.
  • the computer-readable instruction when executed by a processor, implements the steps in the foregoing method embodiments.
  • unit refers to a computer program or part of the computer program that has a predefined function and works together with other related parts to achieve a predefined goal and may be all or partially implemented by using software, hardware (e.g., processing circuitry and/or memory configured to perform the predefined functions), or a combination thereof.
  • Each unit or module can be implemented using one or more processors (or processors and memory).
  • a processor or processors and memory
  • each unit or module can be part of an overall module that includes the functionalities of the unit or module.

Landscapes

  • Physics & Mathematics (AREA)
  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Geometry (AREA)
  • Pure & Applied Mathematics (AREA)
  • Mathematical Optimization (AREA)
  • Mathematical Analysis (AREA)
  • Computer Hardware Design (AREA)
  • Evolutionary Computation (AREA)
  • General Engineering & Computer Science (AREA)
  • Computational Mathematics (AREA)
  • Processing Or Creating Images (AREA)
  • Image Generation (AREA)
US18/201,640 2022-02-28 2023-05-24 Data processing method, apparatus, and device and storage medium Pending US20230298237A1 (en)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
CN202210184708.1A CN114255160B (zh) 2022-02-28 2022-02-28 数据处理方法、装置、设备及存储介质
CN202210184708.1 2022-02-28
PCT/CN2022/133999 WO2023160050A1 (zh) 2022-02-28 2022-11-24 数据处理方法、装置、设备及存储介质

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2022/133999 Continuation WO2023160050A1 (zh) 2022-02-28 2022-11-24 数据处理方法、装置、设备及存储介质

Publications (1)

Publication Number Publication Date
US20230298237A1 true US20230298237A1 (en) 2023-09-21

Family

ID=80797095

Family Applications (1)

Application Number Title Priority Date Filing Date
US18/201,640 Pending US20230298237A1 (en) 2022-02-28 2023-05-24 Data processing method, apparatus, and device and storage medium

Country Status (3)

Country Link
US (1) US20230298237A1 (zh)
CN (1) CN114255160B (zh)
WO (1) WO2023160050A1 (zh)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114255160B (zh) * 2022-02-28 2022-06-14 腾讯科技（深圳）有限公司 数据处理方法、装置、设备及存储介质
CN114708358B (zh) * 2022-05-25 2022-09-02 腾讯科技（深圳）有限公司 对象处理方法、装置、设备及计算机可读存储介质
CN114781014B (zh) * 2022-06-17 2022-09-09 腾讯科技（深圳）有限公司 对象处理方法、装置、设备及计算机可读存储介质

Family Cites Families (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7444603B1 (en) * 2006-12-15 2008-10-28 Xilinx, Inc. Transformation of graphs representing an electronic design in a high modeling system
NZ602796A (en) * 2010-04-07 2014-10-31 Ericsson Telefon Ab L M Texture compression and decompression
WO2013091078A1 (en) * 2011-12-23 2013-06-27 Liu Junmin Method for phase unwrapping
US9972111B2 (en) * 2016-02-24 2018-05-15 Adobe Systems Incorporated Optimizing image cropping
KR102049906B1 (ko) * 2016-09-02 2019-11-28 이스탄불 테크니크 위니웨르시테시 분할 패킹 접근 방식에 의한 선박 선체의 소형 플레이트로의 세그먼트화를 위한 컴퓨터 구현 방법
US10540821B2 (en) * 2018-03-09 2020-01-21 Staples, Inc. Dynamic item placement using 3-dimensional optimization of space
CN110097315B (zh) * 2019-04-24 2021-06-25 阿里巴巴（中国）有限公司 容器确定方法、容器确定装置、介质和计算设备
CN111738935B (zh) * 2020-05-15 2021-07-02 完美世界(北京)软件科技发展有限公司 残影渲染方法和装置、存储介质和电子装置
CN113791914B (zh) * 2021-11-17 2022-03-11 腾讯科技（深圳）有限公司 对象处理方法、装置、计算机设备、存储介质及产品
CN113920184B (zh) * 2021-12-13 2022-03-11 腾讯科技（深圳）有限公司 多边形简化方法、装置、设备及计算机可读存储介质
CN114255160B (zh) * 2022-02-28 2022-06-14 腾讯科技（深圳）有限公司 数据处理方法、装置、设备及存储介质
CN114708358B (zh) * 2022-05-25 2022-09-02 腾讯科技（深圳）有限公司 对象处理方法、装置、设备及计算机可读存储介质

Also Published As

Publication number Publication date
CN114255160B (zh) 2022-06-14
CN114255160A (zh) 2022-03-29
WO2023160050A1 (zh) 2023-08-31

Similar Documents

Publication Publication Date Title
US20230298237A1 (en) Data processing method, apparatus, and device and storage medium
CN108038897B (zh) 阴影贴图生成方法及装置
US20230120253A1 (en) Method and apparatus for generating virtual character, electronic device and readable storage medium
US20230325244A1 (en) Object processing method and apparatus, computer device, storage medium, and program product
CN115147265B (zh) 虚拟形象生成方法、装置、电子设备和存储介质
CN110428504B (zh) 文本图像合成方法、装置、计算机设备和存储介质
US20240212236A1 (en) Polygon Processing Methods and Systems
US20240208679A1 (en) Optimized packing of polygons into a container
US20220374496A1 (en) Techniques for accelerating matrix multiplication computations using hierarchical representations of sparse matrices
CN112799598B (zh) 一种数据处理方法、处理器及电子设备
WO2023179091A1 (zh) 三维模型渲染方法、装置、设备、存储介质及程序产品
CN109410213A (zh) 基于包围盒的多边形图元裁剪方法、计算机可读存储介质、电子设备
US20220066819A1 (en) Methods and apparatuses for coalescing function calls for ray-tracing
US12112533B2 (en) Method and apparatus for data calculation in neural network model, and image processing method and apparatus
CN116012507A (zh) 一种渲染数据处理方法、装置、电子设备及存储介质
CN115228083A (zh) 一种资源渲染方法及装置
CN112734900B (zh) 阴影贴图的烘焙方法、装置、设备及计算机可读存储介质
US9135749B2 (en) Method and apparatus for processing three-dimensional model data
CN114797109A (zh) 对象编辑方法、装置、电子设备和存储介质
CN107784674B (zh) 一种三维模型简化的方法及系统
CN116781484B (zh) 数据处理方法、装置、计算机设备及存储介质
US11709812B2 (en) Techniques for generating and processing hierarchical representations of sparse matrices
US20240257464A1 (en) Polygon correction method and apparatus, polygon generation method and apparatus, electronic device, and computer-readable storage medium
US20220374961A1 (en) Techniques for performing matrix computations using hierarchical representations of sparse matrices
CN115953553B (zh) 虚拟形象生成方法、装置、电子设备以及存储介质

Legal Events

Date Code Title Description
STPP Information on status: patent application and granting procedure in general

Free format text: DOCKETED NEW CASE - READY FOR EXAMINATION