一种新的任意多边形的快速填充算法

本文在分析现有多边形填充算法基础上,提出了一处新的针对任意多边形的快速填充算法。引入了点三种转换方式概念,通过建立多这形的扫描转换点表和边表,利用动态的有效边表,用直接写屏 技术来实现任意多边形的实区域的快速填充。     

基于扫描线的任意多边形填充算法

本文在基于扫描线的多边形填充算法基础上,通过建立活性边表、Y桶链表,以简化扫描线与边相交的判断,保留了基于扫描线填充适用于任意多边形的优点。     

一种新的多边形填充算法

作者在对已有的多边形填充算法深入研究的基础上,给出了一种称之为“完全记忆求交法”的新的多边形填充算法,新算法较已有算法有更高的效率。     

圆与多边形重叠区域的判定算法

本文提出了一种实用的圆与多边形重叠区域的判定算法，它集判断与确定功能于一体。该算法将多边形的边视为有向线段，通过引入多边形顶点的入边，出边交点的概念，研究了圆与多边形重叠区域的确定问题，并给出了作出其重叠区域的定理。     

一个多边形填充的快速算法

本文提出一种实用的简单多边形快速填充算法，它人有裁剪与填充双重功能，也可完成单纯的裁剪操作。     

一种改进的扫描线多边形填充算法

典型的多边形填充算法主要包括扫描线填充算法和轮廓标志域填充算法,适用于矢量多边形文件的填充算法为扫描线填充算法。论文对原有的多边形扫描线填充算法中的最常用的活性边表和传统扫描线算法进行了分析,结合活性边表和传统的扫描线填充算法的特点,针对复杂的大数据量的多边形填充时间效率较低的问题,提出了一种改进的扫描线多边形填充算法—混合填充算法。该算法采用链表和数组结合的数据结构,形成连续的填充轨迹,有效地提高了时间效率。     

带圆弧简单多边形的面积公式获取算法

从房地产管理部门对房屋面积进行精确测量的同时需要获得房屋面积丈量公式,并且在房产证明上要给出面积计算公式的实际需求出发,提出一种基于扫描线方法的带圆弧简单多边形面积算法．该算法解决了现有房屋面积计算方法中存在的计算精度不高、难以获得房屋面积丈量公式、计算方法不利于客户理解等问题;同时也解决了现有算法不能方便地对含有圆弧等形状的多边形进行精确的面积计算问题．文中算法已成功地应用于浙江省海宁市房产局的智能化房屋面积核算／分摊CAD系统,取得了良好的效果．     

简单多边形可见核的扫描线填充算法

简单多边形的可见核是位于多边形内部的一个点集，可见核内的任意一点与多边形边界上的任意一点的连线都处于该多边形的内部。由于可见核具有这一性质，对简单多边形的可见核的计算在很多方面都有着适用。本文考察了简单多边形的核的性质与特点，在结合了其他相关的可见核顶点的算法之后，提出了一个对可见核进行填充的快速算法。这一算法由于通过避免在填充多边形的核之前进行计算可见核的顶点的过程，从而可以较快地对可见核进行填充。这一算法不仅容易理解，而且便于实现。     

一种基于面积误差的多边形逼近算法

多边形逼近是提取曲线特征点和简化数据加快图形运算的一个重要方法。文中提出了一种基于面积误差的多边形逼近算法。算法可以在指定的面积误差门限范围内,满足用户对逼近效果的要求。同时这种算法稍加改造可满足指定逼近结果中多边形顶点数目的要求。实验证明这种算法逼近效果好,可以控制面积误差。     

一种基于面积误差的多边形逼近算法

多边形逼近是提取曲线特征点和简化数据加快图形运算的一个重要方法.文中提出了一种基于面积误差的多边形逼近算法.算法可以在指定的面积误差门限范围内,满足用户对逼近效果的要求.同时这种算法稍加改造可满足指定逼近结果中多边形顶点数目的要求.实验证明这种算法逼近效果好,可以控制面积误差.     

一种改进的扫描线真实感图形显示算法

真实感图形显示是计算机图形学的一个重要组成部分。扫描线算法是一种常用的真实感图形显示算法。文章在扫描线直实感图形显示算法基础之上,对其作了一定的改进。对光照模型增加了衰减变化,并使扫描线算法也适用于曲面,提高了真实感的效果。     

Parallel triangulation of a polygon in two calls to the trapezoidal map

We give a parallel method for triangulating a simple polygon by two (parallel) calls to the trapezoidal map computation. The method is simpler and more elegant than previous methods. Along the way we obtain an interesting partition of one-sided monotone polygons. Using the best-known trapezoidal map algorithm, ours run in timeO(logn) usingO(n) CREW PRAM processors.This research was supported by NSF Grants No. DCR-84-01898 and No. DCR-84-01633, and ONR Contract N00014-85-K-0046.     

Computing Optimal Diameter-Bounded Polygon Partitions

The minimum -small partition problem is the problem of partitioning a given simple polygon into subpolygons, each with diameter at most , for a given > 0. This paper considers the version of this problem that disallows Steiner points. This problem is motivated by applications in mesh generation and collision detection. The main result in the paper is a polynomial-time algorithm that solves this problem, and either returns an optimal partition or reports the nonexistence of such a partition. This result contrasts with the recent NP-completeness result for the minimum -small partition problem for polygons with holes (C. Worman, 15th Canadian Conference on Computational Geometry, 2003). Even though the running time of our algorithm is a polynomial in the input size, it is prohibitive for most real applications and we seek faster algorithms that approximate an optimal solution. We first present a faster 2-approximation algorithm for the problem for simple polygons and then a near linear-time algorithm for convex polygons that produces, for any > 0, an (+)-small partition with no more polygons than in an optimal -small partition. We also present an exact polynomial-time algorithm for the minimum -small partition problem with the additional constraint that each piece in the partition be convex.     

一种有效的任意多边形裁剪算法

介绍了一种基于改进的Weiler算法的任意多边形裁剪算法，该算法通过引入图形部件和合理的数据结构来组织裁剪后的多边形，减少了遍历多边形顶点链表的次数，并有效减少求交点的时间，具有占用存储空间少和处理速度快的特点。经过实例测试，算法对同时处理单个和多个任意多边形裁剪具有良好的稳定性、可靠性和较高的效率。     

Industrial strength polygon clipping: A novel algorithm with applications in VLSI CAD

We present an algorithm to compute the topology and geometry of an arbitrary number of polygon sets in the plane, also known as the map overlay. This algorithm can perform polygon clipping and related operations of interest in VLSI CAD. The algorithm requires no preconditions from input polygons and satisfies a strict set of post conditions suitable for immediate processing of output polygons by downstream tools. The algorithm uses sweepline to compute a Riemann–Stieltjes integral over polygon overlaps in O((n+s)log(n)) time given n polygon edges with s intersections. The algorithm is efficient and general, handling degenerate inputs implicitly. Particular care was taken in implementing the algorithm to ensure numerical robustness without sacrificing efficiency. We present performance comparisons with other polygon clipping algorithms and give examples of real world applications of our algorithm in an industrial software setting.     

Optimality and competitiveness of exploring polygons by mobile robots

A mobile robot, represented by a point moving along a polygonal line in the plane, has to explore an unknown polygon and return to the starting point. The robot has a sensing area which can be a circle or a square centered at the robot. This area shifts while the robot moves inside the polygon, and at each point of its trajectory the robot “sees” (explores) all points for which the segment between the robot and the point is contained in the polygon and in the sensing area. We focus on two tasks: exploring the entire polygon and exploring only its boundary. We consider several scenarios: both shapes of the sensing area and the Manhattan and the Euclidean metrics.We focus on two quality benchmarks for exploration performance: optimality (the length of the trajectory of the robot is equal to that of the optimal robot knowing the polygon) and competitiveness (the length of the trajectory of the robot is at most a constant multiple of that of the optimal robot knowing the polygon). Most of our results concern rectilinear polygons. We show that optimal exploration is possible in only one scenario, that of exploring the boundary by a robot with square sensing area, starting at the boundary and using the Manhattan metric. For this case we give an optimal exploration algorithm, and in all other scenarios we prove impossibility of optimal exploration. For competitiveness the situation is more optimistic: we show a competitive exploration algorithm for rectilinear polygons whenever the sensing area is a square, for both tasks, regardless of the metric and of the starting point. Finally, we show a competitive exploration algorithm for arbitrary convex polygons, for both shapes of the sensing area, regardless of the metric and of the starting point.     

拼接网格通量守恒插值算法研究

提出一种通用的拼接网格通量守恒算法应用于拼接网格"找重"过程,为拼接网格预处理提供了高效、可靠的插值方法。该算法灵活利用图形学中"多边形裁剪"原理和曲线积分公式得到拼接面上相交多边形及其面积,算法实现复杂度低,简单并健壮性较好,能够通用于结构网格和非结构网格问题。实验结果表明在大网格量、复杂拼接区域时该拼接网格插值计算方法仍能得到较理想的结果。