Scalable Map Displays for Network Connectivity
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current graphical display methods for large networks are not scalable and fail to effectively track connectivity between nodes, leading to cluttered and difficult-to-navigate maps, especially when trying to understand complex relationships in large connected data sets.
Innovation Solution
A system that allows interactive exploration of large connected networks by selecting nodes from a tree structure, displaying multiple levels of connectivity, and applying filters to limit the number of nodes shown, enabling users to traverse paths and merge islands based on selected levels and filtering criteria.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of information
If all elements are displayed in a single map view, then connectivity is visible, but the map becomes cluttered and difficult to navigate for large networks
Solution Approach 1:
The patent segments the network map into multiple levels of detail. Users can select a root node and specify a depth level, displaying only nodes within that depth range. This segmentation allows the map to show connectivity information for selected nodes while excluding distant nodes that would clutter the view, thus maintaining both information completeness and navigability.
Solution Approach 2:
The patent introduces a hierarchical dimension to the traditional flat map view. By organizing nodes in levels based on their distance from the root node, the system transforms the two-dimensional map into a multi-level structure. This dimensional change allows users to explore connectivity at different granularities without displaying all nodes simultaneously, resolving the contradiction between information completeness and ease of navigation.
2Ease of operation
If tiering or condensing is applied at certain locations, then detail is provided where needed, but scalability is limited
Solution Approach 1:
The patent implements dynamic control over map display through user-selectable depth parameters. Instead of static tiering at fixed locations, the system allows users to dynamically adjust the depth level to control how many nodes are displayed. This dynamic approach enables the same map visualization to adapt to different network sizes and detail requirements, significantly improving scalability while maintaining detailed view capability where needed.
3Area of stationary object
If overview map with current view port is used, then overall structure is visible, but tracking connectivity between nodes becomes difficult
Solution Approach 1:
The patent segments the connectivity tracking task by focusing on specific depth levels from the root node. Instead of trying to display the entire overview map with all connectivity paths, the system segments the view to show only nodes and links within the specified depth range. This segmentation makes connectivity tracking manageable and visually clear, as users only see relevant connections within their selected depth parameter.
Data Source
AI summary
A desired node is selected from a tree structure or list and then a number of levels from that node are displayed in a map. For edge nodes, the number of undisplayed links from that node is displayed. When another node is selected on the map, the number of levels is recalculated based on that node or the existing nodes remain and the desired level is additionally displayed from the selected node. Multiple nodes can be selected from the list, which may result in separated islands which join when an common node is displayed in each island. Filters can be applied to limit the number of nodes. The filtering may either remove nodes from the display or provide an indication of the number of undisplayed nodes meeting the filter and any displayed nodes meeting the filter. The technique can be used on most linked networks.