Graphic Processing Device Corner Violation Detection

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing graphic processing methods for detecting filling-in width violations and acceptable angle violations in plane patterns are inefficient, particularly when dealing with complex patterns, as they require processing times proportional to the square of the number of corners, leading to significant computational burdens.

Innovation Solution

A graphic processing device and method that shifts sides of a graphic inward by a certain length, traces intersections, and uses circular arcs to link end points, performing logical operations to correct and detect violations, thereby reducing processing time to be proportional to the logarithm of the number of corners.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Measurement precision

If the shortest distance between sides of polygon shapes is calculated to detect filling-in width violations, then detection accuracy is improved, but processing time increases proportionally to the square of the number of corners

Engineering Contradiction:
Improvefilling-in width violation detection accuracyVSAvoidprocessing time
Core Design Contradiction:
Measurement precisionVSLoss of time

Solution Approach 1:

The patent segments the complex problem of calculating all pairwise distances between sides into more manageable computational steps using binary space partitioning. The graphic is divided and processed in organized stages, reducing the computational burden from O(n²) to O(n log n) by systematically breaking down the distance calculation task into hierarchical levels of processing.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent replaces the brute-force mechanical approach of calculating all pairwise distances with a more efficient computational system based on binary space partitioning and spatial indexing. This substitution transforms the problem from direct computational geometry into a structured data organization and query system, dramatically improving processing efficiency.

Inventive Principle:
Principle #28Mechanics substitution (Replace mechanical system)

2Productivity

If both filling-in width violation detection and corner rounding operations are performed simultaneously, then productivity is improved, but device complexity increases

Engineering Contradiction:
Improveprocessing throughputVSAvoidprocessing system complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The patent merges the filling-in width violation detection process with the corner rounding operation into a single integrated processing pipeline. Both operations share common computational infrastructure including the binary space partitioning structure and distance calculation mechanisms, allowing simultaneous execution without proportionally increasing system complexity.

Inventive Principle:
Principle #5Merging (Combining)

Solution Approach 2:

The processing system is designed with universal components that serve multiple functions. The binary space partitioning structure and distance calculation mechanisms are reused by both the violation detection module and the corner rounding module, reducing overall system complexity while enabling simultaneous operation of both functions.

Inventive Principle:
Principle #6Universality (Multi-functionality)

Data Source

PatentUS8847971B2Graphic processing device, graphic processing method, and non-transitory medium for storing graphic processing program for generating corrected graphic data
Publication Date: 2014.09.30 FUJITSU LTD
  • US8847971B2 patent drawing
  • US8847971B2 patent drawing
  • US8847971B2 patent drawing

AI summary

A device includes a processor which executes a process including generating data of a second graphic identified by shifting each of first sides of a first graphic by a length in a direction toward an inside of the first graphic and by tracing, in a direction, the first sides after the shifting and intersection points between the first sides after the shifting, generating data of a third graphic by shifting each of second sides of the second graphic to both sides of each of the second side by the length and by linking end points of the second sides after the shifting using a circular arc which is centered on an end point of the second side before the shifting and which has a radius of the length, and generating data of a fourth graphic by performing a logical addition operation between the second graphic and the third graphic.