Polygonal Data Editing via Vertex Movement Vectors
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Editing polygonal data in CAD systems is hindered by the need to manage multiple levels of resolution, which increases file size and computing resources, making finer edits cumbersome and resource-intensive.
Innovation Solution
A method that tracks vertex movements by generating and storing vectors associated with subdivision positions, allowing seamless transitions between different levels of resolution without losing edits, using a Catmull-Clark or Loop subdivision algorithm to smooth and update the data.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Manufacturing precision
If higher resolution polygonal data is used to enable finer edits, then editing precision is improved, but file size increases and processing speed decreases
Solution Approach 1:
The patent segments the polygonal data into multiple levels of resolution (coarse and fine). The system maintains a coarse-level polygonal data set for efficient overall manipulation and a fine-level data set for detailed editing. This segmentation allows the designer to work at different resolution levels depending on the editing task, avoiding the need to always use high-resolution data which would slow down processing.
Solution Approach 2:
The patent adds a temporal dimension to the polygonal data by maintaining historical versions at different resolution levels. Instead of simply increasing resolution, the system creates a multi-level hierarchical structure where coarse versions serve as the foundation and fine versions provide detailed modifications. This dimensional approach allows efficient navigation between resolution levels.
2Manufacturing precision
If higher resolution polygonal data is used to enable finer edits, then editing precision is improved, but computing resources increase
Solution Approach 1:
The computing resources are segmented and allocated differently for different resolution levels. The coarse-level data requires fewer computational resources for manipulation, while the fine-level data is only processed when detailed editing is needed. This segmentation of computational workload reduces the overall resource requirements compared to always processing high-resolution data.
Solution Approach 2:
The system applies partial action by only processing and rendering the necessary level of detail for the current editing task. When working on gross shape modifications, only coarse-level data is manipulated. Fine-level details are only processed when the designer specifically needs to make precise adjustments, avoiding unnecessary computational expenditure.
3Shape
If smoothing algorithms add vertices to create smooth objects, then surface quality is improved, but data set size increases
Solution Approach 1:
The patent segments the surface representation into two distinct data sets: coarse polygonal data that defines the overall shape with fewer vertices, and fine polygonal data that contains the smoothed, high-quality surface representation. This segmentation allows the system to maintain smooth surfaces only where needed while keeping the overall data set size manageable through the coarse-level approximation.
Data Source
AI summary
Methods and systems of editing an electronic geometric model are disclosed. The method includes receiving a first indication which indicates that a portion of the polygonal data is to be modified, and moving a first vertex of the plurality of vertices from a first subdivision position defined by a subdivision algorithm to a second position. The movement of the first vertex from the first subdivision position to the second position results in a modification of the polygonal data. The method also includes generating a first vector identifying the movement of the first vertex from the first subdivision position to the second position, which first vector is defined by an initial point at the first subdivision position of the first vertex and a terminal point at the second position of the of the first vertex, and associating the first vector with the subdivision position of the first vertex.