首页 | 官方网站   微博 | 高级检索  
     

基于矩阵的图形识别方法研究
引用本文:谭同德,童秉枢,李春雨.基于矩阵的图形识别方法研究[J].机械科学与技术(西安),2003,22(5):735-737,763.
作者姓名:谭同德  童秉枢  李春雨
作者单位:[1]郑州大学信息工程学院,郑州450052 [2]清华大学精密仪器与机械学系,北京100084
摘    要:为了给基于实例的设计和基于原型的设计等智能 CAD设计方法提供图形样本 ,需将已有的图形参数化。本文采用图论和拓扑学方法分析图形 ,研究了存储表达图形的邻接矩阵、寻找图形连通路径的道路矩阵后 ,推导并定义了矩阵布尔乘 ,建立了寻找从 Vi 点到 Vj 点不重复路径的计算方法 ,解决了图形的拆分问题 ,提供了识别图形及参数化的运算基础 ,并给出了实现图形自动参数化的算法流程

关 键 词:矩阵布尔乘  图形拆分  道路矩阵
文章编号:1003-8728(2003)05-0735-03

A Method for Disassembling a Graph with Matrix Boolean Multiplication
TAN Tong-de ,TONG Bing-shu ,LI Chun-yu.A Method for Disassembling a Graph with Matrix Boolean Multiplication[J].Mechanical Science and Technology,2003,22(5):735-737,763.
Authors:TAN Tong-de  TONG Bing-shu  LI Chun-yu
Affiliation:TAN Tong-de 1,TONG Bing-shu 2,LI Chun-yu 1
Abstract:Existed graph will be interpreted to parametric graph to offer graphic samples for intelligent CAD design methods, such as case based design and prototype based design, etc. Graph is analyzed by means of graph theory and topology. After studying the adjacent matrix, which saves and represents graph, and the road matrix, which seeks for continuous paths, the matrix boolean multiplication was inferred and defined, the algorithm was developed to seek for a path from a point V i to a point V j, the question of disassembling a graph was resolved, the computation base of identifying graph and parameterization was established, and the flow of algorithm was given to implement automatically parameterization graphs.
Keywords:Matrix boolean multiplication  Graph-disassembling  Road matrix
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号