B-Rep Graph Retrieval for Fast Local Topological Matching
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing systems lack efficient methods for local topological similarity retrieval in B-rep models, which are crucial for accurate design and manufacturing processes in CAD systems, leading to inefficiencies in selecting and manipulating similar portions of mechanical parts.
Innovation Solution
A computer-implemented method for local topological similarity retrieval in B-rep models, utilizing a B-rep graph with associated topological signatures to identify and filter sub-graphs that are isomorphic and topologically similar to a query graph, enhancing ergonomics and responsiveness by reducing user interactions and improving CPU efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If traditional methods are used for topological similarity retrieval in B-rep models, then comprehensive search coverage is achieved, but computational efficiency and user interaction speed deteriorate
Solution Approach 1:
The patent segments the B-rep model into discrete elements (vertices, edges, faces) and represents them as a graph structure where each element is a node with topological signatures. This segmentation enables efficient local similarity retrieval by comparing specific graph substructures rather than processing the entire model, thus improving retrieval speed while maintaining accuracy
Solution Approach 2:
The patent pre-computes and stores topological signatures for each B-rep element during model creation. These signatures capture essential topological properties in advance, allowing rapid comparison and similarity assessment during user interactions without performing complex calculations in real-time, thereby reducing user waiting time
2Ease of operation
If manual selection of similar portions is performed, then design precision is maintained, but ease of operation deteriorates
Solution Approach 1:
The patent replaces manual visual inspection and selection with an automated computational system that uses graph theory and topological signature comparison. The system automatically identifies and selects topologically similar portions based on mathematical criteria, eliminating the need for manual dragging and selection while ensuring consistent, accurate results
Solution Approach 2:
The patent introduces topological signatures as an intermediary representation between the complex B-rep model and the similarity comparison process. These signatures serve as simplified descriptors that capture essential topological features, enabling accurate automated comparison without requiring users to directly analyze complex geometric models
Data Source
AI summary
A computer-implemented method for local topological similarity retrieval in a B-rep model. The B-rep model is represented by a given B-rep graph. Each node of the given B-rep graph represents a B-rep element and is associated with a topological signature of the element. The method includes obtaining a query B-rep graph. Each node of the query B-rep graph represents a B-rep element and is associated with a topological signature of the element. The method further comprises determining one or more sub-graphs of the given B-rep graph. Each determined sub-graph is isomorphic to the query B-rep graph. The determining of the one or more sub-graphs comprises searching for sub-graphs isomorphic to the query B-rep graph. The determining of the one or more sub-graphs further comprises filtering the sub-graphs isomorphic to the query B-rep graph. The filtering is based on topological signature proximity with the query B-rep graph.