2D Vector Graphics Triangulation via Binary Tree
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The existing methods for converting 2D vector graphics into triangle meshes for rendering on electronic devices, such as handheld devices, are computationally expensive and inefficient, especially when graphics are zoomed or deformed, leading to increased power consumption and slowed drawing processes due to repeated triangulation processes.
Innovation Solution
A 2D vector graphics triangulation system that uses a binary tree data structure to store and dynamically adjust triangle meshes, reducing the need for repeated triangulation by inspecting error values and thresholds, and performing regional resolution adjustments when graphics are zoomed or deformed.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If the triangulation process is repeatedly performed when the geometric graphics is zoomed or deformed, then the graphics can be accurately rendered, but a great amount of computation resources are consumed, thereby slowing down a drawing process and causing excessive power consumption
Solution Approach 1:
The patent pre-calculates and stores triangulation data in a binary tree data structure before the graphics are zoomed or deformed. This preliminary triangulation avoids the need to repeatedly perform computationally expensive triangulation operations during subsequent zoom or deformation operations, thereby reducing power consumption while maintaining rendering accuracy.
Solution Approach 2:
The patent applies different levels of triangulation detail to different regions of the graphics based on their importance and visibility. By using a binary tree structure to organize triangulation data at multiple levels, the system can selectively update only the necessary local regions when graphics are transformed, rather than re-triangulating the entire graphics, thus reducing overall computational cost and power consumption.
2Measurement precision
If the triangulation process is repeatedly performed when the geometric graphics is zoomed or deformed, then the graphics can be accurately rendered, but the drawing process is slowed down
Solution Approach 1:
The patent performs triangulation in advance and stores the results in a binary tree data structure. When zoom or deformation operations occur, the pre-computed triangulation data is retrieved and adjusted rather than re-computing from scratch, significantly improving drawing process speed while maintaining rendering accuracy.
Solution Approach 2:
The patent uses a dynamic binary tree data structure that can be efficiently updated and adjusted during zoom or deformation operations. This dynamic structure allows the system to adaptively modify the triangulation data as needed without performing complete re-triangulation, thereby maintaining both accuracy and speed.
3Productivity
If a binary tree data structure is used to store triangulated data and dynamic regional adjustment is performed, then computing cost is reduced and processing efficiency is improved, but the system complexity increases
Solution Approach 1:
The patent segments the triangulation data into a hierarchical binary tree structure, where each node represents a specific region or level of detail. This segmentation allows for efficient storage and selective processing of different parts of the graphics, improving processing efficiency while managing complexity through structured organization.
Solution Approach 2:
The patent introduces a hierarchical dimension through the binary tree structure, organizing triangulation data across multiple levels. This additional dimensional organization enables efficient querying and adjustment of specific regions without affecting the entire dataset, thereby improving processing efficiency while keeping the system manageable through structured hierarchy.
Data Source
AI summary
A two dimensional (2D) vector graphics triangulation system and a method thereof are provided. The system includes a memory module and a triangle mesh processing module. The memory module temporarily stores a triangle mesh triangulated from a 2D vector graphics into a binary tree data structure. The triangle mesh processing module adjusts the triangle mesh, or re-performs a triangulation processing to a local region of the loop when a state of a loop of the 2D vector graphics is changed. The triangle mesh processing module includes a level of detail unit, which proportionally adjusts an error threshold according to a zoom condition of the loop, updates an error value of each boundary line when the loop is deformed, and splits a boundary line or merges two neighboring boundary lines according to the error values of the boundary lines and the error threshold.