Area Finding Apparatus for Non-Intersecting Region Selection
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional techniques are inefficient in finding top k areas with no intersection between them, leading to low processing efficiency and impractical computation times for large datasets.
Innovation Solution
An area finding apparatus that extracts and selects non-intersecting rectangular areas by iteratively excluding overlapping areas with lower scores, reducing the need for repeated intersection determinations and optimizing the selection process.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional techniques are used to find top k areas with no intersection, then the completeness of area selection is improved, but the processing time increases significantly
Solution Approach 1:
The patent performs preliminary actions by pre-calculating and storing evaluation values for all possible rectangular areas before the main selection process. This allows the system to quickly determine scores without repeatedly computing them, significantly reducing processing time while maintaining complete and accurate area selection.
Solution Approach 2:
The patent segments the search space by dividing the two-dimensional area into multiple rectangular regions defined by grid lines. This segmentation allows systematic exploration of all possible areas while using efficient data structures to manage and compare them, achieving both completeness and speed.
2Measurement precision
If repeated intersection determinations are performed, then the accuracy of non-intersecting area selection is improved, but the computational efficiency deteriorates
Solution Approach 1:
The patent pre-computes and stores evaluation values for all rectangular areas before the selection process. This preliminary action eliminates the need for repeated computational determinations during selection, as the system can directly compare pre-stored values to identify non-intersecting areas with high accuracy and efficiency.
Solution Approach 2:
The patent creates a simplified representation (copy) of the area evaluation data in the form of pre-computed score tables. This copy allows rapid comparison and selection without performing complex intersection calculations repeatedly, maintaining accuracy while dramatically improving computational efficiency.
Data Source
AI summary
An apparatus extracts an area having a highest score or a lowest score that is calculated based on evaluation values of points from a target area including a set of a plurality of points that can be distributed at two-dimensional coordinates. It determines whether the area extracted and an area overlapping a plurality of the target areas intersect with each other, and deletes an area having a lower score or a higher score out of the areas determined to intersect with each other. It selects an area having a highest score or a lowest score out of the areas extracted at the extracting and not deleted at the determining. One or a plurality of areas are generated as the target areas based on an area acquired by excluding the area selected from the target area and an area acquired by excluding the area deleted at the determining.