Bar Chart Rendering Optimization via Pixel-Level Bar Selection

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Rendering large bar charts with thousands of data points is inefficient due to the need to render all bars, including those that are completely obscured by other bars, leading to increased computation time and slower rendering speeds.

Innovation Solution

Implementing a data filtering technique that identifies and omits the rendering of bars that are completely obscured, focusing on rendering only the highest positive and lowest negative bars associated with each pixel, thereby reducing the number of bars rendered and improving computation efficiency.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If all bars are rendered in the bar chart, then complete data visualization is achieved, but rendering time increases significantly for large datasets

Engineering Contradiction:
Improvedata visualization completenessVSAvoidrendering time
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The patent extracts and identifies only the visible bars that contribute to the final visualization, omitting the rendering of obscured bars. This is achieved by determining for each pixel the highest positive bar and lowest negative bar, and rendering only these selected bars, thereby extracting the essential visible information while discarding redundant obscured data.

Inventive Principle:
Principle #2Taking out (Extraction)

Solution Approach 2:

Instead of rendering all bars (excessive action), the patent applies partial action by rendering only the necessary subset of bars that are actually visible to the user. This partial rendering approach maintains visual completeness while significantly reducing the computational workload and rendering time.

Inventive Principle:
Principle #16Partial or excessive action

2Productivity

If the number of rendered bars is reduced, then rendering speed improves, but visual integrity may be compromised

Engineering Contradiction:
Improverendering speedVSAvoidvisual integrity
Core Design Contradiction:
ProductivityVSReliability

Solution Approach 1:

The patent applies local quality by determining the highest positive bar and lowest negative bar for each pixel position. This ensures that at every location in the visualization, the rendered bars locally represent the complete visible information, maintaining visual integrity while reducing the total number of bars rendered across the entire chart.

Inventive Principle:
Principle #3Local quality

Solution Approach 2:

The patent performs partial rendering by selecting and rendering only the necessary bars that contribute to visual integrity. By rendering only the highest positive and lowest negative bars at each pixel, it achieves the minimum necessary action to maintain visual completeness while improving rendering speed.

Inventive Principle:
Principle #16Partial or excessive action

Data Source

PatentUS10930036B2Bar chart optimization
Publication Date: 2021.02.23 ORACLE INT CORP
  • US10930036B2 patent drawing
  • US10930036B2 patent drawing
  • US10930036B2 patent drawing

AI summary

Implementations generally relate to optimizing bar charts. In some implementations, a method includes receiving a plurality of data points, where each data point of the plurality of data points has a value. The method further includes determining a plurality of bars of the bar chart based on the plurality of data points, where each bar of the plurality of bars has a length and a width. The method further includes associating at least portions of a plurality of pixels used to render the bar chart with the plurality of bars. The method further includes determining for each pixel or pixel portion, at least one or more of a highest positive bar and/or a lowest negative bar. The method further includes rendering for individual pixels or pixel portions, one or more of the respective highest positive bar and/or the respective lowest negative bar.