Route-Based Entity Search Using Segmented Proximity Queries
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing map search tools require users to manually search for entities near a starting and ending point, then perform calculations to find the most convenient option, which is time-consuming and inefficient as the distance between points increases.
Innovation Solution
The system allows users to search for entities along a defined route by repeating the search at various points along the route, calculating proximity based on distances from previous and next route points, and sorting results for efficient presentation.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Area of stationary object
If the search radius is expanded to incorporate the whole route, then the coverage area increases, but the number of hits to process increases quadratically (πr²)
Solution Approach 1:
The patent divides the route into multiple discrete search points rather than performing a single large-radius search. The system automatically selects search points along the route and performs separate searches at each point, processing only the hits relevant to each localized area. This segmentation reduces the total number of hits from quadratic growth to linear growth with respect to search radius.
2Measurement precision
If manual searching and calculation is performed at multiple points, then the accuracy of route proximity increases, but the time and effort required increases linearly to quadratically
Solution Approach 1:
The system performs automatic searching and calculation at multiple route points without requiring user intervention. The computer automatically selects search points, executes searches, calculates proximities, and sorts results, eliminating the manual effort that would otherwise increase quadratically with route distance while maintaining high precision in determining the most convenient entity.
3Measurement precision
If the number of search points along the route increases, then the precision of finding the nearest entity improves, but the computational complexity increases
Solution Approach 1:
The patent applies different search strategies to different segments of the route. Each search point has its own localized search radius and hit set, allowing the system to maintain high precision locally while managing computational complexity globally. The system processes only the necessary hits at each point rather than all possible hits across the entire route.
Data Source
AI summary
An embodiment of this invention allows the user to search for entities nearest to a defined route. To search around a specific route, instead of expanding the search radii (r) to incorporate the whole route (the number of hits to cull increases as πr2), the search is repeated automatically at various points along the route. Various features are also added in different embodiments, for searching and user-interface.