3D Building Routing Using Triangular Obstruction Models
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional three-dimensional routing techniques are computationally intensive and storage inefficient, requiring significant resources and time due to large data sets, leading to inefficient processing and frequent data swapping, especially when navigating complex building structures.
Innovation Solution
A storage-efficient data representation using triangular surface models of obstructions in 3D spaces, allowing efficient processing and conflict-free routing of MEP systems by minimizing database size and computational complexity.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If conventional three-dimensional routing techniques are used, then routing accuracy is maintained, but computational time and storage requirements increase significantly
Solution Approach 1:
The patent segments the three-dimensional space into discrete volumetric elements (voxels) and represents obstructions using simplified geometric primitives (spheres, cylinders, boxes) instead of complex mesh models. This segmentation reduces the computational complexity of collision detection and routing calculations while maintaining routing accuracy, directly resolving the contradiction between precision and computational time.
Solution Approach 2:
The patent creates a simplified computational representation (copy) of the three-dimensional space that preserves essential geometric and topological properties needed for routing, while omitting unnecessary detailed information. This computational model uses discrete volumetric elements and simplified obstruction geometries, enabling fast processing without sacrificing routing accuracy.
2Measurement precision
If detailed three-dimensional space representations are used, then routing precision is maintained, but storage requirements increase significantly
Solution Approach 1:
The patent segments continuous three-dimensional space into discrete volumetric elements (voxels) with fixed size, transforming infinite continuous coordinates into a finite discrete grid. This segmentation dramatically reduces storage requirements while preserving routing precision, as only occupied voxels need to be stored rather than complete surface meshes or point clouds.
Solution Approach 2:
The patent changes the representation parameters from continuous coordinates and complex surface geometries to discrete volumetric elements with simplified obstruction primitives. This parameter transformation reduces storage complexity from O(n²) or O(n³) for mesh representations to O(n) for voxel-based representations, while maintaining sufficient precision for routing operations.
3Reliability
If large data sets are used for three-dimensional routing, then routing completeness is improved, but processing efficiency decreases due to frequent data swapping
Solution Approach 1:
The patent segments the three-dimensional routing problem into independent volumetric elements that can be processed individually or in small batches. This segmentation enables efficient memory utilization and reduces data swapping, as the algorithm can process voxels in a systematic order without requiring the entire data set to be loaded into memory simultaneously, thus maintaining routing completeness while improving processing efficiency.
4Measurement precision
If complex obstruction geometries are represented in detail, then routing accuracy is maintained, but computational complexity increases
Solution Approach 1:
The patent creates simplified computational copies of complex obstruction geometries using basic geometric primitives (spheres, cylinders, boxes) that approximate the original shapes. These simplified representations maintain sufficient accuracy for collision detection and routing purposes while dramatically reducing computational complexity, as operations on primitive geometries are far less expensive than operations on complex mesh models.
Data Source
AI summary
A system uses a storage efficient data representation to route an object of variable cross-sectional area through a bounded three-dimensional space containing obstructions of varying size and complexity. The system uses the of triangular representations of the surfaces of the space in which the systems are to be routed. The system creates a computationally efficient 3D model that accurately represents the physical constraints of the space to be traversed and ensures that the routes are built within the constraints of the physical possibility requirements with no conflicts between different types of objects being routed.