| 直线剖分平面算法的实现和应用 |
| |
| 引用本文： | 王钲旋,庞云阶.直线剖分平面算法的实现和应用[J].计算机辅助设计与图形学学报,1994,6(2):101-105. |
| |
| 作者姓名： | 王钲旋 庞云阶 |
| |
| 作者单位： | 吉林大学计算机科学系 |
| |
| 摘 要： | 本文引入一种称为“区域树”的二叉树结构来表示若干直线由于相交而形成的对平面的剖分,并以之实现了一个“增加构造”方式的直线剖分平面算法。算法可用于解决许多与平面直线图形有关的问题,本文给出了如下应用实例：点定位问题,半平面公共交问题,简单多边形凸分解问题,简单多边形求交问题。
|
| 关 键 词： | 二叉树 区域树 平面剖分 数据结构 |
THE IMPLEMENTATION AND APPLICATION OF AN ALGORITHM FOR STRAIGHT LINES SUBDIVING PLANES |
| |
| Wang Zhengxuan,Pang Yunjie.THE IMPLEMENTATION AND APPLICATION OF AN ALGORITHM FOR STRAIGHT LINES SUBDIVING PLANES[J].Journal of Computer-Aided Design & Computer Graphics,1994,6(2):101-105. |
| |
| Authors: | Wang Zhengxuan Pang Yunjie |
| |
| Affiliation: | Department of Computer Science Jilin University Changchun 130023 |
| |
| Abstract: | A data structure of binary tree called " region tree " is introduced and applied to express planar subdivision by straight lines. An algorithm for straight lines subdividing planes is presented and applied to solve several problems , they are: point location in the planar subdivision by straight lines, intersection of half-planes, convex decomposition of a simple polygon, intersection of two simple polygons. |
| |
| Keywords: | region tree binary tree planar subdivision computational geometry |
| 本文献已被 CNKI 维普 等数据库收录！ |
