Helical Graph Data Visualization for Big Data Analysis

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current data processing technologies are inadequate for handling large and complex 'big data' sets, making it difficult to analyze, visualize, and extract valuable information due to their two-dimensional limitations.

Innovation Solution

A system and method that converts Cartesian data sets into helical data sets, allowing for three-dimensional visualization and analysis through a helical graph, which represents data in a spiral structure, enabling better correlation and pattern recognition within 'big data' sets.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Adaptability or versatility

If traditional two-dimensional data processing methods are used, then data processing is simple and straightforward, but the ability to analyze and visualize big data is inadequate and limited

Engineering Contradiction:
Improveability to analyze and visualize big dataVSAvoiddata processing complexity
Core Design Contradiction:
Adaptability or versatilityVSDevice complexity

Solution Approach 1:

The patent transforms two-dimensional Cartesian data into three-dimensional helical representations, adding a spatial dimension to data visualization. This dimensional transition enables better pattern recognition and correlation identification in big data, directly addressing the limitation of traditional 2D processing methods while maintaining computational feasibility through systematic conversion algorithms.

Inventive Principle:
Principle #17Another dimension (Dimensionality change)

2Measurement precision

If Cartesian data sets are converted to helical data sets, then pattern recognition and correlation identification improve, but the conversion process adds computational complexity

Engineering Contradiction:
Improvepattern recognition accuracyVSAvoiddata conversion complexity
Core Design Contradiction:
Measurement precisionVSDevice complexity

Solution Approach 1:

The patent systematically transforms Cartesian coordinates (x, y, z) into helical parameters through mathematical conversion, changing the parameter representation to enhance pattern recognition. This parameter transformation preserves data integrity while enabling superior visualization and analysis capabilities.

Inventive Principle:
Principle #35Parameter changes

3Productivity

If three-dimensional helical visualization is implemented, then data correlation and pattern recognition improve, but the visualization complexity and processing requirements increase

Engineering Contradiction:
Improvedata analysis efficiencyVSAvoidvisualization processing requirements
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

By converting data to three-dimensional helical structures, the patent enables more efficient pattern recognition and correlation identification compared to traditional 2D visualizations. The helical representation allows observers to perceive temporal and spatial relationships more effectively, improving data analysis productivity despite increased visualization complexity.

Inventive Principle:
Principle #17Another dimension (Dimensionality change)

Data Source

PatentUS10332288B1Helical graph
Publication Date: 2019.06.25 NORTHROP GRUMMAN SYSTEMS CORP
  • US10332288B1 patent drawing
  • US10332288B1 patent drawing
  • US10332288B1 patent drawing

AI summary

A helical engine can convert a Cartesian data set that characterizes a Cartesian graph into a helical data set that characterizes a helical graph. The helical graph can include a helical shaped axis defining a given variable and deviations from the helical shaped axis that represent another variable.