Adaptive Graph Placement for Higher Container Filling Rates
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for placing polygons in a container result in low container filling rates, as evidenced by the inefficiencies of NFP-based and lowest center-of-gravity approaches.
Innovation Solution
A data processing method that determines a reference graph based on graphic attributes and applies a targeted placement rule, including mixed or global scaling rules, to optimize the arrangement of multiple graphs within a container, enhancing the container filling rate.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If NFP-based or lowest center-of-gravity methods are used for placing polygons, then the placement process is simple and systematic, but the container filling rate is low
Solution Approach 1:
The patent applies local quality by determining different placement rules for different reference graphs based on their specific graphic attributes. Instead of using a uniform placement rule for all graphs, the system selects from multiple placement rules (first, second, third, fourth placement rules) depending on whether the reference graph's attributes meet specific thresholds, thereby optimizing the container filling rate for each graph's characteristics
Solution Approach 2:
The patent utilizes parameter changes by comparing the reference graph's graphic attributes against attribute thresholds to dynamically select appropriate placement rules. The system changes the placement strategy based on parameter relationships (e.g., when the reference graph's attribute is greater than the threshold versus when it is less than or equal to the threshold), enabling adaptive optimization of graph placement
2Productivity
If multiple candidate angles and positions are determined for each polygon, then the placement options increase, but the calculation time and complexity increase
Solution Approach 1:
The patent applies preliminary action by pre-establishing multiple placement rules before the actual graph placement process. The system prepares the first, second, third, and fourth placement rules in advance, each designed for specific graph attribute conditions. This allows the system to quickly match and apply the appropriate rule without performing complex real-time calculations during placement
Solution Approach 2:
The patent segments the placement problem by dividing it into distinct cases based on reference graph attributes. Instead of treating all graphs uniformly, the system segments the placement strategy into multiple rule categories (first placement rule, second placement rule, etc.), each handling specific attribute ranges, thereby simplifying the decision-making process and reducing calculation time
Data Source
AI summary
A data processing method performed by a computer device is disclosed. The method includes: obtaining N graphs, N being an integer greater than 2; determining a reference graph from the N graphs based on a graphic attribute of each graph; determining a placement rule corresponding to the N graphs according to a relationship between a graphic attribute of the reference graph and an attribute threshold; and placing the N graphs in a container according to the placement rule corresponding to the N graphs.