Spatial Index Structure for Geometric Dependency Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing product data management systems in CAD and visualization applications face challenges in efficiently performing geometric queries on assemblies and components due to the lack of effective indexing structures for unconfigured product structures.
Innovation Solution
A method is introduced to create a spatial index structure using a geometric dependency network, where local geometric bounds are set for each node, propagated along edges, and simplified at each node, forming a spatial index geometric bound for data model objects, supporting time-efficient geometric queries.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If a geometric index is maintained for assemblies and components, then geometric queries can be performed efficiently, but the system complexity and storage requirements increase for unconfigured product structures
Solution Approach 1:
The patent segments the product structure into a geometric dependency network where individual components and assemblies are represented as separate nodes. Each node maintains its own geometric bound independently, allowing the index to be divided into manageable units that can be processed and queried efficiently without requiring the entire structure to be treated as one complex entity.
Solution Approach 2:
The patent introduces a network dimension to the traditional geometric indexing by representing product structures as graphs with nodes and edges. This transforms the indexing problem from a hierarchical tree structure to a network structure, enabling more flexible propagation of geometric bounds and better handling of unconfigured products where dependencies may not follow a strict hierarchy.
2Measurement precision
If geometric bounds are propagated along all network edges, then accurate spatial indexing is achieved, but computational complexity and processing time increase
Solution Approach 1:
The patent performs preliminary simplification of geometric bounds at each node before propagation. By pre-processing and simplifying the bounds locally at each node, the system reduces the complexity of the data that needs to be propagated through the network, thereby decreasing the overall computational time while maintaining the accuracy needed for correct spatial indexing.
Solution Approach 2:
The patent applies local simplification rules at each network node based on the specific characteristics of that node and its local geometry. Rather than applying a uniform simplification approach throughout the entire product structure, the system adapts the simplification process to local conditions, maintaining precision where needed while reducing complexity where possible, thus optimizing the balance between accuracy and processing time.
Data Source
AI summary
A system, method, and computer program for creating an index structure for spatial data, comprising representing a product structure by a network of nodes and edges; setting a local geometric bound for each of said network nodes; propagating a cumulative geometric bound of said local geometric bounds along each of said network edges; and simplifying said cumulative geometric bound at each of said network node during said propagation; whereby a geometric bound of each network node forms a spatial index geometric bound for a matching data model object and appropriate means and computer-readable instructions.