通过对多边形可见边的分析，利用平面扫描技术，给出了求其可见边的算法。
By analysing of the visibility edges of the polygons, using the plane sweep technique, we present an algorithm to find the visibility edges of the set of polygons.
将三维扫描仪测量得到的点云转换成一个实际的3D（三维）多边形模型，以满足高级建模和可视化的需要。 为此提到了转换过程中出现的所有问题和解决方法。
We addressed the problems and solutions of converting a measured point cloud into a realistic 3D polygonal model that can satisfy high modelling and visualization demands.
通过分析多边形轮廓的填充特点，提出了一种填充扫描矢量方向的优化方法。
Through analyzing the filling characteristics of polygonal contours, an optimization method of scanning vectors for filling sectional contours was presented.
通过扩展计算几何中“单调链”概念，提出了一种新的多边形扫描线填充算法，即基于单调链的扫描线多边形填充算法。
This paper extends the concept of monotone chain in computational geometry. It presents a new polygon scanning fill algorithm, polygon filling algorithm based on monotony chain.
此外，在动画、虚拟环境、网络浏览、医学扫描、计算机游戏等领域已经可以看到许多由多边形网格构建的实体模型。
Furthermore, there are entity models created by polygon mesh in many applications such as cartoon, vision environment, network browse, physic scanning, computer games.
文章提出通用扫描线多边形填充算法，该算法可以有效地解决任意间距、任意倾角的扫描线对多边形的填充问题。
This paper puts forward General scan-line polygon fill algorithm. This algorithm can use scan-lines of varied interval and varied slope to fill a polygon.
边缘填充是一类多边形扫描转换算法，算法思路清晰，结构简单。
Edge filling algorithm is one of scan conversion algorithm. The thought of Edge filling is distinct and its structure is simple.
此外，在动画、虚拟环境、网络浏览、医学扫描、计算机游戏等领域已经可以看到许多由多边形网格构建的实体模型。
Furthermore, there are entity models created by polygon mesh in many applications such as cartoon, vision environment, network browse, physic scanning and computer games.
采用基于分割栅格多次扫描的方法对建筑物多边形进行化简以及形状优化。
As for the simplification of building shape, a new method based on grid multi-scan is used to simplify and optimize the building shape.
传统的扫描线多边形填充算法只适用于水平扫描线的逐行填充。
Traditional scan-line Polygon-Filling Algorithm can only deal with horizontal scan-lines and can only fill a polygon line by line.
给出了任意图形的多边形逼近、非凸图形的凸组合、利用NFP做碰撞检测和扫描线搜索图形间缝隙等方法。
The paper gives out a method to combine non-convex figures into a convex one, a method to get bumping region by using NFP, and a scanning-line method to search the gaps among adjacent figures;
给出了任意图形的多边形逼近、非凸图形的凸组合、利用NFP做碰撞检测和扫描线搜索图形间缝隙等方法。
The paper gives out a method to combine non-convex figures into a convex one, a method to get bumping region by using NFP, and a scanning-line method to search the gaps among adjacent figures;
应用推荐