Automatic Polygonal Retopologization Using User-Specified Length Constraints
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Manual retopologization of polygonal data is cumbersome and slow, as it requires users to individually place vertices and generate faces, which is inefficient for converting less desirable polygonal data into a more preferred state with predominantly quadrilateral faces.
Innovation Solution
A method where a computer system automatically retopologizes regions of polygonal data by adding vertices and generating edges and faces based on user indications, using algorithms like Catmull-Clark or Loop subdivision to smooth and modify the data, allowing for automatic generation of retopologized models with consistent edge lengths and shapes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of manufacture
If manual retopologization is performed by individually placing vertices and generating faces, then the polygonal data can be converted to a preferred state with predominantly quadrilateral faces, but the process becomes cumbersome and slow
Solution Approach 1:
The system performs automatic retopologization where the computer system itself carries out the vertex placement and face generation operations without requiring manual intervention for each geometry element. The system uses algorithms to automatically determine optimal vertex positions and generate quadrilateral faces, making the process self-service rather than manually-driven.
Solution Approach 2:
The patent replaces the manual mechanical process of individually placing vertices and generating faces with an automated computational system. The computer system uses algorithms and data structures to automatically perform retopologization operations, substituting human manual operations with automated computational mechanics.
2Productivity
If automatic retopologization is implemented, then the process speed is significantly increased, but the system complexity increases due to requiring automated algorithms
Solution Approach 1:
The patent introduces intermediate data structures and algorithms as mediators between the input polygonal data and the output retopologized model. These intermediaries include vertex position calculations, face generation algorithms, and edge management structures that facilitate the automatic retopologization process while managing system complexity.
Solution Approach 2:
The retopologization process is divided into discrete algorithmic steps and computational stages. The system segments the complex retopologization task into manageable components such as vertex placement, edge generation, and face creation, allowing each segment to be processed independently and efficiently.
3Measurement precision
If vertices are individually placed manually, then precise control over vertex locations is achieved, but the time required for retopologization increases significantly
Solution Approach 1:
The system performs preliminary calculations and pre-determines optimal vertex positions using algorithms before actual retopologization occurs. The computer system calculates anticipated vertex locations and uses these pre-computed positions to guide the automatic vertex placement, ensuring precision without manual intervention.
Solution Approach 2:
The patent changes the approach from manual parameter specification to algorithmic parameter determination. Instead of manually specifying each vertex position, the system uses computational algorithms to automatically determine optimal vertex parameters based on the input geometry and desired output characteristics.
Data Source
AI summary
Systems and methods of updating graphical objects are disclosed. The methods and systems receive polygonal data which described points on an object. A user indicates a length, and retopologized data for a region is automatically generated based on the length such that the retopologized data has fewer geometries than the received polygonal data in the region.