The Representation and Manipulation of Convex Polygons
The Representation and Manipulation of Convex Polygons
复制标题
凸多边形的表示和操作
DOI：
10.1007/978-3-642-83539-1_8
复制
发表时间：
1988
期刊：
影响因子：
--
通讯作者：
A. Middleditch
中科院分区：
文献类型：
--
作者：
A. Middleditch
印刷电路板（PCB）和超大规模集成电路（VLSI）层上的许多元件被定义为多边形，可能具有弯曲的边缘。所谓的2.5D机械部件（或其中的“凹穴”）可以由高度（或深度）和横截面限定，其也可以被限定为曲线多边形区域。弯曲的边缘可以由直线近似，凹多边形可以分解成组成的凸多边形。类似地，3D表面可以由凸多边形小平面来近似。凸多边形上的算法比凹多边形上的算法更有效和鲁棒。因此，这种算法适用于计算机辅助设计（CAD）和制造（CAM）中的许多应用。
Many elements on printed circuit boards (pcb) and layers of very large scale integrated (VLSI) circuits are defined as polygons, possibly with curved edges. A so called 2.5D mechanical component (or ‘pockets’ therein) can be defined by a height (or depth) and a cross section, which may also be defined as a curvilinear polygonal region. Curved edges may be approximated by straight lines and concave polygons may be decomposed into constituent convex polygons. Similarly, 3D surfaces can be approximated by convex polygonal facets. Algorithms operating on convex polygons are more efficient and robust than their concave counterparts. Therefore, such algorithms are suitable for many applications in computer aided design (CAD) and manufacture (CAM).