Hierarchical Data Structure for Uninterrupted Map Zooming
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for displaying and storing data, such as navigation maps, experience interruptions when zooming due to the need to load new map material, exceeding the computing capacity of conventional devices, especially on mobile terminals.
Innovation Solution
Data is structured and stored in hierarchical structures, with anchor points and interpolation points assigned to levels based on distance from a line through anchor points, allowing for efficient selection and display without time-consuming recalculation, enabling uninterrupted display across various scales.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If the Ramer-Douglas-Peucker algorithm is used to reduce high-resolution data when zooming out, then the data can be displayed correspondingly even when the stored number of points exceeds the available display points, but the computing capacity of conventional terminal devices is exceeded, causing time lag
Solution Approach 1:
The patent applies preliminary action by pre-organizing data into hierarchical structures with multiple levels of detail before display is needed. Data is preprocessed and stored in a pyramid structure where upper levels contain simplified representations and lower levels contain detailed data. When zooming occurs, the system can immediately switch between pre-prepared hierarchical levels without performing real-time complex calculations, thus avoiding time lag while maintaining display precision.
Solution Approach 2:
The patent segments the data into multiple hierarchical levels, dividing the complete dataset into upper levels (coarser detail) and lower levels (finer detail). This segmentation allows the system to select appropriate data levels based on zoom status, processing only the necessary subset rather than the entire dataset, thereby reducing computational load while preserving required display precision.
2Adaptability or versatility
If new map material is loaded when changing display scale exceeds certain thresholds, then the display can accommodate different zoom levels, but the user temporarily will not have any map displayed, causing interruption
Solution Approach 1:
The patent implements the nested doll principle by creating a data pyramid structure where each hierarchical level is nested within the previous one. Upper levels contain simplified data that is nested within more detailed lower levels. This nested structure allows the system to display appropriate data at any zoom level without loading external materials, as all required data levels are already contained within the hierarchical structure, ensuring continuous display while adapting to different scales.
Solution Approach 2:
The system performs preliminary action by pre-loading and organizing all hierarchical data levels into the pyramid structure before display needs occur. This eliminates the need for temporary loading interruptions during zoom operations, as the data is already prepared and available in the appropriate hierarchical levels for any anticipated display scale.
3Adaptability or versatility
If four to sixteen stages of change thresholds are provided for different display scales, then the system can load corresponding data for each stage, but the device complexity increases with multiple loading stages
Solution Approach 1:
The patent applies another dimension by adding a hierarchical level dimension to the data structure. Instead of managing multiple separate threshold stages with independent loading logic, the system organizes data along a hierarchical dimension (upper levels to lower levels) that naturally corresponds to zoom levels. This dimensional reorganization simplifies the complexity by providing a unified hierarchical framework that inherently handles all scale adaptations without requiring separate stage management.
Data Source
AI summary
A procedure for structuring and storing data representing the form of an object that can be represented by a set of interpolation points, wherein the data representing an object is stored in a hierarchy having at least two levels, wherein a subset of the data representing the object is saved at each level and wherein the data is assigned to the levels by selecting at least two anchor points, whose data is saved in the uppermost hierarchical level, from the set of interpolation points and by consecutively selecting, from the interpolation points remaining in the set, the interpolation point with the largest distance from a line through the interpolation points and anchor points that have already been assigned to levels.