Scenic Route Generation via Weighted Graph Segmentation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for generating scenic routes in 2D space fail to ensure routes consist only of scenic paths, minimize edges and direction changes, reduce repeated edges, and optimize route length, while incorporating all scenic paths effectively.
Innovation Solution
A processor-implemented method that determines scenic points and paths based on weight-to-distance ratios, generates scenic graphs, and applies route-generating methods to create routes that prioritize scenic paths, minimal edges, and optimal route lengths, using techniques like convex hull construction and shortest path calculations.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If graph traversal algorithms (depth-first search/breadth-first search) are used to generate scenic routes, then all edges can be explored, but the user is forced to traverse the same edge multiple times
Solution Approach 1:
The patent segments the scenic graph into multiple layers or levels, where each layer represents a different traversal stage. By organizing edges and nodes into hierarchical segments, the system can systematically explore all scenic paths while avoiding redundant traversals through intelligent layer transitions.
Solution Approach 2:
The patent performs preliminary actions by pre-calculating and storing optimal path segments, traversal orders, and edge usage patterns before actual route generation. This preprocessing enables the system to quickly assemble complete routes without repeating edge explorations during runtime.
2Length of moving object
If Dijkstra's algorithm is used to find the shortest route, then route length is minimized, but edges from all scenic paths are not incorporated into the route
Solution Approach 1:
The patent merges the shortest path finding capability with comprehensive scenic path coverage by combining Dijkstra's algorithm with additional scenic path incorporation strategies. The system integrates multiple algorithmic approaches to simultaneously optimize for route length while ensuring all scenic edges are included through iterative refinement and graph expansion techniques.
Solution Approach 2:
The patent introduces an additional dimension to the routing problem by considering not just the spatial distance but also the dimensional aspect of path coverage. By transforming the problem into a multi-dimensional optimization where one dimension represents route length and another represents scenic path coverage, the system can balance both requirements through weighted scoring and multi-criteria decision making.
3Stability of the object's composition
If convex hull algorithm combined with all-pair-shortest path algorithm is used, then a closed route is provided, but the route may be too long and not all scenic paths are incorporated
Solution Approach 1:
The patent applies dynamic adjustments to the closed route generated by convex hull algorithms. Instead of using a static convex hull boundary, the system dynamically modifies the route by incorporating shortest path calculations and scenic path priorities, adjusting the closure property adaptively to minimize length while maintaining the closed route characteristic.
Solution Approach 2:
The patent changes key parameters of the route generation process by adjusting weights, distances, and inclusion criteria based on scenic path importance and route optimization goals. By dynamically modifying parameters such as edge weights and node priorities, the system can generate closed routes that are both reasonably short and comprehensive in scenic coverage.
4Reliability
If multiple route-generating conditions are enforced (scenic-only paths, completeness, minimal edges, minimal repeated edges, minimal route length), then route quality improves, but computational complexity increases
Solution Approach 1:
The patent segments the complex multi-constraint optimization problem into separate manageable modules, where each constraint (scenic-only paths, completeness, minimal edges, etc.) is handled by a dedicated algorithmic component. This modular segmentation allows each sub-problem to be solved independently and efficiently, reducing overall computational complexity.
Solution Approach 2:
The patent applies partial action by implementing constraints in a prioritized sequence rather than simultaneously enforcing all conditions. The system first ensures essential constraints (scenic paths, completeness), then progressively applies optimization constraints (minimal edges, minimal length) only where computationally feasible, achieving high route quality without excessive computational overhead.
Data Source
AI summary
A method for generating scenic routes through weighted two-dimensional (2D) points to visualize a movement of a user through the scenic routes with scenic views corresponding to a virtual environment is provided. The method includes (i) receiving input data from an input data source, (ii) determining one or more scenic points in the input data, (iii) generating one or more scenic paths for each scenic point of each pair of points based on a first condition, (iv) generating a scenic graph by aggregating intersection points and edges of each scenic path, and (v) generating the scenic routes by applying any one of one or more route-generating methods on the scenic graph based on a second condition to visualize the movement of the user through the scenic routes with the scenic views corresponding to the virtual environment.