Planar Map Raster Image Tracing Algorithm
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current techniques for tracing raster images using computer tools often result in inefficiencies such as 'gapping' and 'beading' due to manual handling of polygons and boundary identification challenges, leading to time-consuming and costly corrections for graphic artists.
Innovation Solution
A method and system that generate a planar map by reducing the number of colors in a raster image, identifying regions, edges, and vertices, and applying these to create a traced image, using algorithms to merge regions and remove artifacts, thereby reducing visual distortions and manual corrections.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If manual tracing using Bézier curve tool is used, then the drawing professional can trace the raster image, but the process is inefficient and results in gapping and spacing between polygons
Solution Approach 1:
The system performs automatic tracing without requiring manual intervention for each polygon. The algorithm independently identifies polygons, generates Bézier curves, and applies them to trace the raster image, eliminating the need for manual tracing operations while maintaining quality results
Solution Approach 2:
The manual mechanical process of moving control handles and adjusting curves is replaced with an automated algorithmic system that computationally generates and optimizes Bézier curves based on polygon detection, significantly improving tracing efficiency
2Productivity
If auto-tracing algorithm is used, then automatic curve application around polygons is achieved, but gapping between adjacent polygons and beading artifacts still remain
Solution Approach 1:
The system incorporates post-processing feedback mechanisms that analyze the traced output for gapping and beading artifacts, then apply corrective algorithms to close gaps between polygons and remove beading, continuously improving the precision of the tracing result
Solution Approach 2:
The system performs preliminary polygon identification and boundary detection before applying curves, and includes preliminary post-processing steps to prevent gapping and beading from occurring in the first place, rather than correcting them after tracing is complete
3Extent of automation
If diagonal regions are treated as separate polygons in auto-tracing, then automatic processing is achieved, but visual distortion and beading arise in the resultant data file
Solution Approach 1:
The system merges diagonally oriented regions that should be visually connected into single continuous polygons rather than treating them as separate entities. This merging process eliminates beading artifacts and maintains visual accuracy by preserving the intended continuous nature of diagonal patterns
4Manufacturing precision
If manual gap closing and beading correction is performed, then tracing accuracy is improved, but time and labor costs increase significantly
Solution Approach 1:
The system automatically detects and corrects gapping and beading issues without requiring manual intervention. The post-processing algorithms self-correct the traced output by identifying gaps between polygons and removing beading artifacts, maintaining high tracing quality while eliminating time-consuming manual correction work
Data Source
AI summary
A planar map to process a raster image is disclosed. In one embodiment, a method of tracing a raster image includes generating a planar map having at least one region, at least one edge, and at least one vertex, identifying topology of the at least one region, and applying the planar map to the raster image to create a traced image. The method may include reducing the number of colors of the raster image by at least 10% prior to the generating the planar map having at least one region. In addition, the method may include formulating a geometry to associate with the at least one region. The at least one region may include a contiguous set of same color pixels. The at least one edge may define a boundary between different regions of the planar map. At least one vertex may indicate connection points of multiple edges.