|
| 新型建筑智能化平台的节点拓扑匹配算法研究 |
| Research on node topology matching algorithm of new building intelligent platform |
| 投稿时间：2018-10-12 修订日期：2018-11-14 |
| DOI： |
| 中文关键词: 新型建筑智能化平台 CAD 子图同构 非递归 |
| 英文关键词: new building intelligent platform CAD sub-graph isomorphism non-recursive |
| 基金项目:新型建筑智能化系统平台技术 国家重点研发计划资助项目(2017YFC0704100) |
|
| 摘要点击次数: 748 |
| 全文下载次数: 0 |
| 中文摘要: |
| 针对新型建筑智能化平台中空间拓扑与节点拓扑一致性问题，提出了一种拓扑匹配算法。在拓扑匹配过程中，通过提取CAD的B-Rep信息，将其表示为以空间单元作为节点的属性邻接图，CAD空间拓扑结构被表示为“大图”,平台中智能节点交互形成的拓扑结构，被表示为“小图”，一致性问题被转化为“大图”中查询同构的“小图”问题。本文算法首先利用节点度优化匹配顺序,其次增加了关于顶点邻域信息的剪枝条件，对候选集匹配项进行筛选，最后采用非递归-回溯思想对数据节点进行验证，并在真实的数据集上验证了算法的适用性与高效性。 |
| 英文摘要: |
| A node topology matching algorithm is proposed to solve the consistency problem between spatial topology and node topology based on new building intelligent platform. In the process of topology matching, the B-Rep information of CAD is extracted and represented as an attribute adjacent graph with spatial units as nodes. The topological structure of CAD's space is represented as a "big graph", and the topological structure formed by the interaction of intelligent nodes in the platform is represented as a "small graph", and the consistency problem is translated into the "small graph" problem of querying isomorphism in the "big graph". Firstly, node degree is used to optimize the matching order. Secondly, the neighborhood information of vertices is added as pruning condition to filter the matching items of candidate sets. Finally, non-recursive backtracking is used to verify the data nodes, and the applicability and efficiency of the algorithm are verified on the real data sets. |
|
View Fulltext
查看/发表评论 下载PDF阅读器 |
| 关闭 |