Node Request Prioritization by Tile Distance
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Geographic Information Systems (GIS) face challenges in quickly and smoothly rendering three-dimensional environments due to limitations in data packet prioritization, leading to user-perceived delays in scene resolution.
Innovation Solution
The method involves prioritizing data packets based on tile distance and level of detail within a node tree, ordering cache node requests to favor visually relevant data, allowing for interleaving of tiles across different levels of detail for efficient streaming.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If all cache nodes are loaded to fully resolve a view, then complete scene data is available, but scene resolution time increases and user perception of speed deteriorates
Solution Approach 1:
The patent extracts only the visually important cache nodes needed for the current view rather than loading all cache nodes. It identifies and retrieves only those cache nodes that contribute to the visible portion of the scene, excluding unnecessary data that would increase resolution time without improving visual quality.
Solution Approach 2:
The patent applies different loading strategies to different regions of the scene based on their visual importance. Cache nodes within the view frustum and contributing to visible geometry are loaded with high priority, while cache nodes for invisible or less important regions are deferred or excluded, creating localized quality differences in data loading.
2Device complexity
If cache nodes are prioritized by geographic distance only, then simple ordering is maintained, but tiles across different levels of detail are not efficiently interleaved
Solution Approach 1:
The patent segments the prioritization process into multiple independent factors: view frustum containment, tile distance, and level of detail. Each factor is calculated separately and then combined to produce a composite priority score, allowing complex prioritization to be built from simpler, modular components that can be efficiently computed.
Solution Approach 2:
The patent adds level of detail as an additional dimension to the prioritization criteria beyond just geographic distance. This creates a multi-dimensional prioritization space where cache nodes are ranked based on both their spatial position and their detail level, enabling efficient interleaving of tiles across different resolutions to optimize rendering performance.
Data Source
AI summary
An exemplary method for reducing user-perceived scene resolution time to render a node tree in a three-dimensional environment includes identifying a first cache node in the node tree at a first level of detail. The exemplary method also includes computing a first priority score based at least on a depth in the node tree of the first level of detail and a first tile distance. The exemplary method further includes identifying a second cache node in the node tree at a second level of detail different from the first level of detail. The exemplary method also include computing a second priority score based at least on a depth in the node tree of the second level of detail and a second tile distance. The exemplary method further includes ordering cache node requests based at least on the relative values of the first and second priority scores.