| 基于图论的平面图形划分算法 |
| |
| 引用本文： | 杜宏明,姚红卫.基于图论的平面图形划分算法[J].西北轻工业学院学报,2009,27(1):125-129. |
| |
| 作者姓名： | 杜宏明 姚红卫 |
| |
| 作者单位： | 西南交通大学机械工程学院,四川,成都,610031
|
| |
| 摘 要： | 提出了一种基于图论的平面图形划分的新方法．首先，平面图形被表示为一有向图，然后用图论中计算基本回路的方法将其划分为只在公共边搭接、互不包含的若干小平面．运用实例表明，与其他算法相比，该方法具有实现容易、划分准确、运算效率高等优点，可用于二维、三维几何形体的集合运算．
|
| 关 键 词： | 图论 有向图 基本回路 平面图形划分 几何造型 集合运算 |
ALGORITHM FOR SPLITTING PLANNER FACES BASED ON GRAPH THEORY |
| |
| DU Hong-ming,YAO Hong-wei.ALGORITHM FOR SPLITTING PLANNER FACES BASED ON GRAPH THEORY[J].Journal of Northwest University of Light Industry,2009,27(1):125-129. |
| |
| Authors: | DU Hong-ming YAO Hong-wei |
| |
| Affiliation: | (College of Mechanical Engineering, Southwest Jiaotong University, Chengdu 610031,China) |
| |
| Abstract: | A new algorithm for splitting planner faces based on graph theory is presented in this paper. First, a planner face can be described as a directed graph, then it is split into some small faces just joining at the common borderlines according to the method of calculating fundamental loops in graph theory. Application example shows that compare with other algorithm, it is relatively simple to implement and Inherent with accuracy and efficiency. |
| |
| Keywords: | graph theory directed graph fundamental loop planner face splitting geometry modeling set operation |
| 本文献已被 维普 万方数据 等数据库收录！ |
