3D CAD Cell Graph Topology Solver for Non-Manifold Models
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current CAD systems face challenges in efficiently modifying 3D models with non-manifold topology, leading to unexpected behavior and performance issues, especially when dealing with large models, and lack flexibility in creating multidimensional objects and kinematic or dynamic constraints.
Innovation Solution
A method that collects only locally adjacent cells through a cell graph, using predefined rules to restrict adjacency, feeds a numerical solver with appropriate inputs to update the shape based on topology, constraints, and equations, allowing for non-manifold geometry and 3D dimensioning and positioning constraints, thereby improving solving performance and reducing unexpected behaviors.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If all cells are collected for solving, then topological consistency is maintained, but solving performance deteriorates and response time increases
Solution Approach 1:
The patent segments the cell collection process by introducing a maximum depth parameter that limits the collection radius. Instead of collecting all cells in the model, the system collects only cells within a specified depth from the modified cell, creating manageable segments of the cell graph that can be processed efficiently while maintaining local topological consistency.
Solution Approach 2:
The patent applies local quality by collecting cells based on their distance from modified cells rather than uniformly across the entire model. The collection radius is defined by maximum depth, creating localized groups of cells that are relevant to the modification while excluding distant cells that do not affect the local topology, thus improving solving performance.
2Reliability
If all cells are collected for solving, then topological consistency is maintained, but response time increases
Solution Approach 1:
The patent segments the cell collection process by introducing a maximum depth parameter that limits the collection radius. Instead of collecting all cells in the model, the system collects only cells within a specified depth from the modified cell, creating manageable segments that reduce processing time while maintaining local topological consistency.
Solution Approach 2:
The patent applies partial action by collecting only the necessary subset of cells within the maximum depth radius rather than all cells in the model. This partial collection is sufficient to maintain topological consistency for the modification while significantly reducing the computational time required for solving.
3Reliability
If manifold modelers are used, then physically realizable objects are ensured, but multidimensional and non-manifold geometries cannot be created
Solution Approach 1:
The patent applies universality by creating a cell graph-based system that can handle both manifold and non-manifold geometries within a single unified framework. The cell graph structure is general enough to represent diverse geometries including multidimensional objects, while still providing the capability to ensure physical realizability when needed through appropriate constraint application.
Data Source
Figure 1A~2C
Figure 3A~3B
Figure 4
AI summary
The invention is directed to computer program and system, and a method of computer-aided design of a 3D object modeled by: - cells, the cells being restrictions of geometries of the model; and - a cell graph comprising relations between the cells, which relations capture a topology of the model, the method comprising the steps of: - editing (S100) an initial model (10, 12, 14) by interacting with a user to identify intended displacements of initial geometries (12) of the model; and selecting the cells which are restrictions of the geometries to be displaced; - collecting (S200) cells adjacent to the selected cells according to the cell graph, some of the adjacent cells being excluded by means of predefined rules; - computing (S300) by a solver transformations (46) to be applied to initial geometries (12), from the intended displacements (34) and geometries (32) whose collected cells are restrictions thereof; and - building (S400) new geometries (52) according to said transformations and initial geometries (12).