Geometric Search of Configurable BOM Trees
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional CAD systems face challenges in creating a space- and time-efficient index for geometric part, assembly, and override data that allows for efficient geometric queries on BOM trees, particularly in constructing and maintaining large BOM trees, and locating BOM lines that satisfy geometric tests without requiring the full BOM tree construction.
Innovation Solution
The method involves using a geometric index to form a wavefront queue of proto lines, determining cumulative geometric bounds, performing geometric bound tests, and producing BOM lines that pass these tests to be added to a candidate results list, allowing for efficient geometric searches within BOM trees without constructing the full tree.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If the full BOM tree is constructed to perform geometric searches, then complete accuracy is achieved, but time consumption and resource usage increase significantly
Solution Approach 1:
The patent segments the BOM tree into multiple partitions or zones based on geometric bounds. Instead of constructing and searching the entire BOM tree, the system divides it into manageable segments that can be independently evaluated. This segmentation allows the search to focus only on relevant portions of the tree that may contain matching results, significantly reducing search time while maintaining accuracy.
Solution Approach 2:
The patent applies partial action by performing geometric bound tests on proto lines without fully constructing all BOM lines. The system evaluates cumulative geometric bounds at intermediate stages and prunes branches that cannot possibly contain matching results. This partial construction approach achieves complete geometric search accuracy while avoiding the time cost of building the entire BOM tree.
2Reliability
If the full BOM tree is constructed to ensure complete geometric search coverage, then all potential matches are found, but memory and computational resources are consumed excessively
Solution Approach 1:
The BOM tree is segmented into partitions based on geometric bounds, allowing the system to process and store only relevant segments in memory. Each partition can be independently evaluated and discarded after processing, reducing peak memory requirements while ensuring complete search coverage through systematic traversal of all necessary partitions.
Solution Approach 2:
The patent performs preliminary geometric bound calculations and cumulative bound determinations before full BOM line construction. By evaluating geometric bounds at the proto line level and pruning infeasible branches early, the system reduces the quantity of BOM data that needs to be constructed and stored in memory, while maintaining search completeness through thorough evaluation of all viable candidates.
3Measurement precision
If geometric bound tests are performed on all proto lines to ensure accurate results, then precision is maintained, but processing speed decreases
Solution Approach 1:
The patent applies partial action by performing geometric bound tests selectively on proto lines based on preliminary cumulative bound evaluations. Instead of testing all proto lines uniformly, the system prunes branches that fail cumulative bound checks before detailed geometric testing, reducing the number of full geometric tests required while maintaining accuracy for all candidates that reach the testing stage.
Solution Approach 2:
The geometric search process is segmented into multiple stages: cumulative geometric bound determination, preliminary filtering, and detailed geometric bound testing. This segmentation allows the system to quickly eliminate large numbers of irrelevant proto lines through fast cumulative bound checks, reserving computationally intensive detailed geometric tests only for promising candidates, thereby improving overall throughput while maintaining precision.
4Speed
If the system maintains a live geometric index for dynamic BOM trees, then query efficiency is improved, but index maintenance complexity increases
Solution Approach 1:
The geometric index is segmented and organized by BOM tree partitions rather than requiring a single comprehensive index. This segmented indexing approach reduces maintenance complexity by allowing incremental updates to individual partitions without reindexing the entire BOM tree, while still enabling fast queries through efficient partition location and traversal.
Data Source
AI summary
A method for searching a bill of materials (BOM) in a data processing system, a data processing system configured to perform a corresponding method, and a computer program product encoded with instructions for performing the method. The method includes retrieving BOM data in a data processing system, and forming a wavefront queue of a plurality of proto lines corresponding to the BOM data. The method also includes determining the cumulative geometric bounds of multiple ones of the plurality of proto lines and performing a geometric bounds test on the cumulative geometric bounds of multiple ones of the plurality of proto lines. The method also includes producing a BOM line to each proto line that passes the geometric bounds test, and adding the produced BOM lines to a candidate results list stored in the data processing system.