Finally, the effective general polygon clipping algorithm is given.
最后给出一个稳定可靠的任意多边形裁剪算法。
The clipping algorithm is an important algorithm of computer graphical processing.
裁剪算法是计算机图形处理的重要算法。
Clipping algorithm is an basic algorithm in the Computer Graphics and the base of a lot of important task.
裁剪算法是计算机图形学中的基本算法，也是其它诸多重要问题的基础。
A clipping algorithm for complex2 D graphs based on the robust intersection points seeking method is presented.
首先对于矩形窗口，介绍了直线裁剪算法，圆和椭圆裁剪算法以及参数曲线的裁剪算法。
An efficient cylindrical clipping algorithm is presented to rapidly drill holes in polyhedrons, which are made up of convex polygons.
提出一种高效的对凸多边形组成的多面体进行圆柱面裁剪的算法，并实现了多面体的快速钻孔。
To overcome the disadvantages of the traditional volume clipping algorithm, this paper proposes a fast volume clipping method based on ray-casting.
针对传统图形绘制算法速度慢，质量不高的缺点，提出了一种快速的基于光线投射法的体切割预处理方法。
Also the details about the coast, target and other navigational subjects echo and the interference of echo and Ring, Ebl, Vrm of Radar and clipping algorithm etc.
介绍了模拟港口岸形、物标回波和其他助航物标回波的生成，雷达回波的干扰、遮挡和衰减，固定距标圈、电子方位线和活动距标圈的显隐与图像的有关裁剪算法等。
Based on profound study of various position relations between a line segment and a circle, a simple and rapid clipping algorithm for circular window is presented in this paper.
通过对直线段相对圆的各种位置关系作深入的研究，提出了一种简单而迅速的圆形窗口裁剪算法。
Through judging the relation of the position between the circle clip window and the line to be clipped, a new line-clipping algorithm is given based on the correlative literatures.
在相关文献提出的基于矩形窗口裁剪的圆形窗口裁剪算法的基础上，通过判断圆形窗口与待裁线段的位置关系，提出一个免解二次方程的圆形窗口裁剪算法。
Since graphics clipping and region filling are needed in the chart display, the graphics clipping algorithm and region filling algorithm are designed according to the requirement of the chart display.
闭于比现无算法，依据海图现示的须要，设计实现了海图现示外的图形剪裁和区域挖充算法。
The algorithm idea is simple, and enhances the efficiency of clipping.
算法思想简单，极大地提高了裁剪的效率。
Based on the analysis of advantages and disadvantages of the existing algorithms, a new algorithm for line clipping was proposed.
在分析已有线裁剪算法优点和缺点的基础上，提出了一种新的一般多边形窗口线裁剪算法。
Presents an algorithm for polyline clipping based on a multiply connected domain formed by finite loops.
提出了一种有限环域裁剪多义线的算法。
The experimental results show that this algorithm possesses better invisibility and has good robustness to clipping, noise, filtering and JPEG compression attack.
实验结果表明该算法具有较好的不可见性，对剪切、噪声污染、滤波、JPEG压缩攻击具有良好的鲁棒性。
The algorithm which is based on the principle is simple, clear and logically strict, and therefore it can increase the efficiency and speed of clipping...
根据这一原理所建立的算法及程序思路简明精炼、逻辑性强，显著地提高了裁剪的速度及效率。
Graphics clipping and covering is one of the key points in computer graphics field. After more study and practice, a new algorithm is give, which is for clipping and covering in circular window.
图形的裁剪与覆盖是计算机图形学中较为热点研究的问题，作者对此进行了深入的研究与实践，提出了较为理想的圆形窗口“裁剪与覆盖”的计算机辅助设计新算法。
The experiments show that the blind watermarking algorithm is robust in JPEG image compression, image clipping, image scaling and image filtering, especially in wavelet image compression.
实验结果表明，该算法对JPEG压缩及图像剪裁、缩放、滤波有较好的鲁棒性，特别对于基于小波压缩算法的图像具有很好的鲁棒性。
In order to enhance clipping velocity as much as possible, the technique of line geometric transformation is imported to later flow of the new algorithm.
后续流程引入线段几何变换技术实施裁剪，尽可能加快求交进程。
Graphics clipping and covering is one of the key points in computer graphics field. Alter more study and practice. a new algorithm is give. which is for clipping and covering in circular window.
图形的裁剪与覆盖是计算机图形学中较为热点研究的问题，作者对此进行了深入的研究与实践，提出了较为理想的圆形窗口“裁剪与覆盖”的计算机辅助设计新算法。
A new algorithm for the line clipping against a triangle is proposed and described in detail in this paper.
本文详细描述了一种三角形窗口线裁剪的新算法。
In this thesis, a method of real-time painting and clipping based on GPU Marching Cubes algorithm, with a surface marking rule, is presented.
本文在GPU的移动立方体算法基础之上，提出面标记策略的实时着色与实时切割技术。
Experimental results show that this algorithm is robust and the hiding text is invisible, and it is excellent in resisting the JPEG compression resistance, noise and clipping.
实验表明，该算法具有较强的鲁棒性和不可见性，在抵抗JPEG压缩、噪声、剪切等干扰具有较优良的性能。
The algorithm can simplify mesh models effectively, it also USES distance-weighting for viewport-clipping, results in view-dependent simplified mesh model. The pros and cons are also analysed.
还将距离加权用于视窗裁剪，得到视点相关的网格模型。并对该算法的优点及存在的问题作了分析。
The algorithm can simplify mesh models effectively, it also USES distance-weighting for viewport-clipping, results in view-dependent simplified mesh model.
该方法能根据视点位置简化网格，产生符合观察需要的网格；还将距离加权用于视窗裁剪，得到视点相关的网格模型。
The algorithm can simplify mesh models effectively, it also USES distance-weighting for viewport-clipping, results in view-dependent simplified mesh model.
该方法能根据视点位置简化网格，产生符合观察需要的网格；还将距离加权用于视窗裁剪，得到视点相关的网格模型。
应用推荐