科研之友
微信
新浪微博
Facebook
分享链接
摘要
We propose an approach using multiple representations to achieve high-performance spatial queries on 3D BIM data. The geometry data is first stored as a simple polyhedron representation inside a relational database supporting the storage of 3D geometry polyhedra. Additional representations are derived from the main geometry for ready use in many applications such as rule checking. The additional representations include a shape approximation using bounding boxes as the roughest approximation, octree decomposition using non-uniform octree cell size that also serves as a spatial index for the geometry, and its boundary representations by the topological faces that are indexed. The octree decomposition is used for efficient spatial indexing. The octree cells are decoded into a one-dimensional string so that it can be indexed using the ordinary binary tree index supported in the relational database, allowing for high-performance spatial queries. Commonly used spatial queries such as intersection and spatial relation between many objects can be efficiently performed using ordinary SQL queries. Using the proposed method, high performance integrated queries of the complete BIM data that includes its geometry can be achieved. The performance of this approach is validated by comparing identical queries against the same data using the native database supported R-tree indexing and the octree-based indexing. It shows a significant performance improvement that is 8 to 234 times faster and the performance is noticeably more consistent.
- 出版日期2017-9
