Route Polygon Segmentation for Real-Time Position Checking
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for determining if an object is within a specific area require complex calculations and robust processing units, leading to high costs, inefficiencies, and potential 'false positive' results, particularly in navigation and agricultural applications where real-time trajectory checking is crucial.
Innovation Solution
A navigation method that segments the route into polygonal forms and uses diagonal lines to create triangles, calculating and comparing their areas to determine the object's position relative to the polygonal form, allowing for quick and accurate decision-making without the need for large processing units.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If complex algorithms and robust processing units are used to determine object position within polygonal areas, then measurement precision is improved, but device complexity and cost increase
Solution Approach 1:
The patent segments the problem of determining whether a point lies within a polygon by dividing the polygon into triangular segments. By connecting the test point to the vertices of the polygon, the method creates multiple triangles whose areas can be easily calculated and compared to the total polygon area, avoiding the need for complex robust processing algorithms.
Solution Approach 2:
The patent replaces expensive, robust processing units with simple area calculation algorithms that can be executed on basic processors. The method uses straightforward mathematical operations (area calculations) instead of complex computational geometry algorithms, significantly reducing hardware requirements and cost while maintaining accuracy.
2Reliability
If complex algorithms are used to eliminate false positives in position checking, then reliability is improved, but processing time and computational resources increase
Solution Approach 1:
The patent eliminates false positives by segmenting the polygon into triangles and using area comparison logic. This approach inherently avoids the vertex intersection ambiguity problem that causes false positives in traditional methods, providing reliable results without requiring additional complex correction filters or extended processing time.
Solution Approach 2:
Instead of trying to prove the point is inside the polygon by checking vertex intersections (which leads to false positives), the patent inverts the approach by calculating areas and comparing them. The point is determined to be inside if the sum of triangle areas equals the polygon area, providing a more reliable and computationally efficient solution.
3Measurement precision
If robust processing units are used for real-time trajectory checking, then measurement precision is improved, but cost and device dimension increase
Solution Approach 1:
The patent replaces expensive, robust processing units with simple area calculation algorithms that can be executed on basic microcontrollers or even embedded systems. The method uses elementary mathematical operations that require minimal computational power, significantly reducing hardware cost, size, and power consumption while maintaining real-time checking capability.
Solution Approach 2:
The patent extracts only the essential computational requirement (area calculation) from the complex problem of trajectory checking, eliminating the need for robust processing units. By focusing on the core mathematical operation needed for position determination, the solution achieves high precision with minimal hardware resources.
Data Source
Figure 1~2
Figure 3~4
AI summary
This invention refers to a navigation method applicable to general transport means - air, maritime or land transport -, particularly whenever constant checking on the route or path is required for taking a certain action. This invention also describes a system that uses said method.