Cursor Synchronization Across Linked Graphs via Axis Association
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing data visualization systems synchronize cursor positions across multiple graphs without considering data relationships, leading to inefficient and nonsensical visual representations.
Innovation Solution
A system and method for cursor synchronization in multiple graphs, where axes are associated based on user input or automatically through shared quantities, units, and labels, allowing cursors to move in sync only when corresponding data values are present, enabling users to manipulate a single cursor to view corresponding data points across linked graphs.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If cursor positions are synchronized across multiple graphs without considering data relationships, then cursor synchronization is achieved, but data accuracy and meaningfulness deteriorate
Solution Approach 1:
The patent applies local quality by making cursor synchronization behavior graph-specific rather than uniform across all graphs. Each graph evaluates whether its data points correspond to the source graph's data points using local data relationship checks. This allows cursor synchronization to occur only in graphs where it is meaningful (those with corresponding data relationships), while preventing nonsensical synchronization in graphs without such relationships, thus resolving the contradiction between ease of operation and data accuracy.
2Adaptability or versatility
If cursor synchronization is applied to all graphs regardless of data correspondence, then synchronization coverage is improved, but information reliability deteriorates
Solution Approach 1:
The patent implements dynamics by making the cursor synchronization system adaptive rather than static. The system dynamically evaluates data relationships between graphs in real-time and adjusts synchronization behavior accordingly. When corresponding data relationships exist, cursor synchronization is enabled; when they don't exist, synchronization is disabled. This dynamic approach maintains both high adaptability (synchronization works across multiple graph types) and high reliability (synchronization only occurs when meaningful).
Data Source
AI summary
Cursor synchronization in a plurality of graphs. A plurality of graphs may be displayed. Each graph may visually represent data and may include at least two axis. User input may be received specifying a value of a first axis of a first graph of the plurality of graphs. The method may determine if the first axis in the first graph corresponds to a first axis of a second graph in response to the user input. A visual indication may be indicated at a second value in the second graph in response to determining that the first axis in the first graph corresponds to the first axis of the second graph. The second value may correspond to the first value.