工程图中查找极值点及视图划分中心点的算法  

Algorithm of Finding Extreme Points and Center Point of Views-Dividing in Engineering Drawing

作　　者：张云辉[1] 高满屯[1] 吴建军[1] 张燕[2] 

机构地区：[1]西北工业大学机电学院,陕西西安710072 [2]华为西安研究所,陕西西安710075

出　　处：《工程图学学报》2009年第4期55-63,共9页Journal of Engineering Graphics

摘　　要：提出了自动识别工程图中视图极值点和视图划分中心点的方法;叙述了图元包围盒的思想;给出了三视图划分的两种预处理算法,即二分扫描线算法和极大相邻坐标扫描线算法。针对后一个算法,给出了基本图元包围盒的性质,定义了图元包围盒一维投影轴的概念和相应的视图划分原则。通过获取的视图极值点及视图划分中心点,可将同属一个全局坐标系中的三个视图分开,为后续建立三视图的局部坐标系作准备。An algorithm to find the extreme points of three views and the center point of views-dividing in engineering drawings is presented. The idea of Geometric Extent Box （GEB） is described, and two preprocessing algorithms, i.e. Dichotomy Scan Line algorithm （DSL） and Maximum Adjacent Coordinate Scan Line algorithm （MACSL）, are given. Some important ideas are given to MACSL, such as properties of GEB, the concept of One Dimensional Projection Axis of GEB, and the principle of the views-dividing. After getting extreme points and the center point, the three views under the global coordinate system can be divided into three individual views. This work lays the foundation for establishing local coordinate system of each view in the followed works.

关 键 词：计算机应用 三视图划分 视图划分中心点 视图极值点 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]